| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xnx (0) - 1 freq xx (1) - 79 freq xzx (1) - 1 freq xix (1) - 1 freq xox (1) - 2 freq xni (1) - 1 freq xxx (1) - 486 freq xsx (1) - 1 freq xnw (1) - 1 freq xnax (1) - 1 freq nx (1) - 3 freq xn (1) - 3 freq xno (1) - 1 freq txnx (1) - 1 freq snx (1) - 1 freq pnx (1) - 1 freq ‘nd (2) - 1 freq sx (2) - 2 freq ›nt (2) - 2 freq an- (2) - 1 freq bmx (2) - 1 freq knox (2) - 34 freq dux (2) - 3 freq ejx (2) - 1 freq nu (2) - 10 freq |
xnx (0) - 1 freq xnax (1) - 1 freq xn (2) - 3 freq nx (2) - 3 freq xno (2) - 1 freq txnx (2) - 1 freq xx (2) - 79 freq snx (2) - 1 freq pnx (2) - 1 freq xzx (2) - 1 freq xnw (2) - 1 freq xix (2) - 1 freq xox (2) - 2 freq xsx (2) - 1 freq xni (2) - 1 freq xxx (2) - 486 freq nxu (3) - 1 freq nox (3) - 1 freq xwix (3) - 1 freq xbox (3) - 2 freq xobx (3) - 1 freq xyn (3) - 1 freq manx (3) - 2 freq anxi (3) - 4 freq nix (3) - 7 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 |
XNX |
| Time to execute Levenshtein function - 0.176949 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.331454 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.030079 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.037603 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.000843 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. |