| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aipenin (0) - 5 freq apenin (1) - 10 freq appenin (1) - 3 freq ripenin (1) - 5 freq hidenin (2) - 1 freq pizenin (2) - 1 freq appenan (2) - 3 freq likenin (2) - 2 freq aipened (2) - 4 freq lippnin (2) - 2 freq apein (2) - 3 freq aipent (2) - 1 freq lippenin (2) - 29 freq widenin (2) - 9 freq openin (2) - 126 freq happenin (2) - 144 freq mienin (2) - 1 freq airnin (2) - 1 freq apenit (2) - 1 freq tipexin (2) - 1 freq aipen (2) - 16 freq aipen't (2) - 1 freq minenin (2) - 2 freq finenin (2) - 1 freq ainin (2) - 1 freq |
aipenin (0) - 5 freq apenin (1) - 10 freq ripenin (2) - 5 freq openin (2) - 126 freq appenin (2) - 3 freq aipen (3) - 16 freq apenit (3) - 1 freq airnin (3) - 1 freq oppenin (3) - 6 freq mienin (3) - 1 freq openan (3) - 4 freq peenin (3) - 3 freq penn (3) - 4 freq pynin (3) - 1 freq apinion (3) - 1 freq ainin (3) - 1 freq appenan (3) - 3 freq apein (3) - 3 freq pizenin (3) - 1 freq aipent (3) - 1 freq aipened (3) - 4 freq opeenian (4) - 1 freq punn (4) - 4 freq opening (4) - 18 freq upendin (4) - 1 freq |
SoundEx code - A155 apenin - 10 freq apinion - 1 freq appenin - 3 freq appenan - 3 freq abomination - 5 freq aipenin - 5 freq apen-mindit - 1 freq abomination's - 1 freq abominable - 1 freq apennines - 1 freq abomonation - 1 freq abuinmentionit - 1 freq |
MetaPhone code - APNN apenin - 10 freq apinion - 1 freq appenin - 3 freq appenan - 3 freq aipenin - 5 freq |
AIPENIN |
| Time to execute Levenshtein function - 0.204054 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.401315 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.027826 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.037668 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.001219 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. |