| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| groove (0) - 1 freq groose (1) - 4 freq groovy (1) - 2 freq grove (1) - 21 freq grooves (1) - 1 freq prove (2) - 66 freq oove (2) - 1 freq grave (2) - 130 freq roofe (2) - 1 freq glove (2) - 11 freq grieve (2) - 53 freq grouse (2) - 29 freq brooke (2) - 11 freq trove (2) - 3 freq broone (2) - 1 freq groon' (2) - 1 freq roose (2) - 5 freq grouwe (2) - 1 freq groce (2) - 4 freq broose (2) - 1 freq gove (2) - 14 freq grovel (2) - 3 freq drove (2) - 68 freq groke (2) - 1 freq yoove (2) - 2 freq |
groove (0) - 1 freq grove (1) - 21 freq groovy (1) - 2 freq greve (2) - 2 freq grave (2) - 130 freq grieve (2) - 53 freq groose (2) - 4 freq grooves (2) - 1 freq rove (3) - 2 freq groon (3) - 7 freq groo (3) - 4 freq groop (3) - 1 freq groof (3) - 1 freq growe (3) - 108 freq groves (3) - 2 freq gravy (3) - 28 freq grav (3) - 2 freq groke (3) - 1 freq groom (3) - 17 freq grv (3) - 1 freq grevy (3) - 1 freq grose (3) - 1 freq goave (3) - 6 freq glove (3) - 11 freq grouwe (3) - 1 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 |
GROOVE |
| Time to execute Levenshtein function - 0.210747 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.317260 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.027635 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.037946 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.000974 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. |