| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wardrop (0) - 2 freq wardrup (1) - 5 freq wardrob (1) - 1 freq wardrups (2) - 1 freq pandrop (2) - 5 freq wardrobe (2) - 30 freq teardrop (2) - 1 freq wardroom (2) - 1 freq wardrobes (3) - 1 freq wandrin (3) - 1 freq wadno (3) - 3 freq waallop (3) - 1 freq warren (3) - 35 freq ward's (3) - 2 freq andro (3) - 4 freq laudrup (3) - 2 freq narmrzp (3) - 1 freq bardo (3) - 1 freq 'andro (3) - 1 freq marros (3) - 1 freq wallop (3) - 11 freq warddec (3) - 1 freq carnroe (3) - 2 freq waitros (3) - 1 freq wardin (3) - 1 freq |
wardrop (0) - 2 freq wardrup (1) - 5 freq wardrob (2) - 1 freq wardroom (3) - 1 freq teardrop (3) - 1 freq wardrobe (3) - 30 freq wardrups (3) - 1 freq wardar (4) - 1 freq warderin (4) - 1 freq waardrobe (4) - 3 freq wrdgp (4) - 1 freq wardour (4) - 1 freq warder (4) - 3 freq pandrop (4) - 5 freq worktop (5) - 2 freq wandred (5) - 1 freq warran (5) - 4 freq wardlaw (5) - 2 freq warrin (5) - 1 freq wardly (5) - 1 freq warktap (5) - 1 freq warrior (5) - 27 freq drop (5) - 39 freq wards (5) - 30 freq €œdrop (5) - 1 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 - WRTRP wardrop - 2 freq wire-trap - 1 freq wardrup - 5 freq |
WARDROP |
| Time to execute Levenshtein function - 0.270690 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.369271 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.027675 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.045977 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.000900 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. |