| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| toiletries (0) - 1 freq toilets (3) - 32 freq miseries (4) - 2 freq victries (4) - 1 freq toasties (4) - 5 freq totties (4) - 8 freq witries (4) - 2 freq pieties (4) - 1 freq solitrie (4) - 1 freq theories (4) - 3 freq kintries (4) - 4 freq toilet (4) - 93 freq tomaties (4) - 1 freq taupestries (4) - 1 freq tootsies (4) - 2 freq toilet-roll (4) - 1 freq tetris (4) - 1 freq fineries (4) - 1 freq lilties (4) - 2 freq toushties (4) - 1 freq tillies (4) - 1 freq top-stories (4) - 1 freq boortries (4) - 1 freq societies (4) - 14 freq twinties (4) - 3 freq |
toiletries (0) - 1 freq toilets (4) - 32 freq tetris (5) - 1 freq tapestries (6) - 1 freq nit-tries (6) - 1 freq polaties (6) - 1 freq litres (6) - 3 freq liveries (6) - 1 freq teries (6) - 1 freq leeries (6) - 6 freq tiberius (6) - 1 freq toijets (6) - 1 freq tories (6) - 117 freq leilties (6) - 1 freq kilties (6) - 3 freq intries (6) - 1 freq adulteries (6) - 1 freq countries (6) - 36 freq abilities (6) - 6 freq tellures (6) - 1 freq tailors (6) - 7 freq toolter (6) - 1 freq torters (6) - 1 freq tellers (6) - 5 freq theatres (6) - 5 freq |
SoundEx code - T436 toilet-roll - 1 freq tiltered - 1 freq tillydrone - 2 freq tail-tree - 1 freq tildarg - 1 freq toiletries - 1 freq theliteracytree - 1 freq toolter - 1 freq |
MetaPhone code - TLTRS toiletries - 1 freq dolders - 1 freq |
TOILETRIES |
| Time to execute Levenshtein function - 0.401788 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.635219 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.027744 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.073571 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.000883 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. |