High - Speed Korean Address Searching System for Efficient Delivery Point Code Generation 


Vol. 8,  No. 3, pp. 273-284, Jun.  2001
10.3745/KIPSTD.2001.8.3.273


PDF
  Abstract

A systematic approach for interpreting Korean addresses based on postal code is presented in this paper. The implementation is focused on producing the final delivery point code from various types of address recognized. There are two stages in the address interpretation : 1) agreement verification between the recognized postal code and upper part of the address and 2) analysis of lower part of the address. In the agreement verification procedure, the recognized postal code is used as the key to the address dictionary and each of the retrieved addresses is compared with the words in the recognized address. As the result, the boundary between the upper part and the lower part is located. The confusion matrix, which is introduced to correct possible mis-recognized characters, is applied to improve the performance of the process. In the procedure for interpreting the lower part address, a delivery code is assigned using the house number and/or the building name. Several rules for the interpretation have been developed based on the real addresses collected. Experiments have been performed to evaluate the proposed approach using addresses collected from Kwangju and Pusan areas.

  Statistics


  Cite this article

[IEEE Style]

G. H. Kim, S. G. Lee, M. Y. Shin, Y. S. Nam, "High - Speed Korean Address Searching System for Efficient Delivery Point Code Generation," The KIPS Transactions:PartD, vol. 8, no. 3, pp. 273-284, 2001. DOI: 10.3745/KIPSTD.2001.8.3.273.

[ACM Style]

Gyeong Hwan Kim, Seok Goo Lee, Mi Young Shin, and Yun Seok Nam. 2001. High - Speed Korean Address Searching System for Efficient Delivery Point Code Generation. The KIPS Transactions:PartD, 8, 3, (2001), 273-284. DOI: 10.3745/KIPSTD.2001.8.3.273.