| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xgrc (0) - 1 freq xrc (1) - 1 freq xgj (2) - 1 freq mrc (2) - 1 freq agri (2) - 1 freq ggrr (2) - 1 freq gic (2) - 2 freq marc (2) - 16 freq wurc (2) - 1 freq gra (2) - 3 freq agr (2) - 1 freq slrc (2) - 15 freq lgc (2) - 1 freq ogfc (2) - 1 freq rc (2) - 3 freq grcu (2) - 1 freq xtra (2) - 5 freq lrc (2) - 1 freq gri (2) - 1 freq gnc (2) - 1 freq xulc (2) - 1 freq iirc (2) - 1 freq grr (2) - 2 freq lgr (2) - 1 freq xhoc (2) - 1 freq |
xgrc (0) - 1 freq xrc (2) - 1 freq ixgc (3) - 1 freq grcu (3) - 1 freq xhrx (4) - 1 freq jrc (4) - 1 freq gtc (4) - 1 freq gre (4) - 4 freq src (4) - 1 freq herc (4) - 1 freq gcc (4) - 2 freq werc (4) - 1 freq xre (4) - 1 freq arc (4) - 7 freq airc (4) - 1 freq agcc (4) - 5 freq gec (4) - 1 freq merc (4) - 2 freq xdc (4) - 1 freq gryce (4) - 1 freq grace (4) - 155 freq groce (4) - 4 freq giric (4) - 1 freq exerce (4) - 1 freq grice (4) - 38 freq |
SoundEx code - X620 xrc - 1 freq xgrc - 1 freq xhrx - 1 freq |
MetaPhone code - SKRK skreek - 4 freq skraik - 4 freq scroag - 1 freq scroaggy - 1 freq skrek - 4 freq scraggy - 4 freq skraikie - 1 freq squarego - 1 freq skrog - 1 freq scraik - 1 freq scroggie - 1 freq scroggy - 3 freq scrake - 1 freq xgrc - 1 freq |
XGRC |
| Time to execute Levenshtein function - 0.199381 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.364019 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.028628 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.048412 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.001187 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. |