Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gaither (0) - 83 freq gaithert (1) - 79 freq maither (1) - 1 freq daither (1) - 1 freq aither (1) - 141 freq gaether (1) - 5 freq laither (1) - 2 freq gaithery (1) - 8 freq baither (1) - 2 freq gather (1) - 18 freq taither (1) - 1 freq gither (1) - 69 freq gaithers (1) - 9 freq faither (1) - 1391 freq raither (1) - 273 freq naither (1) - 63 freq i'ither (2) - 1 freq panther (2) - 18 freq aether (2) - 1 freq faithir (2) - 1 freq graithed (2) - 12 freq griter (2) - 1 freq bather (2) - 59 freq maitcer (2) - 1 freq waithur (2) - 1 freq |
gaither (0) - 83 freq gather (1) - 18 freq gither (1) - 69 freq gaithery (1) - 8 freq gaether (1) - 5 freq naither (2) - 63 freq gaethur (2) - 1 freq igither (2) - 12 freq gether (2) - 42 freq egither (2) - 5 freq gaitherie (2) - 2 freq faither (2) - 1391 freq raither (2) - 273 freq laither (2) - 2 freq gaithers (2) - 9 freq aither (2) - 141 freq daither (2) - 1 freq maither (2) - 1 freq gaithert (2) - 79 freq taither (2) - 1 freq baither (2) - 2 freq igether (3) - 2 freq 'ither (3) - 7 freq gaithered (3) - 70 freq ayther (3) - 3 freq |
SoundEx code - G360 gaither - 83 freq gether - 42 freq gutter - 33 freq gadder - 19 freq gither - 69 freq gather - 18 freq guitar - 27 freq guthrie - 6 freq gaether - 5 freq guider - 4 freq guttery - 3 freq gadderie - 9 freq 'gadder - 1 freq gaithery - 8 freq gied-owre - 1 freq guit-er - 4 freq gitter - 1 freq gaethur - 1 freq guttur - 1 freq gaitherie - 2 freq guidar - 1 freq gutterie - 1 freq g'throu - 1 freq gaddir - 1 freq 'gither - 4 freq gither' - 1 freq gooder' - 1 freq |
MetaPhone code - K0R gaither - 83 freq gather - 18 freq guthrie - 6 freq gaether - 5 freq gaithery - 8 freq gaethur - 1 freq gaitherie - 2 freq cawther - 1 freq caw-throu - 1 freq coothier - 2 freq g'throu - 1 freq |
GAITHER |
Time to execute Levenshtein function - 0.203127 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.361840 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.034405 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.038443 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.000941 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. |