A preview of this full-text is provided by Trans Tech Publications Ltd.
Content available from Key Engineering Materials
This content is subject to copyright. Terms and conditions apply.
Address Analyzer Based on the Maximum Matching Algorithms
Shumin Zhou
1, a
, Rui Chen
2,b
, Bin Tang
1,c
1
Engineering Research Center of Nuclear Technology Application (East China Institute of
Technology), Ministry of Education, Nanchang ,330013, China
2
School of Information Engineering, East China Institute of Technology, Fuzhou, Jiangxi,China
a
smzhou@ecit.edu.cn,
b
ruichen@ecit.edu.cn,
b
tangbin@ecit.edu.cn
Keywords: code, address tree, node, matching, optimization
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.
Introduction
The research on address coding has wide application ,in which the most important one is the zip
code .The Zip code consists of six Arabic number, whose structure is a grade of four, which separately
represents the provinces (autonomous regions and municipalities),postal delivery zone, city and post
office.
Obviously, this encoding that it is simply according to the administration region in address to
divide entrained by the address administration region easy to combine information into a coded form;
moreover its most detailed classifying is to post office. Depended on the coding it still do not know
where to deliver, but also requires man to check through the specific information of address.
Therefore, the primary questions is how to identify address tree through the encoding (1) Set up a
reasonable model of the address tree. (2) Construct the address parser based on the knowledge of
address tree. (3) Set up and adjust the address growing tree model mechanism.
The model of address tree
A rigorous, being read and being delivered address should include the following essential factors:
accurate address name; explicit subordination relations; precise address spot. The model of address
tree is a digital model that completely describes the specific address, which similarly must contain
three elements: the description of address name, the subordination relations of address and the
location of post.
The goal for setting up the address tree model is to read and standard the address, the algorithm of
address tree analysis is a tool which is used to read and standardize addresses, and it is a recursive
Algorithm based on the model of address tree. The algorithm variables show : MAXL stands for the
largest matching number that is permitted , IADD is on behalf of the initial address to be analyzed, P
is on behalf of the father node ID, RADD represents the address which is return by matched, L [i]
represents each node which is matched successfully, M [L [i ]]represents information description of
the ith node, RLEN [i] represents the length of the matching string , RLEV [i] represents node layers
which are between the root node and the current matching node. Algorithm flow is shown in Figure 1.
①When the address is analyzed, If the number which could be matched is more than designated
number, the original address must have some questions. such as: street-region- Beijing city, it will be
found dozens which conforms to this condition.
Key Engineering Materials Online: 2011-01-20
ISSN: 1662-9795, Vols. 460-461, pp 296-299
doi:10.4028/www.scientific.net/KEM.460-461.296
© 2011 Trans Tech Publications Ltd, Switzerland
All rights reserved. No part of contents of this paper may be reproduced or transmitted in any form or by any means without the written permission of Trans
Tech Publications Ltd, www.scientific.net. (Research Gate for subscription journals-10/02/24,01:02:39)
