Implementation of 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 are close to the incorrect word. The most widely used algorithm to generate the candidate list is the Levenshtein algorithm. However, the algorithm consumes high computational cost, especially when t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/20609/1/JTAIT%2088%203%202016%20449%20455.pdf http://repo.uum.edu.my/20609/ http://www.jatit.org/volumes/Vol88No3/10Vol88No3.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|