| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tuneless (0) - 2 freq timeless (2) - 5 freq tentless (2) - 7 freq tumeness (2) - 1 freq treeless (2) - 3 freq 'unless (2) - 4 freq rueless (2) - 1 freq unless (2) - 137 freq luveless (2) - 1 freq useless (2) - 36 freq tireless (2) - 1 freq sunless (2) - 1 freq stateless (3) - 2 freq oonless (3) - 4 freq bundles (3) - 4 freq careless (3) - 10 freq rudeness (3) - 3 freq tunes (3) - 63 freq auncles (3) - 1 freq haunless (3) - 3 freq bunnles (3) - 3 freq tummlers (3) - 1 freq onless (3) - 7 freq kungles (3) - 1 freq fendless (3) - 1 freq |
tuneless (0) - 2 freq unless (3) - 137 freq sunless (3) - 1 freq 'unless (3) - 4 freq teenless (3) - 1 freq tireless (3) - 1 freq tentless (3) - 7 freq timeless (3) - 5 freq treeless (3) - 3 freq topless (4) - 1 freq towless (4) - 1 freq kinless (4) - 1 freq dinless (4) - 1 freq enless (4) - 12 freq winless (4) - 1 freq cenless (4) - 1 freq tapless (4) - 2 freq onless (4) - 7 freq muinless (4) - 4 freq wanless (4) - 3 freq bounless (4) - 1 freq sounless (4) - 2 freq rueless (4) - 1 freq useless (4) - 36 freq luveless (4) - 1 freq |
SoundEx code - T542 tunnels - 11 freq tuneless - 2 freq timeliest - 1 freq timeless - 5 freq tummles - 2 freq taenails - 2 freq taen-like - 3 freq tunnel's - 1 freq then-always - 1 freq teenless - 1 freq toonmils - 1 freq taen-lik - 1 freq tonnels - 1 freq |
MetaPhone code - TNLS tunnels - 11 freq daniel's - 17 freq tuneless - 2 freq daniels - 1 freq taenails - 2 freq tunnel's - 1 freq dinnles - 1 freq dinless - 1 freq teenless - 1 freq tonnels - 1 freq |
TUNELESS |
| Time to execute Levenshtein function - 0.316181 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.488132 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.030191 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.037107 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.000795 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. |