| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lacerated (0) - 1 freq liberated (2) - 3 freq laceratit (2) - 1 freq laceratin (2) - 1 freq berated (3) - 1 freq curated (3) - 1 freq laerned (3) - 9 freq decorated (3) - 13 freq tolerated (3) - 5 freq lamented (3) - 2 freq liberate (3) - 3 freq laminated (3) - 5 freq layered (3) - 3 freq castrated (3) - 1 freq operated (3) - 5 freq alerted (3) - 2 freq federated (3) - 1 freq aerate (3) - 1 freq generated (3) - 2 freq located (3) - 5 freq saturated (3) - 1 freq literate (3) - 9 freq moderated (3) - 1 freq decoratet (4) - 2 freq cairted (4) - 5 freq |
lacerated (0) - 1 freq laceratin (3) - 1 freq laceratit (3) - 1 freq liberated (3) - 3 freq alerted (4) - 2 freq decorated (4) - 13 freq curated (4) - 1 freq located (4) - 5 freq cairted (5) - 5 freq moderated (5) - 1 freq lachatdee (5) - 1 freq saturated (5) - 1 freq carted (5) - 2 freq scarted (5) - 1 freq generated (5) - 2 freq lichted (5) - 14 freq secreted (5) - 1 freq escorted (5) - 1 freq literate (5) - 9 freq lamented (5) - 2 freq tolerated (5) - 5 freq laminated (5) - 5 freq liberate (5) - 3 freq layered (5) - 3 freq created (5) - 27 freq |
SoundEx code - L263 lizard - 32 freq lizard's - 7 freq lucrative - 2 freq lacquert - 1 freq laceratin - 1 freq lizards - 4 freq lazaretto - 1 freq lacerated - 1 freq leisured - 1 freq lug-rattlin - 1 freq lockhart - 4 freq lockhart's - 1 freq laceratit - 1 freq laggered - 2 freq logarithms - 1 freq lgarden - 1 freq luxuriatin - 1 freq lozart - 1 freq |
MetaPhone code - LSRTT lacerated - 1 freq laceratit - 1 freq |
LACERATED |
| Time to execute Levenshtein function - 0.974687 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 1.497667 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029382 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.101622 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001191 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |