| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gated (0) - 1 freq gates (1) - 102 freq ga'ed (1) - 3 freq gaped (1) - 3 freq fated (1) - 1 freq sated (1) - 3 freq ganted (1) - 2 freq dated (1) - 6 freq gaed (1) - 1526 freq rated (1) - 3 freq wated (1) - 1 freq hated (1) - 48 freq gazed (1) - 15 freq gate (1) - 293 freq gamed (1) - 1 freq grated (1) - 1 freq gred (2) - 2 freq gawd (2) - 2 freq gar'd (2) - 1 freq hates (2) - 35 freq doted (2) - 1 freq fawed (2) - 6 freq gutsed (2) - 1 freq gatt (2) - 1 freq famed (2) - 8 freq |
gated (0) - 1 freq hated (2) - 48 freq wated (2) - 1 freq gazed (2) - 15 freq grated (2) - 1 freq gtid (2) - 1 freq rated (2) - 3 freq gate (2) - 293 freq gamed (2) - 1 freq gaped (2) - 3 freq gaed (2) - 1526 freq gates (2) - 102 freq fated (2) - 1 freq ga'ed (2) - 3 freq ganted (2) - 2 freq dated (2) - 6 freq sated (2) - 3 freq glued (3) - 13 freq gote (3) - 43 freq goaved (3) - 7 freq goatee (3) - 2 freq gade (3) - 1 freq opted (3) - 5 freq goate (3) - 1 freq outed (3) - 2 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 - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 8 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq cuddied - 1 freq quieted - 1 freq coatit - 4 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
GATED |
| Time to execute Levenshtein function - 0.186719 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.348891 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.028588 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.038417 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.000935 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. |