| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gurged (0) - 1 freq gurled (1) - 10 freq gurges (1) - 1 freq gurgled (1) - 3 freq gurred (1) - 8 freq purged (1) - 1 freq gurned (1) - 1 freq urged (1) - 5 freq gorged (1) - 2 freq surged (1) - 1 freq barged (2) - 2 freq cursed (2) - 43 freq cured (2) - 29 freq urges (2) - 2 freq gred (2) - 2 freq budged (2) - 1 freq burned (2) - 32 freq varged (2) - 1 freq bulged (2) - 4 freq surge (2) - 17 freq tugged (2) - 4 freq gagged (2) - 4 freq gubbed (2) - 10 freq urge (2) - 27 freq guyed (2) - 1 freq |
gurged (0) - 1 freq gorged (1) - 2 freq gurned (2) - 1 freq surged (2) - 1 freq purged (2) - 1 freq urged (2) - 5 freq gurred (2) - 8 freq gurled (2) - 10 freq gurges (2) - 1 freq gurgled (2) - 3 freq gurgle (3) - 2 freq grudged (3) - 1 freq grued (3) - 8 freq gorge (3) - 5 freq ganged (3) - 22 freq girned (3) - 33 freq greed (3) - 58 freq girded (3) - 1 freq gourgaud (3) - 1 freq garred (3) - 22 freq guarded (3) - 2 freq guerded (3) - 1 freq garbed (3) - 3 freq varged (3) - 1 freq gred (3) - 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 |
GURGED |
| Time to execute Levenshtein function - 0.259451 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.343303 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.031895 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.036975 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.000861 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. |