| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teflon (0) - 2 freq teuton (2) - 2 freq tenon (2) - 1 freq tealou (2) - 3 freq toulon (2) - 1 freq tellen (2) - 3 freq tellan (2) - 13 freq melon (2) - 6 freq tellin (2) - 611 freq ellon (2) - 19 freq teason (2) - 2 freq eglon (2) - 1 freq ceylon (2) - 4 freq felon (2) - 2 freq elon (2) - 1 freq tellin' (3) - 6 freq tremlin (3) - 2 freq ellot (3) - 1 freq terror (3) - 40 freq stepson (3) - 1 freq tenior (3) - 1 freq tlod (3) - 1 freq gealin (3) - 1 freq neon (3) - 7 freq flown (3) - 15 freq |
teflon (0) - 2 freq tellan (3) - 13 freq tellin (3) - 611 freq toulon (3) - 1 freq tellen (3) - 3 freq felon (3) - 2 freq tiefen (4) - 2 freq tiftan (4) - 1 freq toilin (4) - 2 freq telleen (4) - 1 freq feelen (4) - 5 freq feelan (4) - 18 freq tirlin (4) - 13 freq feilan (4) - 2 freq tholin (4) - 34 freq toolin (4) - 1 freq tiefin (4) - 3 freq toilan (4) - 1 freq tumlin (4) - 1 freq tweelin (4) - 2 freq tailin (4) - 1 freq tinlin (4) - 1 freq flan (4) - 3 freq triflin (4) - 1 freq feelin (4) - 497 freq |
SoundEx code - T145 table-end - 1 freq tipplin - 1 freq toppling - 1 freq thefelonsclub - 1 freq teflon - 2 freq tafelente - 1 freq |
MetaPhone code - TFLN devaalin - 1 freq devellin - 1 freq devalna - 1 freq devlin - 1 freq teflon - 2 freq |
TEFLON |
| Time to execute Levenshtein function - 0.172525 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.361222 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.027342 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.037750 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.000915 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. |