Abstract: A fuzzy matching strategy of Chinese address geocoding, in which the K-ary tree is used to enhance the accuration and search speed of matching, is proposed for given spatial database scheme. The input Chinese address is dissected and standardized as individual address elements, and each element of the address is searched against the reference database. The returned result data are saved in K-array tree, and the branch and bound algorithm is used to accelerate the matching speed, then the matched address candidate is scored using the fuzzy strategy. The Chinese geocoding strategy is applied in Hangzhou vector map data and makes some approving results.

Key words: geocoding, address tree, fuzzy matching, branch and bound

摘要： 在研究空间数据地址编码技术的基础上，根据城市地址数据库特定存储格式，选取适于城市中文地址的切分方案，提出一种基于K叉地址树的模糊匹配策略，将地址数据以K叉树形式进行存储。采用分支定界思想探测并排除无效匹配结点，并应用模糊规则对匹配结果进行评价及筛选，从而提高地址匹配的效率和准确度。应用杭州市1∶10 000矢量地图数据验证了该编码系统的有效性。

关键词: 地址编码, 地址树, 模糊匹配, 分支定界

CLC Number: 

• N945