Address Analyzer Based on the Maximum Matching Algorithms

Article Preview

Abstract:

Based on the analysis of current zip code, this article put forward a new encoding algorithm of the address tree - the largest matching algorithm. This algorithm combines the characteristics of the address tree, considering the uniqueness of the address tree, raises a best matching theory, and taking into the matching speed of the address tree, brings in the associate floors of the node of the address tree to improve the efficiency of the match. Because of the change of the address tree, the address tree’s thesaurus in order to timely update its information, increase unknown node by intelligent means automatically.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 460-461)

Pages:

296-299

Citation:

Online since:

January 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Liu Yuan. On the Chinese word segmentation method . Journal of Chinese Information Processing, 1989, (1), pp.36-40.

Google Scholar

[2] ChengWei. Comparing the best string-matching algorithm research and application. Computer Engineering and Design , 2004, 25(9): 1430-1432.

Google Scholar

[3] Cheng Gui Lin. An Improved Segmentation Algorithm Express. Computer Research and Development, 2004. 04.

Google Scholar

[4] Shin, Bhum Jae. Characteristics of an address discharge in ac plasma display panels. IEEE Transactions on Plasma Science, v 33, n 4, pp.1426-1430, August (2005).

DOI: 10.1109/tps.2005.852432

Google Scholar