| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| garvie (0) - 1 freq arvie (1) - 1 freq jarvie (1) - 5 freq harvie (1) - 3 freq garye (2) - 3 freq gadie (2) - 5 freq gangie (2) - 3 freq hardie (2) - 26 freq parlie (2) - 7 freq girzie (2) - 2 freq gairdie (2) - 1 freq gurhie (2) - 1 freq gaunie (2) - 6 freq gabbie (2) - 1 freq garrin (2) - 35 freq gawsie (2) - 4 freq davie (2) - 229 freq darkie (2) - 2 freq lavvie (2) - 18 freq garde (2) - 1 freq narrie (2) - 1 freq gamrie (2) - 5 freq barkie (2) - 1 freq gare (2) - 1 freq carsie (2) - 1 freq |
garvie (0) - 1 freq garvey (2) - 1 freq arvie (2) - 1 freq harvie (2) - 3 freq jarvie (2) - 5 freq gave (3) - 241 freq gare (3) - 1 freq grie (3) - 6 freq sarve (3) - 10 freq gaerdie (3) - 1 freq greve (3) - 2 freq grove (3) - 21 freq gaive (3) - 1 freq gordie (3) - 1 freq girlie (3) - 5 freq gurrie (3) - 1 freq garage (3) - 58 freq garde (3) - 1 freq govie (3) - 3 freq carve (3) - 5 freq grave (3) - 130 freq girzie (3) - 2 freq gorgie (3) - 3 freq garcia (3) - 1 freq garye (3) - 3 freq |
SoundEx code - G610 grip - 125 freq grave - 130 freq grab - 114 freq grief - 113 freq gravy - 28 freq graff - 4 freq grove - 21 freq grup - 52 freq group - 346 freq gripe - 5 freq grippy - 9 freq grippie - 7 freq grauf - 3 freq graip - 5 freq grieve - 53 freq groove - 1 freq gruff - 16 freq grape - 8 freq grub - 39 freq greef - 1 freq groof - 1 freq garvey - 1 freq giraffe - 12 freq graf - 1 freq grubby - 2 freq gruppie - 2 freq greba - 8 freq 'grip - 1 freq grevy - 1 freq garvie - 1 freq grippy' - 1 freq grabbie - 3 freq greff - 6 freq 'group - 1 freq graph - 4 freq grappa - 3 freq garb - 4 freq groovy - 2 freq groop - 1 freq grav - 2 freq greep - 1 freq groupie - 3 freq gruip - 1 freq greve - 2 freq graif - 3 freq grefe - 2 freq gruppy - 1 freq geraff - 1 freq greyabbey - 2 freq grupp - 2 freq gerrup - 1 freq garybhoy - 3 freq grif - 1 freq grab - 1 freq greeba - 1 freq 'greba' - 1 freq garyb - 2 freq graaf - 1 freq grv - 1 freq grabby - 1 freq gorb - 1 freq |
MetaPhone code - KRF grave - 130 freq criv - 2 freq grief - 113 freq gravy - 28 freq graff - 4 freq grove - 21 freq crave - 13 freq curve - 24 freq kirov' - 1 freq grauf - 3 freq crieff - 7 freq grieve - 53 freq groove - 1 freq gruff - 16 freq greef - 1 freq groof - 1 freq garvey - 1 freq graf - 1 freq curvy - 3 freq curfew - 2 freq carefu - 23 freq grevy - 1 freq garvie - 1 freq corragh - 1 freq greff - 6 freq kerve - 5 freq graph - 4 freq carve - 5 freq groovy - 2 freq grav - 2 freq carefou - 1 freq carefu' - 1 freq greve - 2 freq graif - 3 freq grefe - 2 freq cruive - 1 freq curragh - 1 freq grif - 1 freq corfu - 3 freq cairve - 1 freq cuervo - 1 freq crieffy - 1 freq graaf - 1 freq grv - 1 freq kerav - 1 freq craufy - 1 freq |
GARVIE |
| Time to execute Levenshtein function - 0.283046 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.442814 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.028449 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.040174 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.000945 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. |