搜索结果: 1-2 共查到“计算语言学 identify”相关记录2条 . 查询时间(0.071 秒)
Levenshtein Distances Fail to Identify Language Relationships Accurately
Levenshtein Distances Fail Identify Language
font style='font-size:12px;'>
2015/9/9
The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string into another. This metric has received recent attention as a means of aut...
Generating Referring Expressions: Making Referents Easy to Identify
Referents Referring Expressions
font style='font-size:12px;'>
2015/9/2
It is often desirable that referring expressions be chosen in such a way that their referents are easy
to identify. This article focuses on referring expressions in hierarchically structured domains,...