测绘通报 ›› 2018, Vol. 0 ›› Issue (9): 126-129,155.doi: 10.13474/j.cnki.11-2246.2018.0294

Previous Articles     Next Articles

Research and Implementation of Fuzzy Matching for K-tree Address

LI Xinfang1,2, SONG Zhuanling1, CHEN Xueye3, HE Biao3, LIU Haixing1,2   

  1. 1. The First Institute of Oceanography, State Oceanic Administration, Qingdao 266061, China;
    2. Laboratory for Regional Oceanography and Numerical Modeling, Qingdao National Laboratory for Marine Science and Technology, Qingdao 266237, China;
    3. Shenzhen Research Center of Digital City Engineering, Shenzhen 518040, China
  • Received:2017-12-26 Revised:2018-01-29 Online:2018-09-25 Published:2018-09-29
  • Contact: 刘海行。E-mail:liuhx@fio.org.cn E-mail:liuhx@fio.org.cn

Abstract:

In the integration of digital city information resources,the address matching is a very crucial basic technology.Due to the complexity of description of Chinese semantics and address,the matching of Chinese addresses is much more complicated than that of English.How to accurately segment words based on mass data of Chinese address and realize fast and efficient address matching is an urgent problem to be solved.Based on the research of existing address coding and word segmentation technology,this paper proposes a combination method based on rules and statistics to implement Chinese address segmentation,and uses K-tree to store the Chinese address and improves the Chinese address matching query Accuracy and efficiency.The method was tested by the prototype system based on 10,000 address data after pretreatment in Shenzhen City to verify the effectiveness of the method.

Key words: address matching, address segmentation, fuzzy matching, K-tree

CLC Number: