Changes

In a small number of cases it is possible that the source string will achieve more than one A (Area) or P (Place) matchfor more than one FC code. For example suppose the string "Glouchester Street Cambridge Cambridgeshire" were considered. This could concievably produce two P matches and one A match with the token matching algorithm detailed above.

*If there an FC code has only one match keep that one match*Aim for distinction in the set, giving priority in the order that the FC codes are both specified in MatchLocations.pl. The default is to include A,P ,L in order, so that precedence follows importance and size. This is important if multiple FC codes contain multiple overlapping matches. For example suppose A matches =1,2 P=2,3 and more than one of either P L=3. The algorithm will look forward and/or backwards to assign: A =1 P=2 L=3.*Determine the set of FC code matches, then determine the P-A pair with the shortest distance between then them using a [http://en.wikipedia.org/wiki/Haversine_formula Haversine formula] distance calculation based on the GNS reported longitudes and latitudes. (Note that the Haversine formula is implemented in the Match::GNS.pm module and is the most accurate method over short distances, where other methods, like the great-circle method, suffer from compounded rounding error problems.)*If there are This is important when multiple P FC codes have muliple matches but no A matches, take the one that was arrived at firstthey do not overlap.*If there are multiple A matches but no P matchesone or more match is found for an FC code then one final 'best' match must be reported, take the one that was arrived at firsteven if it overlaps with another FC code or is distant.