| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| garthdee (0) - 7 freq cardee (3) - 1 freq twarthree (3) - 1 freq girthie (3) - 1 freq gaither (3) - 82 freq garde (3) - 1 freq gather (3) - 16 freq garth (3) - 3 freq garden (3) - 67 freq warthie (3) - 9 freq gurthie (3) - 2 freq farther (3) - 14 freq earthen (3) - 2 freq garter (3) - 2 freq carthage (3) - 2 freq gaether (3) - 5 freq garten (3) - 2 freq gither (4) - 66 freq pathwey (4) - 6 freq arches (4) - 17 freq gordie (4) - 1 freq gard (4) - 4 freq kartie (4) - 1 freq garage (4) - 56 freq ogartnes (4) - 1 freq |
garthdee (0) - 7 freq graithed (4) - 12 freq gurthie (4) - 2 freq garth (4) - 3 freq girthie (4) - 1 freq girths (5) - 2 freq garethsoye (5) - 1 freq graithen (5) - 2 freq berthed (5) - 1 freq gyrthol (5) - 1 freq girth (5) - 5 freq birthday (5) - 199 freq gertrude (5) - 1 freq garten (5) - 2 freq burthday (5) - 9 freq gareth (5) - 2 freq birthed (5) - 3 freq gather (5) - 16 freq gaither (5) - 82 freq gaether (5) - 5 freq farther (5) - 14 freq earthen (5) - 2 freq carthage (5) - 2 freq warthie (5) - 9 freq garde (5) - 1 freq |
SoundEx code - G633 guairdit - 6 freq greeted - 27 freq graithed - 12 freq gairdit - 6 freq greetit - 10 freq graduate - 11 freq gairded - 3 freq gratitude - 13 freq guarded - 2 freq garrottit - 1 freq gritted - 3 freq graduated - 2 freq gratet - 1 freq geordietta - 17 freq gyrated - 1 freq graduates - 3 freq guardit - 1 freq graduation - 2 freq garthdee - 7 freq greitit - 1 freq graduatin - 2 freq girded - 1 freq gradyooit - 2 freq guairded - 3 freq garritted - 1 freq gradations - 1 freq graded - 3 freq garrotted - 1 freq gratiteid - 2 freq graddad - 1 freq grey-heidit - 1 freq graduatit - 1 freq gratiteed - 1 freq guerded - 1 freq grated - 1 freq graduating - 1 freq gordaidh - 3 freq gerrydotp - 1 freq geordiedentist - 1 freq |
MetaPhone code - KR0T graithed - 12 freq garthdee - 7 freq |
GARTHDEE |
| Time to execute Levenshtein function - 0.344231 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.462954 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.031985 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.037919 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.000805 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. |