| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grieving (0) - 1 freq greving (1) - 1 freq grievin (1) - 14 freq scrieving (2) - 5 freq briefing (2) - 3 freq greying (2) - 2 freq grinding (2) - 2 freq greeting (2) - 13 freq giving (2) - 26 freq driving (2) - 19 freq grinning (2) - 5 freq grilling (2) - 1 freq criein (3) - 1 freq grippin (3) - 21 freq greetin (3) - 366 freq reing (3) - 2 freq greins (3) - 1 freq bribing (3) - 1 freq growling (3) - 1 freq living (3) - 49 freq brimming (3) - 2 freq heving (3) - 1 freq primming (3) - 1 freq geeing (3) - 1 freq gliding (3) - 1 freq |
grieving (0) - 1 freq greving (1) - 1 freq grievin (2) - 14 freq driving (3) - 19 freq greeting (3) - 13 freq giving (3) - 26 freq greying (3) - 2 freq girning (4) - 1 freq proving (4) - 3 freq grievance (4) - 1 freq greivin (4) - 1 freq groping (4) - 1 freq agreeing (4) - 2 freq raving (4) - 2 freq growing (4) - 14 freq grazing (4) - 3 freq irving (4) - 1 freq arriving (4) - 5 freq briefing (4) - 3 freq grilling (4) - 1 freq grinning (4) - 5 freq grinding (4) - 2 freq scrieving (4) - 5 freq brining (5) - 1 freq leeving (5) - 1 freq |
SoundEx code - G615 gryphon - 335 freq grabbin - 29 freq gruppin - 19 freq grabbing - 4 freq grippin - 21 freq gropin - 2 freq groping - 1 freq grievance - 1 freq grievin - 14 freq greving - 1 freq graivn - 1 freq grabben - 1 freq graipin - 3 freq gairravoone - 1 freq 'girvan - 1 freq grabbieness - 1 freq gryphons - 1 freq graphemes - 3 freq grapheme - 5 freq grabban - 1 freq gropeens - 1 freq grippan - 2 freq gripin - 1 freq graven - 1 freq groupin - 1 freq grippiness - 1 freq garfunkel - 2 freq greivin - 1 freq griffon - 1 freq grippin' - 1 freq gribbenc - 7 freq gyrfyimx - 1 freq griefencounter - 1 freq grieving - 1 freq girvanacademy - 1 freq |
MetaPhone code - KRFNK greving - 1 freq carving - 2 freq grieving - 1 freq |
GRIEVING |
| Time to execute Levenshtein function - 0.235055 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.393350 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.027495 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.037150 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.000940 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. |