Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wmxev (0) - 1 freq waxed (2) - 3 freq wme (2) - 1 freq waxes (2) - 1 freq wxen (2) - 1 freq weev (2) - 3 freq omxe (2) - 1 freq mgv (3) - 1 freq 'haev (3) - 4 freq mixes (3) - 4 freq mem (3) - 3 freq wave (3) - 132 freq whet (3) - 13 freq yeev (3) - 4 freq 'maet (3) - 1 freq rmqsv (3) - 1 freq wyed (3) - 2 freq daev (3) - 10 freq eev (3) - 5 freq wrxag (3) - 1 freq wames (3) - 6 freq smaer (3) - 3 freq ween (3) - 25 freq wyse (3) - 8 freq wheep (3) - 8 freq |
wmxev (0) - 1 freq weev (4) - 3 freq wxen (4) - 1 freq omxe (4) - 1 freq waxed (4) - 3 freq wme (4) - 1 freq waxes (4) - 1 freq wv (5) - 3 freq wm- (5) - 1 freq maiv (5) - 1 freq xxv (5) - 2 freq xmsv (5) - 1 freq mve (5) - 1 freq xxxv (5) - 1 freq meuv (5) - 4 freq wx (5) - 4 freq wimmen (5) - 39 freq wxis (5) - 1 freq msxv (5) - 1 freq wavey (5) - 1 freq weve (5) - 2 freq mov (5) - 3 freq wmt (5) - 1 freq xv (5) - 6 freq maxed (5) - 2 freq |
SoundEx code - W521 wanshappan - 1 freq wingsoverscotland - 2 freq wing-beat - 1 freq wing-span - 1 freq win-swept - 1 freq wankjob - 1 freq wingback - 2 freq wemqb - 1 freq wmxev - 1 freq whncponwys - 1 freq wnwjzqf - 1 freq weanspeak - 1 freq |
MetaPhone code - MKSF hmmkzv - 1 freq mmhxf - 1 freq wmxev - 1 freq |
WMXEV |
Time to execute Levenshtein function - 0.201130 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.332475 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.027942 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.036911 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.000874 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. |