| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tellem (0) - 1 freq telle (1) - 7 freq tellen (1) - 3 freq telled (1) - 2 freq teller (1) - 2 freq 'elle (2) - 1 freq vellum (2) - 2 freq welled (2) - 1 freq taller (2) - 24 freq fellen (2) - 1 freq helle (2) - 6 freq tellys (2) - 2 freq telfer (2) - 2 freq belle' (2) - 1 freq tolled (2) - 1 freq helley (2) - 1 freq heller (2) - 3 freq telt'm (2) - 2 freq wellen (2) - 1 freq telleen (2) - 1 freq feller (2) - 1 freq tellt (2) - 508 freq taelem (2) - 1 freq tele (2) - 32 freq seller (2) - 11 freq |
tellem (0) - 1 freq telle (2) - 7 freq telled (2) - 2 freq teller (2) - 2 freq tellen (2) - 3 freq tellin (3) - 611 freq tiller (3) - 12 freq tell (3) - 2520 freq tilley (3) - 2 freq taelem (3) - 1 freq bellum (3) - 3 freq tellie (3) - 13 freq tellt (3) - 508 freq tell' (3) - 1 freq willem (3) - 1 freq tellan (3) - 13 freq telly (3) - 179 freq tilled (3) - 3 freq tellies (3) - 5 freq tells (3) - 266 freq tolled (3) - 1 freq tellys (3) - 2 freq vellum (3) - 2 freq taller (3) - 24 freq telleen (3) - 1 freq |
SoundEx code - T450 tellin - 611 freq tholin - 34 freq toilin - 2 freq toilan - 1 freq tillin - 3 freq tellen - 3 freq tellin' - 6 freq thalm - 1 freq tail-en - 2 freq tail-an - 1 freq taelem - 1 freq tellan - 13 freq telleen - 1 freq til'm - 2 freq tweelin - 2 freq tholein - 2 freq toulon - 1 freq talamh - 1 freq tailen - 1 freq tulyiein - 1 freq tailin - 1 freq telllin - 1 freq tuilyein - 1 freq €˜taliani - 1 freq toolin - 1 freq towellin - 1 freq ‘tholianÂ’ - 1 freq tellem - 1 freq tail-eyne - 1 freq tellinÂ’ - 1 freq |
MetaPhone code - TLM dileema - 1 freq dilemma - 10 freq taelem - 1 freq til'm - 2 freq talamh - 1 freq tellem - 1 freq |
TELLEM |
| Time to execute Levenshtein function - 0.711414 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 - 1.284653 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.085772 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.039153 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.000912 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. |