| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xgj (0) - 1 freq agj (1) - 1 freq gj (1) - 5 freq xgm (1) - 1 freq xhg (2) - 1 freq xzn (2) - 1 freq gx (2) - 4 freq qmj (2) - 1 freq thj (2) - 1 freq rgm (2) - 1 freq rg (2) - 4 freq egg (2) - 95 freq mgk (2) - 1 freq xxv (2) - 2 freq cxg (2) - 1 freq tj (2) - 3 freq xs (2) - 2 freq gb (2) - 2 freq tgi (2) - 1 freq bg (2) - 5 freq og (2) - 10 freq xeb (2) - 1 freq ©j (2) - 1 freq dge (2) - 1 freq moj (2) - 2 freq |
xgj (0) - 1 freq xgm (2) - 1 freq gj (2) - 5 freq agj (2) - 1 freq xji (3) - 1 freq ixgc (3) - 1 freq xja (3) - 1 freq axj (3) - 1 freq oxj (3) - 1 freq xuaj (3) - 1 freq xsoj (3) - 1 freq oigj (3) - 1 freq xju (3) - 1 freq exoj (3) - 1 freq xje (3) - 1 freq gjo (3) - 2 freq vg (4) - 3 freq gu (4) - 8 freq mkj (4) - 1 freq xzx (4) - 1 freq ig (4) - 16 freq igc (4) - 1 freq cgi (4) - 3 freq aj (4) - 6 freq xwe (4) - 1 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 - SKJ squidgy - 1 freq scodgie - 3 freq squeegee - 2 freq skjooa - 1 freq scodge - 2 freq zqij - 1 freq sacj - 1 freq xokoj - 1 freq xgj - 1 freq squidge - 1 freq scjj - 1 freq |
XGJ |
| Time to execute Levenshtein function - 0.175466 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.319357 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.032969 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.037165 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.000929 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. |