| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leftér (0) - 1 freq eftér (1) - 16 freq eftèr (2) - 91 freq latér (2) - 1 freq mettér (2) - 5 freq bettér (2) - 4 freq petér (2) - 10 freq lettèr (2) - 1 freq lettérs (2) - 1 freq sistér (3) - 1 freq leftie (3) - 1 freq lether (3) - 2 freq leftover (3) - 1 freq eftir (3) - 500 freq left's (3) - 1 freq eftur (3) - 1 freq leftley (3) - 3 freq efter (3) - 3150 freq letir (3) - 2 freq lettèrs (3) - 7 freq lefty (3) - 2 freq left (3) - 1 freq petèr (3) - 31 freq aefter (3) - 4 freq loftier (3) - 2 freq |
leftér (0) - 1 freq eftér (2) - 16 freq latér (3) - 1 freq lettérs (4) - 1 freq ulstér (4) - 2 freq petér (4) - 10 freq lettèr (4) - 1 freq eftèr (4) - 91 freq mettér (4) - 5 freq bettér (4) - 4 freq plattér (5) - 1 freq wuntér (5) - 1 freq leftower (5) - 3 freq lafter (5) - 1 freq clattér (5) - 1 freq leftover (5) - 1 freq loftier (5) - 2 freq bittér (5) - 1 freq sistér (5) - 1 freq flér (5) - 1 freq wattér (5) - 8 freq petér' (6) - 1 freq left' (6) - 2 freq leathr (6) - 1 freq ulstèr (6) - 13 freq |
SoundEx code - L136 loftier - 2 freq luve-darg - 1 freq lavatry - 1 freq lavateria - 1 freq lavatory - 5 freq lavatories - 1 freq leftér - 1 freq life-threids - 1 freq lavatries - 1 freq leftower - 3 freq liftwards - 1 freq liftward - 1 freq lafter - 1 freq life-draain - 1 freq life-watter - 1 freq leftowers - 3 freq left-ower - 1 freq liftwart - 1 freq |
MetaPhone code - LFTR laughter - 53 freq loftier - 2 freq lighter - 27 freq lavatry - 1 freq lavateria - 1 freq lavatory - 5 freq leftér - 1 freq lafter - 1 freq |
LEFTÉR |
| Time to execute Levenshtein function - 0.189648 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.388510 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.033163 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.038446 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.000865 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. |