| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| githert (0) - 3 freq dithert (1) - 1 freq gaithert (1) - 79 freq gither (1) - 69 freq gither' (1) - 1 freq gethert (1) - 41 freq withert (1) - 4 freq nithert (1) - 2 freq bithert (1) - 2 freq mithert (1) - 1 freq gathert (1) - 3 freq gethirt (2) - 1 freq gethern (2) - 1 freq fittert (2) - 1 freq hitherto (2) - 2 freq nithers (2) - 1 freq baithert (2) - 1 freq fithers (2) - 4 freq swithert (2) - 5 freq dither (2) - 2 freq gitters (2) - 1 freq gather (2) - 18 freq guttert (2) - 1 freq gathern (2) - 1 freq igither (2) - 12 freq |
githert (0) - 3 freq gethert (1) - 41 freq gathert (1) - 3 freq gaithert (1) - 79 freq gethirt (2) - 1 freq gaithirt (2) - 1 freq gaitheret (2) - 1 freq gaitherit (2) - 8 freq mithert (2) - 1 freq gither (2) - 69 freq dithert (2) - 1 freq gither' (2) - 1 freq withert (2) - 4 freq bithert (2) - 2 freq nithert (2) - 2 freq fethert (3) - 1 freq githered (3) - 18 freq gaither (3) - 83 freq gethers (3) - 11 freq githerin (3) - 2 freq gathers (3) - 3 freq gaithery (3) - 8 freq tethert (3) - 3 freq gether (3) - 42 freq egither (3) - 5 freq |
SoundEx code - G363 gaithered - 70 freq guid-hertit - 2 freq gathered - 26 freq gaithert - 79 freq gowd-reid - 1 freq gut-rot - 1 freq gethert - 41 freq geddert - 1 freq gethered - 8 freq gotthard - 1 freq gaitheret - 1 freq githered - 18 freq gaitherit - 8 freq gweed-hairtit - 3 freq gaethered - 1 freq gathert - 3 freq githert - 3 freq gaddered - 16 freq guttert - 1 freq gather'd - 1 freq göd-haertit - 1 freq gethirt - 1 freq gaithirt - 1 freq geddered - 1 freq gweed-hertit - 1 freq guid-hairted - 1 freq guid-hairtit - 1 freq goodreads - 1 freq |
MetaPhone code - J0RT gethert - 41 freq gethered - 8 freq githered - 18 freq githert - 3 freq gethirt - 1 freq jethart - 6 freq |
GITHERT |
| Time to execute Levenshtein function - 0.212400 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.359433 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.027261 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.038688 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.000956 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. |