| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gerda (0) - 4 freq ferd (2) - 2 freq gerry (2) - 13 freq neruda (2) - 1 freq herd (2) - 157 freq erza (2) - 1 freq needa (2) - 1 freq girds (2) - 5 freq germs (2) - 4 freq derd (2) - 1 freq gerden (2) - 4 freq garuda (2) - 1 freq vera (2) - 29 freq erra (2) - 3 freq geid (2) - 53 freq corda (2) - 1 freq gord (2) - 1 freq gern (2) - 1 freq terra (2) - 1 freq kerds (2) - 1 freq geordo (2) - 4 freq erd (2) - 11 freq berde (2) - 2 freq verdi (2) - 1 freq ger (2) - 2 freq |
gerda (0) - 4 freq geordo (2) - 4 freq gord (2) - 1 freq gard (2) - 4 freq gurdy (2) - 2 freq guerd (2) - 1 freq garde (2) - 1 freq garuda (2) - 1 freq gird (2) - 48 freq gerse (3) - 2 freq gert (3) - 4 freq garya (3) - 2 freq verde (3) - 2 freq gra (3) - 3 freq gourd (3) - 5 freq ged (3) - 18 freq greed (3) - 58 freq grade (3) - 19 freq kerd (3) - 1 freq grod (3) - 1 freq geared (3) - 2 freq gaird (3) - 60 freq guard (3) - 38 freq geed (3) - 69 freq nerd (3) - 2 freq |
SoundEx code - G630 grat - 59 freq gritty - 5 freq greet - 283 freq great - 1278 freq gird - 48 freq gart - 158 freq guard - 38 freq graith - 128 freq gryte - 68 freq gret - 146 freq gaird - 60 freq geordie - 373 freq geordie' - 4 freq greed - 58 freq gree'd - 8 freq gaart - 3 freq greedy - 38 freq 'great - 7 freq greit - 18 freq grued - 8 freq garrd - 3 freq garrt - 9 freq 'greed - 1 freq grate - 18 freq grit - 25 freq garred - 22 freq growthie - 9 freq gaured - 2 freq grade - 19 freq growth - 50 freq growed - 47 freq gert - 4 freq garr't - 1 freq gaready - 1 freq garret - 4 freq gerda - 4 freq grid - 8 freq geared - 2 freq greid - 1 freq greetie - 2 freq gurred - 8 freq graet - 39 freq grait - 1 freq goriot - 1 freq garth - 3 freq girth - 5 freq guaird - 13 freq groued - 7 freq 'geordie - 8 freq gra'te - 1 freq grotto - 3 freq gertie - 39 freq greet' - 1 freq grett - 34 freq 'groatie' - 1 freq geordo - 4 freq gard - 4 freq growe'th - 1 freq gurt - 1 freq grott - 1 freq gurthie - 2 freq grieit - 1 freq growit - 3 freq grottie - 1 freq gar'd - 1 freq græt - 1 freq groatie - 3 freq garotte - 1 freq grey-white - 1 freq grut - 1 freq greth - 1 freq grite - 1 freq gar't - 3 freq gred - 2 freq growthe - 6 freq 'gryte - 1 freq garuda - 1 freq gordie - 1 freq gaurt - 2 freq girthie - 1 freq grete - 2 freq gord - 1 freq gritt - 1 freq gaerdie - 1 freq groat - 1 freq gareth - 2 freq gourd - 5 freq garrot - 1 freq gried - 8 freq greitt - 1 freq growd - 1 freq €˜great - 2 freq grotty - 1 freq €œgreat - 2 freq gairdie - 1 freq groattie - 1 freq garde - 1 freq graat - 5 freq greta - 1 freq gerroot - 1 freq -gurta - 1 freq growthy - 1 freq €œgrit - 2 freq €™great - 1 freq guerd - 1 freq gyrate - 1 freq grod - 1 freq grado - 1 freq garadh - 1 freq geraaht - 1 freq gurdy - 2 freq 'greet' - 1 freq 'gret' - 1 freq 'grat' - 1 freq ‘geordieÂ’ - 1 freq “geordie” - 2 freq |
MetaPhone code - JRT gird - 48 freq geordie - 373 freq geordie' - 4 freq gert - 4 freq gerda - 4 freq geared - 2 freq 'geordie - 8 freq jared - 3 freq jeert - 2 freq gertie - 39 freq geordo - 4 freq jeered - 1 freq gerroot - 1 freq gyrate - 1 freq geraaht - 1 freq jreid - 1 freq jordy - 4 freq ‘geordie’ - 1 freq “geordie” - 2 freq |
GERDA |
| Time to execute Levenshtein function - 0.184715 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.390707 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.028704 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.037599 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.000859 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. |