| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iainpope (0) - 6 freq iaince (3) - 1 freq drainpipe (3) - 2 freq wanhope (3) - 1 freq oanyone (4) - 1 freq beanpole (4) - 1 freq aine (4) - 4 freq apone (4) - 3 freq ainhie (4) - 1 freq rinpoche (4) - 8 freq tinpot (4) - 3 freq aipple (4) - 102 freq nope (4) - 18 freq painrife (4) - 1 freq philope (4) - 2 freq hailsome (4) - 3 freq ainslie (4) - 6 freq tadpole (4) - 5 freq haunsome (4) - 2 freq iancoll (4) - 1 freq pope (4) - 26 freq ainlie (4) - 138 freq ainee (4) - 1 freq fairport (4) - 1 freq capone (4) - 1 freq |
iainpope (0) - 6 freq napp (5) - 2 freq paipe (5) - 1 freq nope (5) - 18 freq nippy (5) - 29 freq nippie (5) - 6 freq nappy (5) - 15 freq nappie (5) - 1 freq haippy (5) - 2 freq pope (5) - 26 freq iaince (5) - 1 freq wanhope (5) - 1 freq drainpipe (5) - 2 freq nipple (6) - 3 freq untape (6) - 1 freq bappie (6) - 1 freq app (6) - 46 freq pop (6) - 82 freq nipped (6) - 22 freq rapp (6) - 1 freq nops (6) - 1 freq inept (6) - 1 freq inpic (6) - 1 freq canopie (6) - 1 freq ppe (6) - 3 freq |
SoundEx code - I511 infeft - 2 freq invioved - 1 freq infoboxes - 3 freq infobox - 1 freq imbibe - 1 freq immoveable - 1 freq infeftments - 1 freq ionafyfe - 94 freq infobears - 1 freq impoverished - 1 freq iainpope - 6 freq |
MetaPhone code - INPP iainpope - 6 freq |
IAINPOPE |
| Time to execute Levenshtein function - 0.209590 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.384069 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.028755 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.042537 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.001004 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. |