| Research on String Similarity Algorithm based on Levenshtein Distance | |
| Zhang, Shengnan*; Hu, Yan; Bian, Guangrong | |
| 2017 | |
| 会议名称 | 2nd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC) |
| 会议日期 | MAR 25-26, 2017 |
| 会议地点 | Chongqing, PEOPLES R CHINA |
| 关键词 | edit distance the longest common subsequence the longest common substring similarity calculation |
| 页码 | 2303-2307 |
| 会议录 | 2017 IEEE 2ND ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC)
 |
| URL标识 | 查看原文 |
| WOS记录号 | WOS:000427137300456 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/3402513 |
| 专题 | 武汉理工大学 |
| 作者单位 | 1.[Hu, Yan 2.Zhang, Shengnan] Wuhan Univ Technol, Sch Comp Sci & Technol, Wuhan, Hubei, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Zhang, Shengnan*,Hu, Yan,Bian, Guangrong. Research on String Similarity Algorithm based on Levenshtein Distance[C]. 见:2nd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). Chongqing, PEOPLES R CHINA. MAR 25-26, 2017. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论