| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wharter (0) - 1 freq charter (1) - 18 freq whareer (1) - 1 freq shalter (2) - 4 freq shorter (2) - 24 freq chatter (2) - 11 freq walter (2) - 56 freq sharger (2) - 1 freq sharper (2) - 1 freq harder (2) - 67 freq hatter (2) - 279 freq harte (2) - 1 freq hater (2) - 2 freq whanted (2) - 4 freq whiter (2) - 2 freq warmer (2) - 25 freq horter (2) - 1 freq wheeter (2) - 1 freq waiter (2) - 34 freq shanter (2) - 18 freq whatten (2) - 1 freq shatter (2) - 1 freq chapter (2) - 204 freq whar'r (2) - 1 freq whaever (2) - 12 freq |
wharter (0) - 1 freq charter (2) - 18 freq whareer (2) - 1 freq whaur'er (3) - 1 freq wheeter (3) - 1 freq thorter (3) - 2 freq horter (3) - 1 freq whar'r (3) - 1 freq whatr (3) - 1 freq whiter (3) - 2 freq whautr (3) - 1 freq whateer (3) - 2 freq chairter (3) - 70 freq whare'er (3) - 1 freq whariver (3) - 1 freq shorter (3) - 24 freq shoarter (3) - 1 freq barter (4) - 3 freq whacker (4) - 1 freq whaurever (4) - 19 freq charger (4) - 7 freq charmer (4) - 3 freq writer (4) - 65 freq warner (4) - 1 freq halter (4) - 5 freq |
SoundEx code - W636 wardrobe - 29 freq weirderer - 2 freq writers - 90 freq writer - 65 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 |
WHARTER |
| Time to execute Levenshtein function - 0.292330 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.500076 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.035729 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.041979 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.000877 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. |