| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gai-jin (0) - 1 freq gainin (2) - 11 freq gairdin (2) - 19 freq hainin (3) - 20 freq gappin (3) - 2 freq taiglin (3) - 3 freq tailin (3) - 1 freq faintin (3) - 4 freq mainin (3) - 3 freq dae-in (3) - 3 freq gimin (3) - 2 freq gauntin (3) - 2 freq gaddin (3) - 1 freq vairsin (3) - 1 freq girnin (3) - 74 freq cairvin (3) - 5 freq sairin (3) - 3 freq fairmin (3) - 22 freq nailin (3) - 1 freq gain (3) - 53 freq bairnin (3) - 2 freq grindin (3) - 4 freq saitin (3) - 3 freq gie-in (3) - 2 freq haivin (3) - 3 freq |
gai-jin (0) - 1 freq gie-in (4) - 2 freq gairdin (4) - 19 freq gainin (4) - 11 freq glimin (5) - 1 freq gabbin (5) - 19 freq gantin (5) - 23 freq gicin (5) - 1 freq garrin (5) - 35 freq ah-hin (5) - 2 freq grievin (5) - 14 freq gaapin (5) - 1 freq gawpin (5) - 34 freq gaanin (5) - 3 freq gairn (5) - 1 freq hae-in (5) - 1 freq gapin (5) - 10 freq gauchin (5) - 1 freq giftin (5) - 2 freq gattin (5) - 1 freq girsin (5) - 1 freq gay-lik (5) - 1 freq girkin (5) - 1 freq sei-in (5) - 1 freq gainan (5) - 1 freq |
SoundEx code - G250 guessin - 18 freq gazin - 18 freq geckin - 3 freq gawkin - 13 freq guisin - 30 freq gizzen - 5 freq gacin - 1 freq gushin - 4 freq gaggin - 7 freq gougin - 1 freq giggin - 2 freq gicn - 1 freq gai-jin - 1 freq gwickan - 1 freq gicin - 1 freq gecin - 1 freq gizmo - 2 freq gazan - 2 freq gokkan - 1 freq gawkan - 1 freq gaskin - 1 freq gowkin - 2 freq gowchin - 1 freq gaughan - 8 freq gascon - 2 freq geckan - 1 freq €˜giacomo - 1 freq giacomo - 2 freq guysin - 7 freq gauchin - 1 freq ggigxn - 1 freq guisin' - 1 freq |
MetaPhone code - KJN gadgin - 1 freq gougin - 1 freq cadgin - 2 freq gai-jin - 1 freq coagin - 1 freq gjaain - 2 freq kijn - 1 freq gjaan - 1 freq |
GAI-JIN |
| Time to execute Levenshtein function - 0.283033 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.360026 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.035088 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.037752 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.000909 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. |