| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teller (0) - 1 freq tellers (1) - 5 freq telled (1) - 2 freq tellem (1) - 1 freq tiller (1) - 12 freq keller (1) - 1 freq seller (1) - 11 freq geller (1) - 1 freq taller (1) - 23 freq telle (1) - 7 freq feller (1) - 1 freq telfer (1) - 2 freq tellen (1) - 3 freq heller (1) - 3 freq stelled (2) - 8 freq ten'er (2) - 1 freq kdeller (2) - 1 freq helle (2) - 6 freq teeger (2) - 187 freq tether (2) - 18 freq voller (2) - 2 freq tell't (2) - 3 freq traller (2) - 1 freq auller (2) - 1 freq fuller (2) - 3 freq |
teller (0) - 1 freq taller (1) - 23 freq tiller (1) - 12 freq feller (2) - 1 freq tellers (2) - 5 freq telfer (2) - 2 freq tellen (2) - 3 freq telle (2) - 7 freq taaller (2) - 1 freq heller (2) - 3 freq tellem (2) - 1 freq telled (2) - 2 freq keller (2) - 1 freq geller (2) - 1 freq seller (2) - 11 freq aller (3) - 1 freq tellies (3) - 5 freq tytler (3) - 1 freq bueller (3) - 1 freq filler (3) - 2 freq holler (3) - 2 freq tyler (3) - 15 freq talker (3) - 3 freq guller (3) - 1 freq puller (3) - 1 freq |
SoundEx code - T460 taller - 23 freq taylor - 17 freq tyler - 15 freq tiller - 12 freq teller - 1 freq taaller - 1 freq taaler - 3 freq twal-hour - 2 freq tailor - 28 freq tylor - 1 freq twal-year - 1 freq tlr - 1 freq |
MetaPhone code - TLR dollar - 12 freq taller - 23 freq dealer - 15 freq taylor - 17 freq tyler - 15 freq dalry - 3 freq tiller - 12 freq teller - 1 freq taaller - 1 freq taaler - 3 freq dillier - 1 freq duller - 2 freq dailer - 1 freq dueler - 1 freq tailor - 28 freq deleer - 1 freq tylor - 1 freq dlir - 1 freq tlr - 1 freq |
TELLER tell - 2490 freq telt - 1538 freq tellt - 505 freq told - 133 freq tolt - 138 freq tellin - 603 freq tells - 257 freq telling - 78 freq retellin - 4 freq foretell - 4 freq tell-tale - 2 freq teller - 1 freq telled - 2 freq tellin' - 5 freq |
| Time to execute Levenshtein function - 0.172332 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.473245 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.027637 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.071904 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.000950 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. |