| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xmas (0) - 48 freq mas (1) - 7 freq xmos (1) - 1 freq xmds (1) - 1 freq vmas (1) - 1 freq teas (2) - 3 freq xmd (2) - 1 freq xs (2) - 2 freq xjad (2) - 1 freq smaw (2) - 49 freq raas (2) - 10 freq faas (2) - 50 freq 'ma' (2) - 1 freq imps (2) - 3 freq may (2) - 446 freq cas (2) - 4 freq ms (2) - 29 freq jmaj (2) - 1 freq sma' (2) - 13 freq 'sas (2) - 1 freq €˜as (2) - 8 freq bias (2) - 10 freq leas (2) - 14 freq xmsv (2) - 1 freq mps (2) - 31 freq |
xmas (0) - 48 freq xmos (1) - 1 freq vmas (2) - 1 freq xmds (2) - 1 freq mas (2) - 7 freq smaas (3) - 1 freq mos (3) - 9 freq xyam (3) - 1 freq xm (3) - 1 freq pms (3) - 7 freq amys (3) - 1 freq dms (3) - 1 freq mais (3) - 3 freq lamas (3) - 20 freq emus (3) - 1 freq xmur (3) - 1 freq maas (3) - 7 freq umes (3) - 1 freq mams (3) - 5 freq amos (3) - 3 freq mimas (3) - 1 freq mes (3) - 3 freq nms (3) - 2 freq maus (3) - 1 freq exems (3) - 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 - 528 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 smiies - 1 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 |
XMAS |
| Time to execute Levenshtein function - 0.201282 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.374741 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.027425 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.037645 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.000991 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. |