| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gang-roond (0) - 14 freq aw-roond (3) - 2 freq aa-roond (3) - 1 freq lang-droont (3) - 1 freq laneroon (4) - 1 freq vagaboond (4) - 1 freq aground (4) - 1 freq playgroond (4) - 6 freq gangand (4) - 1 freq i'groond (4) - 4 freq kangaroos (4) - 1 freq marroond (4) - 1 freq rangoon (4) - 1 freq mangroved (4) - 1 freq year-roond (4) - 1 freq groond (4) - 71 freq backgroond (4) - 1 freq lang-voued (4) - 1 freq kangaroo (4) - 2 freq dang-doun (4) - 1 freq lang-won (4) - 1 freq aroond (4) - 511 freq lang-lown (4) - 1 freq lang-lost (5) - 1 freq tangerine (5) - 12 freq |
gang-roond (0) - 14 freq gangand (6) - 1 freq aw-roond (6) - 2 freq lang-droont (6) - 1 freq aa-roond (6) - 1 freq lang-voued (7) - 1 freq gangande (7) - 1 freq groond (7) - 71 freq lang-won (7) - 1 freq lang-hained (7) - 1 freq mangroved (7) - 1 freq dang-doun (7) - 1 freq year-roond (7) - 1 freq aground (7) - 1 freq playgroond (7) - 6 freq i'groond (7) - 4 freq gas-iron (8) - 1 freq gangers (8) - 2 freq unnergroond (8) - 2 freq lang-kent (8) - 3 freq gang-l (8) - 1 freq hie-groond (8) - 1 freq agrund (8) - 3 freq ganger (8) - 1 freq gangrel (8) - 11 freq |
SoundEx code - G526 ginger - 113 freq 'gangrel - 1 freq gangrel - 11 freq ganger - 1 freq 'ginger' - 1 freq gangers - 2 freq gennesaret - 1 freq genessaretb - 1 freq gum-chawer - 1 freq gngirs - 1 freq gnashers - 1 freq gingerly - 2 freq gangrels - 1 freq gingerbread - 4 freq gangrel's - 1 freq gang-roond - 14 freq gingerbried - 15 freq gznqrduu - 1 freq gingertotty - 3 freq gingerboab - 5 freq gingergeekcraig - 1 freq |
MetaPhone code - KNKRNT concairned - 7 freq gang-roond - 14 freq concairnt - 3 freq |
GANG-ROOND |
| Time to execute Levenshtein function - 0.300251 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.526780 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.027392 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.073510 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.000829 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. |