Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
peityin-like (0) - 1 freq ettlin-like (3) - 1 freq tentie-like (4) - 1 freq gentie-like (4) - 10 freq pensie-like (4) - 1 freq weeyin-life (4) - 1 freq heistie-like (4) - 1 freq primsie-like (4) - 1 freq dentie-like (4) - 1 freq paisley-like (5) - 1 freq gentrie-lik (5) - 1 freq neibour-like (5) - 1 freq certainlie (5) - 2 freq pensie-lik (5) - 1 freq leddy-like (5) - 1 freq electric-like (5) - 1 freq peacefu-like (5) - 1 freq tentie-lik (5) - 2 freq roit-like (5) - 1 freq naitral-like (5) - 1 freq gentil-lik (5) - 1 freq diarie-like (5) - 1 freq peityin (5) - 1 freq thing-like (5) - 1 freq delytit-like (5) - 1 freq |
peityin-like (0) - 1 freq ettlin-like (5) - 1 freq pensie-like (6) - 1 freq taen-like (6) - 3 freq tentie-like (6) - 1 freq couthie-like (7) - 2 freq tent-like (7) - 1 freq wean-like (7) - 1 freq kin-like (7) - 1 freq gutsie-like (7) - 1 freq cuttie-like (7) - 1 freq repreein-like (7) - 1 freq taen-lik (7) - 1 freq puggie-like (7) - 1 freq roit-like (7) - 1 freq bairn-like (7) - 1 freq egyptian-like (7) - 1 freq question-like (7) - 1 freq dentie-like (7) - 1 freq paisley-like (7) - 1 freq pensie-lik (7) - 1 freq primsie-like (7) - 1 freq tentie-lik (7) - 2 freq gentie-like (7) - 10 freq weeyin-life (7) - 1 freq |
SoundEx code - P354 puddeenless - 1 freq peityin-like - 1 freq pptmlmaamz - 1 freq petemolyneux - 2 freq |
MetaPhone code - PTYNLK peityin-like - 1 freq |
PEITYIN-LIKE |
Time to execute Levenshtein function - 0.250260 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.426801 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.028484 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.038334 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.000906 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. |