Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kirkpatrick (0) - 6 freq kilpatrick (2) - 3 freq portpatrick (3) - 2 freq fitzpatrick (3) - 1 freq ipatrick (3) - 1 freq o'kilpatrick (4) - 1 freq €˜patrick (4) - 1 freq patrick (4) - 32 freq rickmatick (4) - 1 freq stpatrick (4) - 1 freq kindrick (5) - 1 freq kirkyairds (5) - 10 freq kirmarnock (5) - 1 freq rithmatick (5) - 3 freq geriatric (5) - 1 freq prattick (5) - 18 freq kinrick (5) - 22 freq kiribati (5) - 3 freq firestick (5) - 2 freq kirkgate (5) - 4 freq mikekilpatrick (5) - 1 freq kirkyard (5) - 24 freq missspatrice (5) - 1 freq paitrick (5) - 1 freq kingrick (5) - 2 freq |
kirkpatrick (0) - 6 freq kilpatrick (4) - 3 freq portpatrick (5) - 2 freq ipatrick (6) - 1 freq fitzpatrick (6) - 1 freq stpatrick (7) - 1 freq patrick (7) - 32 freq €˜patrick (7) - 1 freq o'kilpatrick (7) - 1 freq paitrick (8) - 1 freq kirkmabreeke (8) - 2 freq ker-park (8) - 1 freq mikekilpatrick (8) - 1 freq restrick (8) - 1 freq pairtrick (8) - 1 freq rickmatick (8) - 1 freq bairntrock (9) - 1 freq kirkyairds (9) - 10 freq mickbrick (9) - 17 freq kirkyaird (9) - 81 freq kindrick (9) - 1 freq prattick (9) - 18 freq cairt-track (9) - 1 freq tirrick (9) - 6 freq districk (9) - 3 freq |
SoundEx code - K621 kirkbean - 2 freq krassivy - 1 freq kirkfieldbank - 1 freq kirk-brae - 1 freq kirkpatrick - 6 freq kircubbin - 1 freq kirk-fowk - 1 freq kershopefit - 1 freq krazibaker - 1 freq krispies - 1 freq krzwyf - 1 freq krisboydssmile - 1 freq krispy - 4 freq |
MetaPhone code - KRKPTRK kirkpatrick - 6 freq |
KIRKPATRICK |
Time to execute Levenshtein function - 0.259336 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.409173 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.038346 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.041114 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.000898 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. |