| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gorged (0) - 2 freq forged (1) - 3 freq gorge (1) - 5 freq gurged (1) - 1 freq gooped (2) - 1 freq gorsedh (2) - 1 freq forget (2) - 266 freq darged (2) - 1 freq goaved (2) - 7 freq gord (2) - 1 freq fogged (2) - 1 freq cogged (2) - 2 freq hodged (2) - 3 freq gorbel (2) - 1 freq forges (2) - 2 freq togged (2) - 1 freq greed (2) - 58 freq gouge (2) - 1 freq gomed (2) - 18 freq goges (2) - 5 freq horned (2) - 2 freq gurgled (2) - 3 freq gowped (2) - 5 freq surged (2) - 1 freq merged (2) - 2 freq |
gorged (0) - 2 freq gurged (1) - 1 freq gorge (2) - 5 freq forged (2) - 3 freq gagged (3) - 4 freq gurges (3) - 1 freq gorgie (3) - 3 freq girned (3) - 33 freq garred (3) - 22 freq purged (3) - 1 freq gred (3) - 2 freq ganged (3) - 22 freq forgied (3) - 2 freq garbed (3) - 3 freq girded (3) - 1 freq varged (3) - 1 freq georges (3) - 2 freq grued (3) - 8 freq urged (3) - 5 freq grogged (3) - 1 freq gorgin (3) - 1 freq gurred (3) - 8 freq gurned (3) - 1 freq george (3) - 172 freq gried (3) - 8 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 |
GORGED |
| Time to execute Levenshtein function - 0.245100 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.394927 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.036605 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.037309 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.000864 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. |