Universal address parsing system and method

• US 7,818,333 B2
• Filed: 06/06/2007
• Issued: 10/19/2010
• Est. Priority Date: 12/28/2006
• Status: Active Grant

• Current Assignee: Precisely Software Incorporated
• Original Assignee: Pitney Bowes Software Incorporated (Böwe Systec AG)
• Inventors: Biard, John R., Bourland, Freddie J. II
• Primary Examiner(s): To; Baoquoc N
• Application Number:
  US11/810,574
• Publication Number:
  US 20080162513A1
• Time in Patent Office: 1,231 Days
• Field of Search: None
• US Class Current: 707/763
• CPC Class Codes: G01C 21/28 with correlation of data from several navigational instruments
• CPC Class Codes: G06F 40/205 Parsing

Abstract

A method and system for parsing of input addresses for further automated processing. A relevant locale for an input address is determined. Based on the locale, an applicable parsing tree is provided so that different address formats can be tested against the input address. The parsing tree is generated from a local address format specification that defines permissible formats for the locale. The local address format specification and the local address component rules are provided to a parsing engine to determine one or more potential parsed addresses based on compliance with specifications. The local address component rules specification is applied to the input address to determine one or more branches of the parsing tree for which the input address matches criteria of the component rules specification. Penalties may be assigned to branches of the tree when disfavored matches occur. The various branches can be ranked based on their penalties to determine the best matches to be provided to the geocoding system.

Claims

1. A computer implemented method of parsing an address for automated processing, the method comprising:

receiving an input address;

determining, with a processor, a relevant locale for the input address;

selecting, with the processor, an applicable local address format specification based on the relevant locale;

selecting, with the processor, an applicable local address component rules specification based on the relevant locale;

applying, with the processor, the local address format specification and the local address component rules to a parsing engine to determine one or more potential parsed addresses based on compliance of the input address with formats embodied in the local address format specification and the local address component rules specification;

generating a parsing tree based on the local address format specification; and

applying the local address component rules specification to the parsing engine to determine one or more branches of the parsing tree for which the input address matches criteria of the component rules specification.

2. The method of claim 1 further comprising the step of assigning penalties when disfavored matches occur in applying the input address to the one or more branches of the parsing tree.

3. The method of claim 2 further comprising ranking the one or more parsing tree branches that include matches based on the assigned penalties.

4. A computer implemented method of parsing an address for automated processing, the method comprising:

storing a local address format specification on a storage device;

storing a local address component rules specification on the storage device;

generating, with a processor, a plurality of parsing trees based on the local address format specification;

receiving an input address;

determining, with the processor, a relevant locale for the input address;

selecting, with the processor, a relevant parsing tree from the plurality of parsing trees based on the relevant locale; and

applying, with the processor, the local address component rules specification to the input address in view of the relevant parsing tree to determine one or more branches of the relevant parsing tree for which the input address matches criteria of the component rules specification.

5. The method of claim 4 further comprising the step of assigning penalties when disfavored matches occur in applying the input address to the one or more branches of the parsing tree.

6. The method of claim 5 further comprising ranking the one or more parsing tree branches that include matches based on the assigned penalties.

7. An address parsing computer system applicable for use across different regions having different addressing formats and rules, the system comprising:

a storage device configured to store a local address format specification including a listing formatting sequences of address components that are allowed in a particular region;

the storage device configured to store a local address component rules specification including a plurality of rules identifying the composition of particular address components; and

a processor configured with a universal parsing engine composed independently of the local address format specification and the local address component rules specification, the universal parsing engine arranged to determine one or more potential parsed addresses based on compliance of an input address with formats embodied in the local address format specification and the local address component rules;

wherein the universal parsing engine is further arranged to generate a parsing tree based on the formatting sequences of the local address format specification, and to apply the local address component rules to determine one or more branches of the parsing tree for which the input address matches criteria of the component rules specification, thereby determine compliance with formats embodied in the local address format specification and the local address component rules.

8. The address parsing system of claim 7 wherein the universal parsing engine is further arranged to assign penalties when disfavored matches occur in applying the input address to the one or more branches of the parsing tree.

9. The address parsing system of claim 8 wherein the universal parsing engine is further arranged to rank the one or more parsing tree branches that include matches based on the assigned penalties.