| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tellures (0) - 1 freq tellaris (2) - 1 freq tellies (2) - 5 freq textures (2) - 2 freq tellers (2) - 5 freq tenures (2) - 1 freq measures (3) - 16 freq ensures (3) - 3 freq dentures (3) - 6 freq velues (3) - 6 freq bellises (3) - 1 freq yellaes (3) - 2 freq endures (3) - 3 freq galluses (3) - 10 freq treysures (3) - 4 freq feegures (3) - 1 freq textured (3) - 2 freq eludes (3) - 1 freq tillies (3) - 1 freq belles (3) - 1 freq treasures (3) - 4 freq allure (3) - 2 freq lectures (3) - 8 freq tells (3) - 266 freq meesures (3) - 1 freq |
tellures (0) - 1 freq tellers (2) - 5 freq tellaris (2) - 1 freq tellies (3) - 5 freq sellers (4) - 2 freq teylers (4) - 1 freq telly's (4) - 1 freq tells (4) - 266 freq tallies (4) - 1 freq cellars (4) - 1 freq tellins (4) - 5 freq tullus (4) - 2 freq tellys (4) - 2 freq tillies (4) - 1 freq teller (4) - 2 freq sellars (4) - 1 freq tell's (4) - 7 freq tenures (4) - 1 freq textures (4) - 2 freq tilfers (5) - 1 freq jellus (5) - 1 freq tallis (5) - 1 freq galleries (5) - 8 freq tully's (5) - 2 freq tull's (5) - 1 freq |
SoundEx code - T462 tellers - 5 freq tellaris - 1 freq tellures - 1 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq twaloors - 2 freq tylers - 1 freq tailrace - 1 freq tlrgsz - 1 freq tlrcsa - 1 freq |
MetaPhone code - TLRS tellers - 5 freq deleerious - 1 freq tellaris - 1 freq dollars - 7 freq dailers - 2 freq tellures - 1 freq dealers - 10 freq delirious - 3 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq dollars- - 1 freq tylers - 1 freq tailrace - 1 freq |
TELLURES |
| Time to execute Levenshtein function - 0.230691 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.415109 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.035925 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.039059 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.000886 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. |