| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| warderin (0) - 1 freq wanderin (1) - 36 freq oarderin (1) - 3 freq warderin' (1) - 1 freq wunderin (2) - 7 freq wardin (2) - 1 freq danderin (2) - 6 freq forderin (2) - 191 freq murderin (2) - 14 freq wandern (2) - 1 freq barberin (2) - 1 freq 'wanderin (2) - 1 freq borderin (2) - 2 freq waanderin (2) - 3 freq wandrin (2) - 1 freq orderin (2) - 10 freq widderin (2) - 1 freq waverin (2) - 1 freq hardenin (2) - 2 freq wonderin (2) - 52 freq warrin (2) - 1 freq barterin (2) - 1 freq wandering (2) - 3 freq gadderin (2) - 14 freq watterin (2) - 12 freq |
warderin (0) - 1 freq oarderin (2) - 3 freq warderin' (2) - 1 freq wanderin (2) - 36 freq wonderin (3) - 52 freq widderin (3) - 1 freq orderin (3) - 10 freq warrin (3) - 1 freq winderin (3) - 17 freq wanderan (3) - 2 freq wandrin (3) - 1 freq warden (3) - 6 freq ardern (3) - 1 freq warder (3) - 3 freq murderin (3) - 14 freq forderin (3) - 191 freq wunderin (3) - 7 freq waanderin (3) - 3 freq wandern (3) - 1 freq wardin (3) - 1 freq borderin (3) - 2 freq warran (4) - 4 freq waandrin (4) - 1 freq wairdin (4) - 1 freq wirdin (4) - 2 freq |
SoundEx code - W636 wardrobe - 30 freq weirderer - 2 freq writers - 92 freq writer - 71 freq wird-huird - 3 freq warder - 3 freq writers' - 2 freq writer's - 10 freq writer-in-residence - 1 freq wardrop - 2 freq waardrobe - 3 freq waardrobes - 2 freq wardrobe's - 1 freq wrytars - 1 freq wardrobes - 1 freq wordrifeness - 1 freq wardrob - 1 freq warderin' - 1 freq warderin - 1 freq wharter - 1 freq wire-trap - 1 freq worttrochs - 1 freq wardar - 1 freq wardour - 1 freq wird-order - 3 freq wardrup - 5 freq wardrups - 1 freq ward-hoard - 1 freq wardroom - 1 freq wrather - 1 freq writerer - 3 freq weirder - 1 freq writersurreal - 1 freq |
MetaPhone code - WRTRN warderin' - 1 freq warderin - 1 freq |
WARDERIN |
| Time to execute Levenshtein function - 0.212029 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.392560 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.027584 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.038843 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.000873 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. |