| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withouten (0) - 2 freq withooten (1) - 2 freq wi-outen (2) - 1 freq athouten (2) - 2 freq without (2) - 100 freq wiouten (2) - 5 freq shouten (3) - 2 freq withen (3) - 5 freq witout (3) - 2 freq withgate (3) - 2 freq wiooten (3) - 2 freq 'without' (3) - 1 freq witten (3) - 1 freq withoot (3) - 413 freq ithout (3) - 11 freq athooten (3) - 1 freq thout (4) - 2 freq nitrogen (4) - 3 freq ritten (4) - 1 freq fitnote (4) - 2 freq shotten (4) - 4 freq inhauden (4) - 2 freq withered (4) - 7 freq withies (4) - 1 freq thote (4) - 4 freq |
withouten (0) - 2 freq withooten (1) - 2 freq without (3) - 100 freq athouten (3) - 2 freq withoot (4) - 413 freq athooten (4) - 1 freq withen (4) - 5 freq wiouten (4) - 5 freq wi-outen (4) - 1 freq witten (4) - 1 freq wittin (5) - 30 freq wetten (5) - 1 freq within (5) - 189 freq fithteen (5) - 2 freq withstaun (5) - 2 freq witherin (5) - 4 freq whiten (5) - 1 freq wheaten (5) - 4 freq 'without' (5) - 1 freq withgate (5) - 2 freq witout (5) - 2 freq shouten (5) - 2 freq ithout (5) - 11 freq wiooten (5) - 2 freq nitten (6) - 5 freq |
SoundEx code - W335 withouten - 2 freq withoot-maybe - 2 freq withooten - 2 freq withhaudin - 1 freq |
MetaPhone code - W0TN withouten - 2 freq withooten - 2 freq withhaudin - 1 freq |
WITHOUTEN |
| Time to execute Levenshtein function - 0.215837 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.403737 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.028166 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.037010 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.000867 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. |