The Study of Address Tree Coding Based on the Maximum Matching Algorithm in Courier Business
暂无分享,去创建一个
As an important component of EMS monitoring system, address is different from user name with great uncertainty because there are many ways to represent it. Therefore, address standardization is a difficult task. Address tree coding has been trying to resolve that issue for many years. Zip code, as its most widely used algorithm, can only subdivide the address down to a designated post office, not the recipients’ address. This problem needs artificial identification method to be accurately delivered. This paper puts forward a new encoding algorithm of the address tree - the maximum matching algorithm to solve the problem. This algorithm combines the characteristics of the address tree and the best matching theory, and brings in the associated layers of tree nodes to improve the matching efficiency. Taking the variability of address into account, the thesaurus of address tree should be updated timely by increasing new nodes automatically through intelligent tools.
[1] Yan Jiang,et al. A Suffix Tree Based Handwritten Chinese Address Recognition System , 2007 .
[2] Jaewoo Kim,et al. Route optimization for network mobility with tree-based care of address , 2009, 2009 15th Asia-Pacific Conference on Communications.
[3] Brigitte Charnomordic,et al. A segmentation algorithm for the delineation of agricultural management zones , 2010 .