Pattern matching access

Method for ascertaining valid address codes

6970868

Abstract

The invention relates to a method for ascertaining valid address codes for valid address data using an address dictionary which stores all the permissible address details with the associated address codes in searchable form for a particular territory. The address dictionary is automatically searched using the valid address data and all the coarsening stages respectively derived therefrom. The address codes contained in the dictionary entries found for each valid address, including all the associated coarsening stages, are output as a valid address code.


Claims

1. A computer implemented method for determining whether an address is valid, comprising the steps of:

determining a postal code for the address;

coarsening the address so as to create a coarsened address if the postal code was determined;

determining another postal code for the coarsened address;

repeating the steps of coarsening and determining another postal code if the another postal code was determined.

2. The method according to claim 1, wherein the step of coarsening further comprises the step of removing from the address a part which described it most precisely.

3. The method according to claim 2, further comprising the step of repeating the step of repeating until the another postal code is no longer determinable.

4. The method according to claim 3, wherein the step of determining a postal code further comprises the step of encoding the address and searching an address database for the postal code associated with the encoded address.

5. The method according to claim 4, further comprising the step of outputting the postal code and each of the another postal code to a memory.


Description

The invention relates to a method for ascertaining valid address codes for valid address data using an address dictionary.

Automatic address reading for dispatches is a technology for sorting and distributing the dispatches which is used throughout the world. In this case, the addresses on the dispatches comprise a postal code, town details, street names, house numbers, possibly apartment numbers and names, and any other identifying details. The postal code comprises either digits (ZIP code in the US, postcode in Germany) and describes the town, or a mixture of digits and letters and describes the address down to the street.

The automatic reading operation in an OCR reader involves reading the characters and then the individual elements of the address. This is followed by matching to the entries in an address dictionary, and the address dictionary is used to ascertain an address code (postal code and other code characters entered in the address database) which describes the address down to house numbers in a street. If the postal code describes the address down to the street, the reading in the OCR unit involves matching the postal code data read and the city and street names read and also house numbers to determine validity.

This technology is not perfect, however. In many cases, the distribution information ascertained during automatic reading does not match the distribution information on the postal dispatch.

Comparison of the address code determined during automatic reading of the address with all the address codes which are valid for this address makes it possible to establish whether the address code determined during automatic reading is correct or incorrect. To do this, it is necessary to ascertain the valid address codes for the respective address.

To obtain valid address data required for this, the address has to date been input manually at a video coding station in accordance with the prior art. In that case, the operator has used the address data which have been input to search an address dictionary containing addresses and associated address codes interactively for corresponding entries with the address codes using a lookup, this search being based on empirical values for the respective operator. The address codes ascertained in this way have then been output as valid address codes.

This practice is time-consuming, susceptible to error and usually does not provide all the valid address codes for an address. Furthermore, the procedure needs to be repeated whenever the lookup is updated.

The invention specified in claim 1 is based on the object of providing a method for ascertaining valid address codes for valid address data using an address dictionary in which all the address codes valid for the address are ascertained in a short time.

On the basis of the invention, the address dictionary, which stores all the permissible address details with the associated address codes in searchable form for a particular territory, is automatically searched using the valid address data and all the coarsening stages respectively derived therefrom. The address codes contained in the dictionary entries found for each valid address, including all the associated coarsening stages, are then output as valid address codes. This eliminates the previously used manual search process in the address dictionary, which is complex and dependent on experience.

It is advantageous for the first coarsening stage to be derived by removing from the full address the part which describes it most precisely, for the second coarsening stage to be derived by removing from the first coarsening stage the part which describes it most precisely, and for this to be continued for as long as an appropriate entry is found in the address dictionary.

Another advantage is for the valid address data to be produced by manual input.

The invention is explained in more detail below in an exemplary embodiment with reference to the drawing, in which:

FIG. 1 shows the method sequence using a flowchart.

To produce valid address data, an address is first input manually 1. Next, an address dictionary storing all the permissible address details with the associated address codes in searchable form for a particular territory is searched for the address data which have been input for this address 2.

If a corresponding entry has been found, the address code contained is stored 3. Next, the part with the most precise description is removed from these address details 4. There is then another search through the address dictionary using these reduced/coarsened address details 2. If an entry has been found, the address code it contains is likewise stored 3 and, from these partially reduced address details, the part which now has the most precise description is likewise removed 4. This method is used to search the address dictionary, etc. This process is carried out until no more entries are found. The address codes stored during this procedure are then output as valid address codes 5, and the ascertainment of the address codes which are valid for the address which has been input is terminated. If the address data which were input did not find any entry in the address dictionary right at the start (incorrect address details), the procedure is terminated immediately.

A US address is used to explain this briefly:

    • INDEPENDENCE BLUE CROSS
    • 1901 MARKET STREET STE 3
    • PHILADELPHIA Pa. 19103


    • The postal code for this address is: 19103-1475-01

    The associated address elements are:
    • City="PHILADELPHIA", State="PA", Zip Code="19103"
    • Primary Number="1901", Street="MARKET", Suffix="ST"
    • Secondary Name="STE", Secondary Number="3"
    • Firm="INDEPENDENCE BLUE CROSS"


    • The coarsening operations for this are as follows:
    • 1901 MARKET STREET STE 3
    • PHILADELPHIA Pa. 19103


    • The postal code for this is: 19103-1400-03
    • 1901 MARKET STREET STE
    • PHILADELPHIA Pa. 19103


    • The postal code for this is: 19103-1400-99
    • 1901 MARKET STREET
    • PHILADELPHIA Pa. 19103


    • The postal code for this is: 19103-1414-01
    • PHILADELPHIA Pa. 19103


    • The postal code for this is: 19103.
    • PHILADELPHIA Pa.


    • The postal code for this is: 19100.

    These address codes listed here are all the valid address codes for the indicated address.

    «Previous Next»
    Methods and apparatus for user-centered similarity learning Database searching using trapeze fetch