Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wardour (0) - 1 freq ardour (1) - 1 freq warriour (2) - 1 freq harbour (2) - 49 freq ordour (2) - 2 freq barbour (2) - 17 freq cawdour (2) - 1 freq armour (2) - 10 freq wardar (2) - 1 freq warder (2) - 3 freq bordour (2) - 1 freq wardrup (2) - 5 freq candour (2) - 1 freq parlour (2) - 17 freq wardrop (3) - 2 freq warrum (3) - 1 freq kildour (3) - 2 freq waeout (3) - 1 freq vapour (3) - 4 freq wurkur (3) - 3 freq waddir (3) - 1 freq warner (3) - 1 freq ordours (3) - 2 freq laubour (3) - 2 freq garitour (3) - 3 freq |
wardour (0) - 1 freq wardar (2) - 1 freq warder (2) - 3 freq ardour (2) - 1 freq wardrup (3) - 5 freq warriour (3) - 1 freq bordour (3) - 1 freq ordour (3) - 2 freq mordor (4) - 3 freq farder (4) - 31 freq yarder (4) - 1 freq wardroom (4) - 1 freq wardrobe (4) - 30 freq warmer (4) - 25 freq wardrob (4) - 1 freq oardir (4) - 1 freq weirder (4) - 1 freq wardly (4) - 1 freq warden (4) - 6 freq oarder (4) - 5 freq warker (4) - 7 freq wadder (4) - 21 freq harder (4) - 67 freq wander (4) - 41 freq larder (4) - 9 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 - WRTR warder - 3 freq wharter - 1 freq wardar - 1 freq wardour - 1 freq weirder - 1 freq |
WARDOUR |
Time to execute Levenshtein function - 0.255248 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.473694 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.030332 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.039617 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.000948 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. |