| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gydit (0) - 3 freq bydit (1) - 8 freq gypit (1) - 20 freq wydit (1) - 1 freq gyit (1) - 2 freq git (2) - 1244 freq dydie (2) - 3 freq yoit (2) - 1 freq ryndit (2) - 1 freq fykit (2) - 1 freq greit (2) - 18 freq bodit (2) - 2 freq myndit (2) - 28 freq ymit (2) - 1 freq gymkit (2) - 1 freq gyid (2) - 1 freq eyndit (2) - 2 freq audit (2) - 12 freq gyat (2) - 1 freq ledit (2) - 1 freq wypit (2) - 1 freq 'yit (2) - 1 freq typit (2) - 3 freq dytit (2) - 2 freq gapit (2) - 1 freq |
gydit (0) - 3 freq guidit (2) - 17 freq goadit (2) - 3 freq godot (2) - 1 freq gyit (2) - 2 freq bydit (2) - 8 freq wydit (2) - 1 freq gypit (2) - 20 freq wadit (3) - 1 freq edit (3) - 17 freq endit (3) - 55 freq fadit (3) - 10 freq gyt (3) - 1 freq glidit (3) - 1 freq addit (3) - 97 freq gildit (3) - 1 freq gytie (3) - 1 freq gjit (3) - 2 freq gyct (3) - 1 freq hidit (3) - 1 freq fedit (3) - 1 freq gydal (3) - 1 freq govit (3) - 1 freq bidit (3) - 30 freq sidit (3) - 1 freq |
SoundEx code - G330 gutted - 32 freq guidit - 17 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq gated - 1 freq godheid - 5 freq gydit - 3 freq goaded - 1 freq godot - 1 freq €™guided - 1 freq gtid - 1 freq gdwood - 11 freq |
MetaPhone code - JTT jottit - 1 freq gydit - 3 freq jetted - 1 freq jaded - 3 freq jaytat - 2 freq joedoody - 1 freq |
GYDIT |
| Time to execute Levenshtein function - 0.212300 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.386445 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.028476 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.038029 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.004965 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. |