An improved Levenshtein algorithm for spelling correction word candidate list generation
Candidates’ list generation in spelling correction is a process of finding words from a lexicon that should be close to the incorrect word. The most widely used algorithm for generating candidates’ list for incorrect words is based on Levenshtein distance. However, this algorithm takes too much time...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English English |
| 出版: |
2016
|
| 主题: | |
| 在线阅读: | http://etd.uum.edu.my/6564/ http://etd.uum.edu.my/6564/1/s814922_01.pdf http://etd.uum.edu.my/6564/2/s814922_02.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|