| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tfel (0) - 1 freq fel (1) - 2 freq twel (1) - 1 freq tel (1) - 47 freq tael (1) - 6 freq taew (2) - 1 freq tfqw (2) - 1 freq tyfbl (2) - 1 freq fen (2) - 47 freq til (2) - 1710 freq te (2) - 1569 freq thes (2) - 12 freq fll (2) - 1 freq fell (2) - 709 freq tlee (2) - 2 freq gel (2) - 13 freq taul (2) - 11 freq theo (2) - 1 freq lael (2) - 6 freq fek (2) - 13 freq afer (2) - 1 freq nael (2) - 2 freq twal (2) - 120 freq tels (2) - 4 freq tul (2) - 1 freq |
tfel (0) - 1 freq tael (2) - 6 freq tel (2) - 47 freq fel (2) - 2 freq twel (2) - 1 freq tuil (3) - 3 freq toul (3) - 161 freq tfar (3) - 1 freq tql (3) - 1 freq itsel (3) - 466 freq fele (3) - 3 freq teil (3) - 4 freq feul (3) - 1 freq tll (3) - 10 freq fuel (3) - 44 freq tl (3) - 8 freq afyl (3) - 1 freq tal (3) - 6 freq efl (3) - 2 freq nfl (3) - 2 freq taal (3) - 7 freq tail (3) - 263 freq fiel (3) - 31 freq tele (3) - 28 freq otel (3) - 1 freq |
SoundEx code - T140 table - 674 freq tipple - 3 freq twa-fal - 1 freq twa-faul - 1 freq tebel - 1 freq taible - 2 freq topple - 1 freq tibble - 18 freq tivoli - 5 freq teeble - 6 freq taibil - 3 freq taeble - 3 freq t'boyl - 1 freq the-ablow - 2 freq tap'll - 1 freq tfel - 1 freq tyfbl - 1 freq table' - 1 freq tvl - 1 freq tbl - 1 freq |
MetaPhone code - TFL devaul - 9 freq devil - 33 freq duffle - 2 freq divvil - 3 freq devaill - 1 freq divvle - 1 freq divil - 17 freq deevil - 17 freq defily - 1 freq divvel - 4 freq tivoli - 5 freq devaall - 1 freq develue - 1 freq deval - 4 freq devaal - 5 freq duffel - 2 freq tfel - 1 freq divil' - 1 freq tvl - 1 freq dvla - 1 freq |
TFEL |
| Time to execute Levenshtein function - 0.489726 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.810176 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.029253 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.071779 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.000791 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. |