计算机工程 ›› 2011, Vol. 37 ›› Issue (2): 194-196.doi: 10.3969/j.issn.1000-3428.2011.02.067

• 人工智能及识别技术 • 上一篇    下一篇

基于模糊匹配策略的城市中文地址编码系统

吴海涛a,俞 立b,张贵军b   

  1. (浙江工业大学a. 计算机科学与技术学院;b. 信息学院,杭州 310023)
  • 出版日期:2011-01-20 发布日期:2011-01-25
  • 作者简介:吴海涛(1986-),男,硕士,主研方向:GIS,智能交通;俞 立,教授、博士、博士生导师;张贵军,副教授、博士
  • 基金项目:
    国家自然科学基金资助项目(61075062, 50908213);浙江省科技攻关基金资助重点项目(2008C23040);浙江省自然科学基金资助项目(Y1100891);浙江工业大学校基金资助重点项目(200801 75);浙江省新苗人才计划基金资助项目(2010R403008)

Chinese City Geocoding System Based on Fuzzy Matching Strategy

WU Hai-tao a, YU Li b, ZHANG Gui-jun b   

  1. (a. College of Computer Science and Technology; b. College of Information Engineering,Zhejiang University of Technology, Hangzhou 310023, China)
  • Online:2011-01-20 Published:2011-01-25

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

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

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

中图分类号: