| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ipatrick (0) - 1 freq patrick (1) - 32 freq €˜patrick (2) - 1 freq stpatrick (2) - 1 freq paitrick (2) - 1 freq kilpatrick (2) - 3 freq mathrick (3) - 1 freq carrick (3) - 6 freq trick (3) - 68 freq ettrick (3) - 10 freq mastrick (3) - 3 freq spatrils (3) - 1 freq uptick (3) - 1 freq pairtrick (3) - 1 freq attick (3) - 1 freq africk (3) - 1 freq lanrick (3) - 1 freq fitzpatrick (3) - 1 freq patriot (3) - 3 freq €˜trick (3) - 1 freq larick (3) - 1 freq parrock (3) - 2 freq paddick (3) - 1 freq whutrick (3) - 2 freq kirkpatrick (3) - 6 freq |
ipatrick (0) - 1 freq patrick (1) - 32 freq paitrick (2) - 1 freq parrock (4) - 2 freq paitricks (4) - 7 freq pairtrick (4) - 1 freq prick (4) - 71 freq patricia (4) - 21 freq patricio (4) - 1 freq uptick (4) - 1 freq atrack (4) - 1 freq strick (4) - 13 freq trick (4) - 68 freq ettrick (4) - 10 freq €˜patrick (4) - 1 freq stpatrick (4) - 1 freq kilpatrick (4) - 3 freq strack (5) - 9 freq trock (5) - 12 freq attrack (5) - 4 freq partick (5) - 12 freq puttock (5) - 1 freq districk (5) - 3 freq truck (5) - 48 freq pricky (5) - 5 freq |
SoundEx code - I136 ifter - 1 freq i'bedroom - 3 freq i'peterheid - 1 freq ipatrick - 1 freq |
MetaPhone code - IPTRK ipatrick - 1 freq |
IPATRICK |
| Time to execute Levenshtein function - 0.274511 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.431678 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.027878 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.038879 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.000872 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. |