| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xwe (0) - 1 freq ewe (1) - 3 freq 'we (1) - 111 freq fwe (1) - 1 freq awe (1) - 396 freq xje (1) - 1 freq owe (1) - 24 freq xwu (1) - 1 freq lwe (1) - 1 freq we (1) - 10235 freq xre (1) - 1 freq xe (1) - 4 freq xw (1) - 4 freq dw (2) - 4 freq pve (2) - 4 freq eze (2) - 1 freq toe (2) - 21 freq gye (2) - 194 freq lwf (2) - 1 freq wb (2) - 4 freq dhe (2) - 2 freq mye (2) - 6 freq xwpa (2) - 1 freq iye (2) - 10 freq ewes (2) - 6 freq |
xwe (0) - 1 freq xwu (1) - 1 freq xw (1) - 4 freq lwe (2) - 1 freq we (2) - 10235 freq xre (2) - 1 freq xe (2) - 4 freq ewe (2) - 3 freq owe (2) - 24 freq fwe (2) - 1 freq 'we (2) - 111 freq xje (2) - 1 freq awe (2) - 396 freq xnw (3) - 1 freq x (3) - 544 freq nw (3) - 3 freq 'wi (3) - 8 freq xk (3) - 1 freq cw (3) - 6 freq wa (3) - 145 freq wey (3) - 2461 freq axae (3) - 1 freq gwee (3) - 1 freq howe (3) - 77 freq lowe (3) - 110 freq |
SoundEx code - X000 x - 544 freq xi - 13 freq xii - 10 freq xiu - 1 freq xiii - 3 freq xx - 79 freq xxi - 1 freq xxii - 1 freq xxiii - 1 freq 'x - 2 freq xxxxx - 1 freq xx' - 1 freq xxx - 486 freq xxxx - 3 freq x' - 1 freq xja - 1 freq xsyi - 1 freq xz - 4 freq xs - 2 freq xsx - 1 freq xh - 6 freq xe - 4 freq xzc - 1 freq xsqzw - 1 freq xo - 10 freq xu - 3 freq xwu - 1 freq xsy - 1 freq xkg - 1 freq xci - 1 freq xji - 1 freq xc - 2 freq xw - 4 freq xgj - 1 freq xxz - 1 freq xzo - 1 freq xzx - 1 freq xwe - 1 freq xcssa - 1 freq xk - 1 freq xua - 2 freq xgkz - 1 freq xohw - 1 freq xju - 1 freq xa - 3 freq xje - 1 freq xxxk - 1 freq xya - 1 freq xy - 1 freq xq - 2 freq xyyu - 1 freq xjuiu - 1 freq xqu - 2 freq xxhw - 1 freq xihy - 1 freq xxg - 1 freq xxx - 1 freq |
MetaPhone code - SW swey - 10 freq swaw - 12 freq sowie - 1 freq swee - 11 freq sway - 10 freq say-awa - 5 freq swa - 2 freq swaa - 2 freq xwu - 1 freq xwe - 1 freq sawe - 1 freq |
XWE |
| Time to execute Levenshtein function - 0.193908 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.333584 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.030968 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.038974 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.000789 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. |