| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xnax (0) - 1 freq xnx (1) - 1 freq xmas (2) - 48 freq cnag (2) - 1 freq anae (2) - 1 freq nag (2) - 6 freq ntx (2) - 1 freq nx (2) - 3 freq 'naw (2) - 166 freq 'na (2) - 58 freq anal (2) - 1 freq ina (2) - 99 freq xzx (2) - 1 freq trax (2) - 10 freq xni (2) - 1 freq rax (2) - 79 freq ax (2) - 76 freq fax (2) - 9 freq knas (2) - 1 freq nah (2) - 86 freq xmmx (2) - 1 freq tax (2) - 60 freq anas (2) - 9 freq xno (2) - 1 freq max (2) - 31 freq |
xnax (0) - 1 freq xnx (1) - 1 freq xno (3) - 1 freq xnw (3) - 1 freq xnair (3) - 1 freq xix (3) - 1 freq xx (3) - 79 freq nox (3) - 1 freq pnx (3) - 1 freq xobx (3) - 1 freq xxx (3) - 486 freq xsx (3) - 1 freq nix (3) - 7 freq xbox (3) - 2 freq xox (3) - 2 freq txnx (3) - 1 freq xn (3) - 3 freq xni (3) - 1 freq knox (3) - 34 freq nx (3) - 3 freq snx (3) - 1 freq xxix (3) - 1 freq nex (3) - 22 freq knoax (3) - 1 freq xzx (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 - SNKS snakes - 32 freq snecks - 7 freq sangs - 256 freq sings - 53 freq snaggies - 1 freq snacks - 4 freq songs - 44 freq sinks - 23 freq zoink's - 2 freq cynics - 3 freq snicks - 1 freq snags - 1 freq snake's - 1 freq sneaks - 3 freq sneck's - 1 freq snugs - 1 freq sunks - 3 freq 'songs - 1 freq snowks - 1 freq snokes - 1 freq €˜snakes - 1 freq song's - 1 freq snigs - 1 freq zonks - 1 freq xnax - 1 freq xnx - 1 freq snx - 1 freq songs' - 1 freq |
XNAX |
| Time to execute Levenshtein function - 0.217377 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.348348 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.027233 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.037582 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.000842 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. |