| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tothelake (0) - 1 freq theluke (3) - 1 freq moth-like (3) - 1 freq oottake (4) - 1 freq cosh-lyke (4) - 1 freq othello (4) - 1 freq doucelyke (4) - 1 freq tolerate (4) - 7 freq timpeake (4) - 2 freq worthelie (4) - 1 freq och-like (4) - 1 freq taemake (4) - 1 freq tothe (4) - 2 freq doucelike (4) - 2 freq blythelike (4) - 1 freq totalee (4) - 1 freq somelike (4) - 2 freq tottle (4) - 1 freq rothesay (4) - 4 freq cornflake (4) - 2 freq tother (4) - 1 freq pothole (4) - 5 freq thake (4) - 1 freq intheface (4) - 17 freq pothecar (4) - 2 freq |
tothelake (0) - 1 freq theluke (4) - 1 freq moth-like (5) - 1 freq totalee (6) - 1 freq totallie (6) - 1 freq tottle (6) - 1 freq blythelike (6) - 1 freq tother (6) - 1 freq thake (6) - 1 freq pothole (6) - 5 freq deathlike (6) - 1 freq tothe (6) - 2 freq catholik (6) - 1 freq othello (6) - 1 freq oottake (6) - 1 freq athelin (7) - 1 freq thak (7) - 1 freq total (7) - 98 freq tohull (7) - 1 freq tthey (7) - 1 freq quatelike (7) - 3 freq ethlie (7) - 1 freq theenk (7) - 2 freq earth-like (7) - 1 freq tethert (7) - 3 freq |
SoundEx code - T342 toddles - 1 freq tytal's - 1 freq thoattless - 1 freq titles - 13 freq tautological - 2 freq title's - 1 freq toothless - 3 freq tod-tails - 1 freq teitils - 2 freq teetles - 1 freq towtie-lik - 1 freq tea-towels - 2 freq tiddles - 8 freq €œtiddles - 1 freq tuithless - 2 freq tattoo-like - 1 freq tattles - 3 freq thetalk - 1 freq tothelake - 1 freq tweetolectology - 4 freq thatlassie - 1 freq |
MetaPhone code - T0LK deathlike - 1 freq tothelake - 1 freq |
TOTHELAKE |
| Time to execute Levenshtein function - 0.238663 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.393946 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.037210 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.049525 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.001253 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. |