| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gyte-like (0) - 1 freq wyce-like (2) - 15 freq wyse-like (2) - 1 freq rat-like (3) - 1 freq nate-lik (3) - 1 freq gleg-like (3) - 1 freq quate-like (3) - 9 freq some-like (3) - 1 freq wyce-lyke (3) - 2 freq gutsie-like (3) - 1 freq blate-like (3) - 16 freq wise-like (3) - 3 freq jynt-like (3) - 1 freq gleyt-like (3) - 1 freq wycelike (3) - 12 freq cat-like (3) - 1 freq gentie-like (3) - 10 freq moth-like (3) - 1 freq owre-like (3) - 1 freq maze-like (3) - 1 freq wice-like (3) - 3 freq fatnalike (4) - 1 freq biker-like (4) - 1 freq gleglie (4) - 3 freq wean-like (4) - 1 freq |
gyte-like (0) - 1 freq gentie-like (4) - 10 freq cat-like (4) - 1 freq gutsie-like (4) - 1 freq gleyt-like (4) - 1 freq wyce-like (4) - 15 freq quate-like (4) - 9 freq wyse-like (4) - 1 freq rat-like (4) - 1 freq nate-lik (4) - 1 freq gate-leave (5) - 2 freq roit-like (5) - 1 freq quiet-like (5) - 5 freq gay-lik (5) - 1 freq gah-lik (5) - 1 freq wice-like (5) - 3 freq saut-like (5) - 1 freq quaet-like (5) - 2 freq maze-like (5) - 1 freq blate-like (5) - 16 freq wyce-lyke (5) - 2 freq some-like (5) - 1 freq gleg-like (5) - 1 freq wise-like (5) - 3 freq jynt-like (5) - 1 freq |
SoundEx code - G342 guid-lookin - 4 freq goodlookin - 1 freq gowdilocks - 7 freq good-looking - 2 freq godless - 12 freq gutless - 1 freq gaidhlig - 8 freq goodluck - 2 freq gweed-lookin - 1 freq guidless - 3 freq guddle's - 1 freq guddles - 2 freq gweed-leukin - 1 freq gàidhlig - 71 freq gödless - 1 freq gàidhlig's - 2 freq goidelic - 3 freq guid-leukin - 1 freq gyte-like - 1 freq gydals - 1 freq godlaek - 1 freq guid-leukkin - 1 freq ghàidhlig - 1 freq gdlujvoe - 1 freq ghdlqo - 1 freq gtalstonwader - 1 freq |
MetaPhone code - JTLK jet-lag - 1 freq gyte-like - 1 freq jedlicka - 5 freq |
GYTE-LIKE |
| Time to execute Levenshtein function - 0.250980 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.409568 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.028534 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.038367 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.000928 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. |