Levenshtein Algorithm For Error-Tolerant Search
Edit Page
Report
Scan day: 02 February 2014 UTC
19
Virus safety - good
Description: Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.
Efficient Implementation of the Levenshtein-Algorithm, Fault-tolerant Search Technology, Error-tolerant Search Technologies The Levenshtein algorithm (also called Edit-Distance) calculates the least number of edit operations that are necessary to modify one string to obtain another string. The most common way of calculating this is by the dynamic programming approach. A matrix is initialized measuring in the (m,n)-cell the Levenshtein distance between the m-character prefix of one with the n-prefix of the other word. The matrix can be filled from the upper left to the lower right corner. Each jump horizontally or vertically corresponds to an insert or a delete, respectively. The cost is normally set to 1 for each of the operations. The diagonal jump can cost either one, if the two characters in the row and column do not match or 0, if they do. Each cell always minimizes the cost locally. This way the number in the lower right corner is the Levenshtein distance between both words. Here is an example that features the comparison of "meilenstein" and "levenshtein":
Size: 1098 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Efficient Implementation of the Levenshtein-Algorithm, Fault-tolerant Search Technology, Error-tolerant Search Technologies |
| Keywords: | levenshtein, algorithmu, online demo, fault-tolerant, search, error tolerant, approximate, fuzzy, soundex, phonetic, string matching, levenstein, lewenstein, levensthein, levensthain |
| Description: | Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online-demos and efficient implementations. |
| IP-address: | 82.165.123.104 |
WHOIS Info
| NS | Name Server: NS55.1UND1.DE Name Server: NS56.1UND1.DE |
| WHOIS | Status: ok |
| Date | Creation Date: 13-jul-2004 Expiration Date: 13-jul-2014 |