检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵志靖 江荻[2] ZHAO Zhijing;JIANG Di(Yangzhou University,Yangzhou,Jiangsu 225009,China;Chinese Academy of Social Sciences,Beijing 100081,China)
机构地区:[1]扬州大学,江苏扬州225009 [2]中国社会科学院,北京100081
出 处:《计算机工程与应用》2018年第19期62-67,共6页Computer Engineering and Applications
基 金:教育部人文社会科学研究青年基金(No.15YJC740141);江苏高校哲学社会科学研究项目(No.2015SJB783)
摘 要:编辑距离是一种距离测量法,源于将一个字符串变换为另一个字符串所需要的编辑操作数,该方法能够自动将语言进行分类,最近这些年在西方很受关注,被证明测量语言或方言间距离是有效的。运用编辑距离算法对侗台语族语言做出计量分类以及亲缘关系程度的描述。结果表明编辑距离分类结果与历史语言学的分类结果是基本一致的,为计量法提供了新思路。编辑距离可以应用于东亚语言的研究中。The levenshtein distance is a distance metric derived from the number of edit operations needed to transform one string into another.This metric has received recent attention in Western countries as a means of automatically classifying languages into genealogical subgroups,and has been proved to be effective in the measurement of the distances between languages or dialects.This paper applies the algorithm of the levenshtein distance to the computational classification of the Dong-Tai language family languages,and their genetic relationship is described.The calculation results show that the language classification of the levenshtein distance is consistent with that of the historical linguistics,and a new way is proposed for the computational method.The levenshtein distance can be applied to the research of the East Asian languages.
分 类 号:H087[语言文字—语言学] TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.24.197