| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gutturals (0) - 1 freq guttural (1) - 4 freq cultural (3) - 338 freq futterats (3) - 1 freq gutters (3) - 10 freq gestural (3) - 2 freq guttur (3) - 1 freq nattural (3) - 1 freq glottals (4) - 1 freq butteries (4) - 23 freq cultures (4) - 26 freq gunrays (4) - 1 freq gutterie (4) - 1 freq 'cultural' (4) - 1 freq cutter's (4) - 1 freq guttert (4) - 1 freq futterat's (4) - 1 freq enthrals (4) - 1 freq nuttall (4) - 1 freq naitural (4) - 35 freq naaturall (4) - 1 freq numerals (4) - 4 freq letturs (4) - 3 freq murals (4) - 8 freq culturally (4) - 8 freq |
gutturals (0) - 1 freq guttural (2) - 4 freq gutters (4) - 10 freq nattural (5) - 1 freq gitters (5) - 1 freq guttur (5) - 1 freq tutorials (5) - 3 freq gestural (5) - 2 freq futterats (5) - 1 freq utterly (6) - 18 freq guitars (6) - 4 freq guttery (6) - 3 freq gutters' (6) - 1 freq mattrass (6) - 5 freq gutties (6) - 11 freq gurls (6) - 1 freq neutrals (6) - 2 freq gutterin (6) - 5 freq generals (6) - 2 freq mutters (6) - 10 freq buttries (6) - 3 freq wastrals (6) - 1 freq vittals (6) - 2 freq grals (6) - 1 freq butter's (6) - 1 freq |
SoundEx code - G364 gutturals - 1 freq guttural - 4 freq getrollytelt - 1 freq guydorrellesq - 2 freq |
MetaPhone code - KTRLS gutturals - 1 freq quadrilles - 1 freq |
GUTTURALS |
| Time to execute Levenshtein function - 0.230907 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.377520 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.028532 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.037891 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.003267 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. |