| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gteat (0) - 1 freq great (1) - 1293 freq teat (1) - 1 freq geeat (1) - 1 freq geet (2) - 10 freq cleat (2) - 1 freq itet (2) - 1 freq weat (2) - 1 freq glert (2) - 1 freq treat (2) - 141 freq 'great (2) - 8 freq 'eat (2) - 6 freq wheat (2) - 30 freq greet (2) - 288 freq teas (2) - 3 freq tent (2) - 460 freq gae't (2) - 2 freq gaet (2) - 22 freq bleat (2) - 5 freq teet (2) - 13 freq preat (2) - 1 freq seat (2) - 277 freq goest (2) - 1 freq geelt (2) - 2 freq steam (2) - 77 freq |
gteat (0) - 1 freq gtt (2) - 1 freq geeat (2) - 1 freq gett (2) - 11 freq great (2) - 1293 freq teat (2) - 1 freq gieit (3) - 1 freq geats (3) - 1 freq gelt (3) - 1 freq guest (3) - 42 freq gie't (3) - 12 freq goat (3) - 732 freq graat (3) - 5 freq giest (3) - 1 freq gret (3) - 148 freq giekt (3) - 1 freq get (3) - 5225 freq stat (3) - 1 freq gzet (3) - 1 freq gatt (3) - 1 freq getta (3) - 2 freq greit (3) - 18 freq gleet (3) - 8 freq gloat (3) - 4 freq gyet (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 - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 9 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq coatit - 5 freq cutted - 1 freq cuddied - 1 freq quieted - 1 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 |
GTEAT |
| Time to execute Levenshtein function - 0.199124 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.345428 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.027484 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.037101 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.000933 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. |