| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tellin-aff (0) - 1 freq tellins (4) - 3 freq weel-aff (4) - 28 freq tirl-aff (4) - 1 freq tellin' (4) - 5 freq rin-aff (4) - 1 freq ill-aff (4) - 6 freq tellingly (4) - 1 freq seal'd-aff (4) - 1 freq tellin (4) - 1 freq bealin-daft (4) - 1 freq telling (4) - 78 freq sealt-aff (4) - 1 freq yin-aff (4) - 1 freq tellin (4) - 603 freq tellies (5) - 5 freq wellington (5) - 9 freq dellin (5) - 5 freq fellin (5) - 3 freq beleiff (5) - 1 freq telltale (5) - 2 freq terminal (5) - 11 freq tap-aff (5) - 1 freq pollinate (5) - 1 freq blairdaff (5) - 1 freq |
tellin-aff (0) - 1 freq ill-aff (6) - 6 freq tirl-aff (6) - 1 freq tellin (7) - 1 freq tellin (7) - 603 freq telling (7) - 78 freq sealt-aff (7) - 1 freq seal'd-aff (7) - 1 freq yin-aff (7) - 1 freq tellins (7) - 3 freq tellingly (7) - 1 freq tellin' (7) - 5 freq weel-aff (7) - 28 freq rin-aff (7) - 1 freq tap-aff (8) - 1 freq talkin-tae (8) - 1 freq tillin (8) - 3 freq leader-aff (8) - 2 freq tellen (8) - 3 freq tell-tale (8) - 2 freq tellan (8) - 13 freq sign-aff (8) - 1 freq staun-aff (8) - 2 freq wan-aff (8) - 1 freq tilling (8) - 1 freq |
SoundEx code - T451 tellin-aff - 1 freq thelonefifer - 1 freq |
MetaPhone code - TLNF tellin-aff - 1 freq |
TELLIN-AFF |
| Time to execute Levenshtein function - 0.214184 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.375485 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.027743 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.038605 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.004269 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. |