| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xsoj (0) - 1 freq xsy (2) - 1 freq xzo (2) - 1 freq sot (2) - 6 freq sop (2) - 4 freq usj (2) - 1 freq gsoh (2) - 2 freq sou (2) - 6 freq som (2) - 2 freq stj (2) - 1 freq xuaj (2) - 1 freq so' (2) - 2 freq xsyi (2) - 1 freq soe (2) - 1 freq 'so (2) - 48 freq ahoj (2) - 2 freq sox (2) - 1 freq mroj (2) - 1 freq kso (2) - 2 freq sob (2) - 7 freq son (2) - 532 freq oj (2) - 2 freq csvj (2) - 1 freq xox (2) - 2 freq xs (2) - 2 freq |
xsoj (0) - 1 freq xokoj (3) - 1 freq xsx (3) - 1 freq xs (3) - 2 freq xsl (3) - 1 freq exoj (3) - 1 freq xgj (3) - 1 freq xst (3) - 1 freq xsyi (3) - 1 freq sj (3) - 2 freq sij (3) - 2 freq xsy (3) - 1 freq xuaj (3) - 1 freq usj (3) - 1 freq moj (4) - 2 freq sot (4) - 6 freq so' (4) - 2 freq eso (4) - 1 freq xzo (4) - 1 freq so (4) - 4382 freq xmos (4) - 1 freq sod (4) - 22 freq xol (4) - 1 freq soy (4) - 2 freq tooj (4) - 1 freq |
SoundEx code - X200 xix - 1 freq xxix - 1 freq xox - 2 freq xhoc - 1 freq xuxq - 1 freq xhz - 1 freq xsoj - 1 freq xwgo - 1 freq xoiwz - 1 freq xehws - 1 freq xwix - 1 freq xejay - 1 freq xywuj - 1 freq xiq - 1 freq xuc - 1 freq xuaj - 1 freq xhs - 1 freq xhg - 1 freq |
MetaPhone code - SSJ sausage - 45 freq sassage - 5 freq saasage - 8 freq sassidge - 6 freq soasij - 2 freq xsoj - 1 freq sasuge - 1 freq sausage' - 1 freq sossidge - 1 freq |
XSOJ |
| Time to execute Levenshtein function - 0.233702 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.361118 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.031605 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.038617 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.000952 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. |