| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| left-ower (0) - 1 freq leftower (1) - 3 freq set-ower (2) - 1 freq leftowers (2) - 3 freq leftover (2) - 1 freq oot-ower (3) - 1 freq leftovers (3) - 3 freq luk-ower (3) - 4 freq sleep-ower (3) - 1 freq out-ower (3) - 1 freq floower (4) - 2 freq left-haun (4) - 9 freq left-han (4) - 2 freq let-be (4) - 1 freq pass-ower (4) - 1 freq €œflower (4) - 2 freq lecturer (4) - 17 freq leftér (4) - 1 freq efter (4) - 3150 freq €žfower (4) - 1 freq fifty-fower (4) - 1 freq bestowe (4) - 1 freq byde-ower (4) - 1 freq 'efter (4) - 5 freq weedower (4) - 2 freq |
left-ower (0) - 1 freq leftower (2) - 3 freq leftover (4) - 1 freq leftowers (4) - 3 freq set-ower (4) - 1 freq out-ower (5) - 1 freq luk-ower (5) - 4 freq oot-ower (5) - 1 freq leftér (6) - 1 freq lafter (6) - 1 freq loftier (6) - 2 freq left-wing (6) - 6 freq fifty-fower (6) - 1 freq left-haun (6) - 9 freq sleep-ower (6) - 1 freq left-han (6) - 2 freq leftovers (6) - 3 freq vyce-ower (7) - 1 freq leftley (7) - 3 freq atower (7) - 1 freq tak-ower (7) - 1 freq leftie (7) - 1 freq come-ower (7) - 1 freq roll-ower (7) - 1 freq win-ower (7) - 1 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 - LFTWR leftower - 3 freq left-ower - 1 freq |
LEFT-OWER |
| Time to execute Levenshtein function - 0.496117 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.930748 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.099985 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.169890 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.001155 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. |