| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gerrydotp (0) - 1 freq gerroot (3) - 1 freq kerry-oot (4) - 1 freq kerryon (4) - 1 freq gerrup (4) - 1 freq kerrots (4) - 1 freq kerry-on (4) - 2 freq garrot (4) - 1 freq berryden (4) - 2 freq terryscot (4) - 1 freq gerry (4) - 13 freq geryon (4) - 9 freq geordo (4) - 4 freq cerry-oot (4) - 1 freq kerryoan (4) - 1 freq ferryport (4) - 1 freq gerrykeogh (4) - 2 freq gairdit (5) - 6 freq currots (5) - 1 freq garr't (5) - 1 freq gerunds (5) - 1 freq terry (5) - 16 freq garrioch (5) - 1 freq terryann (5) - 3 freq ferrymen (5) - 1 freq |
gerrydotp (0) - 1 freq gerroot (5) - 1 freq garrot (6) - 1 freq gerrup (6) - 1 freq hurridooup (7) - 1 freq gairdit (7) - 6 freq gurred (7) - 8 freq garr't (7) - 1 freq garrt (7) - 9 freq guardit (7) - 1 freq garret (7) - 4 freq garrd (7) - 3 freq gerrykeogh (7) - 2 freq gerard (7) - 2 freq garred (7) - 22 freq gerry (7) - 13 freq berryden (7) - 2 freq geordo (7) - 4 freq kerrots (7) - 1 freq kerry-oot (7) - 1 freq grundit (7) - 17 freq cerry-oot (7) - 1 freq garyfooty (8) - 1 freq geordie (8) - 373 freq carrots (8) - 33 freq |
SoundEx code - G633 guairdit - 6 freq greeted - 28 freq graithed - 12 freq gairdit - 6 freq greetit - 10 freq graduate - 11 freq gairded - 3 freq gratitude - 16 freq guarded - 2 freq garrottit - 1 freq gratetul - 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 - JRTTP gerrydotp - 1 freq |
GERRYDOTP |
| Time to execute Levenshtein function - 0.252662 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.372879 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.029267 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.038931 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.000889 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. |