| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grieves (0) - 2 freq grieved (1) - 3 freq grieve (1) - 53 freq greves (1) - 1 freq greve (2) - 2 freq grievous (2) - 7 freq groves (2) - 2 freq riever (2) - 2 freq rieve (2) - 1 freq thieves (2) - 25 freq greev's (2) - 1 freq grief's (2) - 2 freq gives (2) - 20 freq griens (2) - 1 freq graves (2) - 31 freq griefs (2) - 2 freq reeves (2) - 5 freq rives (2) - 4 freq grevel (2) - 4 freq scrieves (2) - 14 freq skrieves (2) - 3 freq grievin (2) - 14 freq nieves (2) - 15 freq grebes (2) - 2 freq drives (2) - 27 freq |
grieves (0) - 2 freq greves (1) - 1 freq graves (2) - 31 freq grieved (2) - 3 freq groves (2) - 2 freq grooves (2) - 1 freq grievous (2) - 7 freq grieve (2) - 53 freq grevel (3) - 4 freq rives (3) - 4 freq grievin (3) - 14 freq grees (3) - 18 freq grievious (3) - 1 freq reeves (3) - 5 freq grieveyous (3) - 1 freq grebes (3) - 2 freq drives (3) - 27 freq greve (3) - 2 freq greev's (3) - 1 freq griefs (3) - 2 freq gives (3) - 20 freq griens (3) - 1 freq grids (4) - 1 freq grapes (4) - 23 freq graived (4) - 1 freq |
SoundEx code - G612 graves - 31 freq gravesteen - 1 freq gravesteens - 4 freq gorbs - 1 freq giraffes - 3 freq grabs - 21 freq grubbiest - 1 freq greves - 1 freq groups - 152 freq grapes - 23 freq grieveyous - 1 freq grups - 12 freq grievously - 1 freq grief-stricken - 1 freq grebes - 2 freq grievous - 7 freq gravesend - 1 freq grieves - 2 freq gravestone - 2 freq griefs - 2 freq gearbox - 5 freq greev's - 1 freq geerbox - 1 freq graips - 3 freq gravestanes - 11 freq gear-boxes - 2 freq groves - 2 freq grief's - 2 freq graveside - 1 freq grips - 18 freq graphics' - 1 freq graphic - 23 freq graphical - 4 freq graphs - 6 freq graupius - 4 freq gravestones - 6 freq gravestane - 7 freq graveslabs - 1 freq garravashin - 3 freq garravashed - 2 freq grievious - 1 freq grab's - 1 freq grapeshot - 2 freq greebs - 1 freq graphics - 3 freq grrrr-oppp-pischschschz - 1 freq graabs - 1 freq gravy's - 6 freq graffs - 2 freq grew-back - 1 freq graff-stane - 1 freq garvyauch - 1 freq grooves - 1 freq graufs - 1 freq group's - 3 freq garbage - 9 freq grypes - 1 freq grubs - 2 freq garbeg - 2 freq €˜garbage - 1 freq gropes - 1 freq gearboxes - 1 freq graphocentrism - 1 freq garbhcnoc - 2 freq gervaise - 1 freq |
MetaPhone code - KRFS graves - 31 freq curves - 10 freq cairves - 2 freq greves - 1 freq grievous - 7 freq grieves - 2 freq griefs - 2 freq crevice - 2 freq greev's - 1 freq craves - 2 freq groves - 2 freq grief's - 2 freq graphs - 6 freq grievious - 1 freq gravy's - 6 freq graffs - 2 freq grooves - 1 freq graufs - 1 freq curfews - 2 freq crevasse - 1 freq craighouse - 1 freq cruives - 1 freq krvzi - 1 freq cuervos - 1 freq crieffys - 1 freq |
GRIEVES |
| Time to execute Levenshtein function - 0.189890 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.347237 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.029535 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.036804 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.000899 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. |