| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| katieprice (0) - 1 freq katherine (3) - 5 freq misskatieprice (4) - 2 freq catherine (4) - 12 freq katrine (4) - 3 freq natterie (4) - 1 freq 'katherine (4) - 1 freq katheryne (4) - 1 freq patience (4) - 46 freq cut-price (4) - 1 freq katharine (4) - 2 freq katiec (4) - 18 freq watterie (4) - 8 freq tatterie (4) - 1 freq hauf-price (4) - 2 freq atterie (4) - 4 freq lexiprice (4) - 1 freq waterthe (5) - 1 freq gatherins (5) - 3 freq apprise (5) - 2 freq watterside (5) - 5 freq aiulice (5) - 1 freq batteries (5) - 8 freq avarice (5) - 1 freq katie (5) - 34 freq |
katieprice (0) - 1 freq katherine (5) - 5 freq cut-price (6) - 1 freq katheryne (6) - 1 freq katharine (6) - 2 freq katiec (6) - 18 freq lexiprice (6) - 1 freq katrine (6) - 3 freq beatrice (7) - 430 freq trice (7) - 1 freq price (7) - 179 freq motrice (7) - 1 freq pierce (7) - 4 freq katrina (7) - 1 freq tailrace (7) - 1 freq thrice (7) - 9 freq meteoric (7) - 1 freq terrace (7) - 24 freq patience (7) - 46 freq tatterie (7) - 1 freq 'katherine (7) - 1 freq natterie (7) - 1 freq misskatieprice (7) - 2 freq catherine (7) - 12 freq hauf-price (7) - 2 freq |
SoundEx code - K316 kittybrewster - 1 freq katieprice - 1 freq kateforbes - 2 freq kateforbesmsp - 1 freq kateferguson - 1 freq kdvfwrypz - 1 freq keithbrownsnp - 2 freq keithburgess - 5 freq |
MetaPhone code - KTPRS cut-price - 1 freq katieprice - 1 freq |
KATIEPRICE |
| Time to execute Levenshtein function - 0.216260 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.410937 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.028209 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.038219 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.000870 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. |