| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gicn (0) - 1 freq sicn (1) - 1 freq gien (1) - 1024 freq girn (1) - 60 freq gicd (1) - 1 freq gi'n (1) - 3 freq gic (1) - 2 freq gin (1) - 1987 freq gicin (1) - 1 freq geck (2) - 6 freq gean (2) - 10 freq gig (2) - 46 freq gild (2) - 1 freq fick (2) - 1 freq pict (2) - 5 freq gite (2) - 2 freq gip (2) - 3 freq gen (2) - 11 freq giem (2) - 1 freq wisn (2) - 3 freq hin (2) - 36 freq gtice (2) - 1 freq pin (2) - 37 freq divn (2) - 1 freq lick (2) - 51 freq |
gicn (0) - 1 freq gicin (1) - 1 freq gecin (2) - 1 freq gacin (2) - 1 freq gic (2) - 2 freq gin (2) - 1987 freq gi'n (2) - 3 freq girn (2) - 60 freq sicn (2) - 1 freq gicd (2) - 1 freq gien (2) - 1024 freq mcn (3) - 1 freq gca (3) - 1 freq getn (3) - 1 freq icin (3) - 10 freq gcs (3) - 1 freq glen (3) - 166 freq gan (3) - 768 freq gcf (3) - 1 freq gon (3) - 7 freq gahn (3) - 1 freq gyct (3) - 1 freq cn (3) - 2 freq goun (3) - 23 freq giean (3) - 4 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 - JKN joukin - 25 freq jiggin - 37 freq geckin - 3 freq jookin - 7 freq jaggin - 9 freq jokin - 46 freq joggin - 9 freq giggin - 2 freq gicn - 1 freq jeconiah - 4 freq jockina - 20 freq jukin - 1 freq joggan - 1 freq geckan - 1 freq jakin - 1 freq joukan - 1 freq jockin - 1 freq jqn - 1 freq |
GICN |
| Time to execute Levenshtein function - 0.178887 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.325121 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.028292 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.037941 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.000915 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. |