| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| garfunkel (0) - 2 freq maclunkey (4) - 1 freq graunie (4) - 1 freq crunkelt (4) - 1 freq ruckel (4) - 1 freq drunken (4) - 23 freq rapunzel (4) - 1 freq groundet (4) - 10 freq redfunnel (4) - 1 freq garnsey (4) - 1 freq caunel (4) - 6 freq granniel (4) - 2 freq grunted (4) - 17 freq graunder (4) - 2 freq parfumed (4) - 2 freq carousel (4) - 17 freq gunked (4) - 1 freq shrunken (4) - 1 freq arcangel (4) - 1 freq trunnel (4) - 1 freq grunge (4) - 1 freq girnel (4) - 2 freq grummel (4) - 1 freq funnel (4) - 7 freq gruel (4) - 3 freq |
garfunkel (0) - 2 freq girnel (6) - 2 freq granniel (6) - 2 freq grunter (7) - 1 freq earful (7) - 2 freq garnet (7) - 1 freq garpel (7) - 1 freq crunker (7) - 1 freq gardiner (7) - 1 freq grunded (7) - 1 freq gardener (7) - 2 freq runkelt (7) - 5 freq gruntet (7) - 4 freq grunies (7) - 1 freq gunnel (7) - 2 freq groinal (7) - 1 freq germinal (7) - 2 freq gruntle (7) - 1 freq graundly (7) - 1 freq garytank (7) - 2 freq garylineker (7) - 4 freq grounded (7) - 3 freq gornall (7) - 1 freq gruffal (7) - 2 freq girnal (7) - 5 freq |
SoundEx code - G615 gryphon - 335 freq grabbin - 29 freq gruppin - 19 freq grabbing - 4 freq grippin - 21 freq gropin - 2 freq groping - 1 freq grievance - 1 freq grievin - 13 freq greving - 1 freq graivn - 1 freq grabben - 1 freq graipin - 3 freq gairravoone - 1 freq 'girvan - 1 freq grabbieness - 1 freq gryphons - 1 freq graphemes - 3 freq grapheme - 5 freq grabban - 1 freq gropeens - 1 freq grippan - 2 freq gripin - 1 freq graven - 1 freq groupin - 1 freq grippiness - 1 freq garfunkel - 2 freq greivin - 1 freq griffon - 1 freq grippin' - 1 freq gribbenc - 7 freq gyrfyimx - 1 freq griefencounter - 1 freq grieving - 1 freq girvanacademy - 1 freq |
MetaPhone code - KRFNKL garfunkel - 2 freq |
GARFUNKEL |
| Time to execute Levenshtein function - 0.251216 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.674278 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.079083 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.088716 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.000838 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. |