| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goargit (0) - 1 freq goadit (2) - 3 freq goamit (2) - 1 freq forgit (2) - 8 freq dargit (2) - 2 freq oagit (2) - 5 freq roarit (2) - 6 freq soartit (2) - 1 freq chargit (2) - 2 freq hoarnit (2) - 1 freq margit (2) - 32 freq shargit (2) - 2 freq gorgin (2) - 1 freq guardit (2) - 1 freq gorgie (2) - 3 freq gaggit (2) - 1 freq georgie (3) - 2 freq parkit (3) - 13 freq goatie (3) - 1 freq harit (3) - 1 freq soackit (3) - 1 freq beardit (3) - 2 freq goat (3) - 732 freq parfit (3) - 2 freq changit (3) - 2 freq |
goargit (0) - 1 freq gorgin (3) - 1 freq guardit (3) - 1 freq gorgie (3) - 3 freq margit (3) - 32 freq gaggit (3) - 1 freq dargit (3) - 2 freq forgit (3) - 8 freq forgait (4) - 1 freq gaart (4) - 3 freq guairdit (4) - 6 freq gorge (4) - 5 freq nyirgit (4) - 2 freq croagit (4) - 1 freq graavit (4) - 2 freq marget (4) - 6 freq grit (4) - 25 freq fergit (4) - 2 freq grait (4) - 1 freq garnet (4) - 1 freq goriot (4) - 1 freq forget (4) - 266 freq emergit (4) - 1 freq garret (4) - 4 freq gorged (4) - 2 freq |
SoundEx code - G623 grazed - 5 freq grossit - 2 freq grushed - 1 freq grosets - 3 freq gairsty - 2 freq goargit - 1 freq groustie - 2 freq grayssed - 1 freq grist - 36 freq greased - 3 freq grectin - 1 freq graced - 4 freq grassed - 5 freq greased-back - 1 freq greasy-heidit - 1 freq gurged - 1 freq gorged - 2 freq gristle - 3 freq greast - 1 freq grogged - 1 freq gree-get - 1 freq greastest - 1 freq girst - 2 freq grossets - 1 freq gourgaud - 1 freq grosset - 2 freq gorsedh - 1 freq garscadden - 2 freq garygatesmusic - 1 freq georgethepoet - 1 freq grctjk - 1 freq grozet - 1 freq greggwatson - 1 freq |
MetaPhone code - KRJT goargit - 1 freq croagit - 1 freq grudged - 1 freq courgette - 1 freq gurged - 1 freq gorged - 2 freq croudged - 1 freq kraigit - 1 freq gree-get - 1 freq crooged - 1 freq croogit - 1 freq |
GOARGIT |
| Time to execute Levenshtein function - 0.212818 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.422294 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.028059 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.037244 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. |