| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xxxmissy (0) - 1 freq missy (3) - 3 freq €œmiss (4) - 4 freq mussy (4) - 3 freq dismisst (4) - 2 freq 'miss (4) - 21 freq weehissy (4) - 1 freq chrissy (4) - 9 freq mossy (4) - 10 freq promisst (4) - 4 freq missa (4) - 1 freq missty (4) - 1 freq sissy (4) - 3 freq excuiss (4) - 3 freq amiss (4) - 16 freq gxdtixsy (4) - 1 freq bissy (4) - 4 freq prissy (4) - 1 freq issy (4) - 1 freq buissy (4) - 1 freq glaissy (4) - 1 freq dismiss (4) - 4 freq 'miss' (4) - 4 freq hissy (4) - 3 freq miss' (4) - 2 freq |
xxxmissy (0) - 1 freq missy (6) - 3 freq missa (7) - 1 freq examins (7) - 3 freq excuiss (7) - 3 freq amiss (7) - 16 freq mossy (7) - 10 freq miss (7) - 942 freq messy (7) - 11 freq mussy (7) - 3 freq €œmiss (7) - 4 freq a-miss (7) - 1 freq 'miss (7) - 21 freq dismiss (7) - 4 freq misuse (8) - 1 freq xxxk (8) - 1 freq xmas (8) - 48 freq wemyss (8) - 3 freq mess (8) - 96 freq ramasse (8) - 2 freq mss (8) - 2 freq xmds (8) - 1 freq demoss (8) - 1 freq 'mass (8) - 1 freq xxix (8) - 1 freq |
SoundEx code - X520 xiang - 4 freq xmas - 48 freq xxmwj - 1 freq xmos - 1 freq xnax - 1 freq xomwag - 1 freq xxxmissy - 1 freq xnx - 1 freq xmmx - 1 freq |
MetaPhone code - SMS siem's - 1 freq seems - 517 freq seams - 6 freq smaas - 1 freq sums - 43 freq same's - 4 freq symes - 2 freq syme's - 1 freq seamus - 3 freq zombies - 6 freq seamaws - 2 freq seem's - 3 freq sea-maws - 4 freq sammie's - 1 freq sammy's - 4 freq seemes - 1 freq sooms - 3 freq sam's - 2 freq zumbas - 1 freq soums - 3 freq semi's - 1 freq semes - 2 freq smoosie - 2 freq sea-maws' - 1 freq siems - 2 freq sum's - 1 freq some's - 1 freq seumas - 17 freq cims - 1 freq 'syme's - 1 freq sie-mews - 1 freq smaws - 1 freq xmas - 48 freq sommies - 3 freq saems - 1 freq xmos - 1 freq semis - 4 freq sambies - 1 freq xxxmissy - 1 freq sma's - 1 freq |
XXXMISSY |
| Time to execute Levenshtein function - 0.175274 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.361728 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.034606 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.038353 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.000841 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. |