| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leid-kist (0) - 2 freq deid-kist (1) - 3 freq deidkist (2) - 2 freq deid-kists (2) - 1 freq meal-kist (3) - 1 freq wird-kist (3) - 6 freq sie-kist (3) - 2 freq feed-kists (3) - 1 freq heid-first (3) - 2 freq heidmaist (3) - 40 freq hedonist (4) - 1 freq likit (4) - 158 freq luikit (4) - 133 freq heid-yin (4) - 2 freq reid-hot (4) - 1 freq likkit (4) - 2 freq leimitit (4) - 6 freq new-kilt (4) - 1 freq eikit (4) - 65 freq reid-hoat (4) - 1 freq linkit (4) - 16 freq heid-at (4) - 1 freq medalist (4) - 1 freq leirit (4) - 24 freq reikit (4) - 1 freq |
leid-kist (0) - 2 freq deid-kist (2) - 3 freq deid-kists (4) - 1 freq deidkist (4) - 2 freq feed-kists (5) - 1 freq sie-kist (5) - 2 freq wird-kist (5) - 6 freq meal-kist (5) - 1 freq laid-out (6) - 1 freq mid-east (6) - 1 freq laid-oot (6) - 1 freq heid-first (6) - 2 freq coal-kist (6) - 1 freq heidmaist (6) - 40 freq mort-kist (7) - 1 freq heidfirst (7) - 2 freq eildest (7) - 2 freq midmaist (7) - 2 freq reid-het (7) - 5 freq aaldist (7) - 1 freq leist (7) - 3 freq leftist (7) - 1 freq laidit (7) - 9 freq lirkit (7) - 7 freq leids (7) - 466 freq |
SoundEx code - L322 lotuses - 1 freq ludges - 2 freq lettuces - 3 freq latches - 2 freq ledges - 3 freq lidice's - 1 freq leòdhasach - 1 freq leodhasach - 1 freq litigious - 1 freq lodgest - 1 freq leid-kist - 2 freq ltseoyzvp - 1 freq leitchs - 1 freq lithgaes - 1 freq leitches - 1 freq ladygaga - 1 freq |
MetaPhone code - LTKST leid-kist - 2 freq |
LEID-KIST |
| Time to execute Levenshtein function - 0.368148 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 - 0.472150 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.029345 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.037468 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.000913 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. |