It would be the same for other applications. We need to find the minimum edit distances for typed word, and that would be words that we can recommend to a user of our spell checking system. Then we need to calculate the edit distance of typed word and similar word (if same form does not exist). We need to have a corpus of words of a particular language with most of the forms, or a mechanism that knows how to create all the forms of a word. What we need to calculate is the minimum edit distance for that language. When it comes to creating a spell checker, we need a bit more than just the edit distance between 2 words or 2 strings. The Levenshtein distance between two strings is no greater than the sum of their Levenshtein distances from a third string (triangle inequality).If the strings are the same size, the Hamming distance is an upper bound on the Levenshtein distance.
0 Comments
Leave a Reply. |