| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withoot-maybe (0) - 2 freq withooten (6) - 2 freq it-maybae (6) - 1 freq withoot (6) - 413 freq withouten (7) - 2 freq thin-aye (7) - 1 freq whut-wye (7) - 1 freq nicht-late (7) - 1 freq hithertae (7) - 4 freq mither-gab (7) - 1 freq ithoot (7) - 53 freq with-oot (7) - 1 freq toothpaste (7) - 11 freq thoomb (7) - 6 freq without (7) - 100 freq athort-gaein (7) - 1 freq withstand (7) - 2 freq nichtmare (7) - 14 freq dichotomy (7) - 1 freq home-made (7) - 1 freq it-mebbe (7) - 1 freq short-arse (7) - 1 freq thoatsae (7) - 1 freq oot-d'ye (7) - 1 freq withgate (7) - 2 freq |
withoot-maybe (0) - 2 freq withoot (9) - 413 freq it-maybae (9) - 1 freq withooten (9) - 2 freq without (10) - 100 freq wightman (10) - 3 freq within-a (10) - 1 freq with-oot (10) - 1 freq withma (10) - 1 freq thoomb (10) - 6 freq withouten (10) - 2 freq whut-wye (10) - 1 freq mither-gab (10) - 1 freq hecht-aye (11) - 1 freq 'ithoot (11) - 1 freq what-wey (11) - 4 freq whitemaa (11) - 1 freq witoot (11) - 1 freq withstaun (11) - 2 freq root-mak (11) - 1 freq that-ah (11) - 1 freq nightmare (11) - 18 freq whit-like (11) - 1 freq wather-wise (11) - 1 freq test-tube (11) - 1 freq |
SoundEx code - W335 withouten - 2 freq withoot-maybe - 2 freq withooten - 2 freq withhaudin - 1 freq |
MetaPhone code - W0TMB withoot-maybe - 2 freq |
WITHOOT-MAYBE |
| Time to execute Levenshtein function - 0.256874 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.515401 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.037526 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.039441 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.000857 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. |