| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gznqrduu (0) - 1 freq zqqrd (4) - 1 freq generous (4) - 21 freq gairdun (4) - 1 freq zvlodju (5) - 1 freq gquo (5) - 1 freq gunfre (5) - 1 freq generals (5) - 2 freq uznrb (5) - 1 freq gna'd (5) - 1 freq gunnul (5) - 2 freq gaerdie (5) - 1 freq guairded (5) - 3 freq gerrup (5) - 1 freq murdur (5) - 1 freq gairds (5) - 16 freq gond (5) - 1 freq gangrels (5) - 1 freq nordik (5) - 1 freq gzyesd (5) - 1 freq geordo (5) - 4 freq garde (5) - 1 freq girdin (5) - 2 freq gentry (5) - 15 freq tantrum (5) - 1 freq |
gznqrduu (0) - 1 freq zqqrd (6) - 1 freq gnarred (7) - 1 freq goqradio (7) - 3 freq garnard (7) - 1 freq generous (7) - 21 freq gendy (8) - 1 freq gdnd (8) - 1 freq gantries (8) - 1 freq gandy (8) - 1 freq genert (8) - 1 freq gintry (8) - 1 freq gruinard (8) - 2 freq genres (8) - 13 freq ganted (8) - 2 freq gard (8) - 4 freq gnpryi (8) - 1 freq gerard (8) - 2 freq goners (8) - 1 freq znorway (8) - 1 freq generate (8) - 4 freq gantrie (8) - 1 freq gentrie (8) - 5 freq gerda (8) - 4 freq gaird (8) - 61 freq |
SoundEx code - G526 ginger - 121 freq 'gangrel - 1 freq gangrel - 11 freq ganger - 1 freq 'ginger' - 1 freq gangers - 2 freq gennesaret - 1 freq genessaretb - 1 freq gum-chawer - 1 freq gngirs - 1 freq gnashers - 1 freq gingerly - 2 freq gangrels - 1 freq gingerbread - 4 freq gangrel's - 1 freq gang-roond - 14 freq gingerbried - 15 freq gznqrduu - 1 freq gingertotty - 3 freq gingerboab - 5 freq gingergeekcraig - 1 freq |
MetaPhone code - KSNKRT gznqrduu - 1 freq |
GZNQRDUU |
| Time to execute Levenshtein function - 0.180765 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.392148 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.032632 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.046047 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.001139 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. |