| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appenin (0) - 3 freq apenin (1) - 10 freq happenin (1) - 144 freq aipenin (1) - 5 freq oppenin (1) - 6 freq appenan (1) - 3 freq appeelin (2) - 1 freq appearin (2) - 23 freq appealin (2) - 6 freq peenin (2) - 3 freq lapperin (2) - 1 freq lippenin (2) - 29 freq apperit (2) - 3 freq apein (2) - 3 freq openin (2) - 126 freq appyntin (2) - 1 freq happenan (2) - 3 freq happenen (2) - 2 freq happening (2) - 25 freq appin (2) - 2 freq happnin (2) - 7 freq heppenin (2) - 1 freq appened (2) - 5 freq appendix (2) - 13 freq appent (2) - 7 freq |
appenin (0) - 3 freq oppenin (1) - 6 freq appenan (1) - 3 freq aipenin (2) - 5 freq happenin (2) - 144 freq apenin (2) - 10 freq applyin (3) - 5 freq appent (3) - 7 freq heppenin (3) - 1 freq ripenin (3) - 5 freq happnin (3) - 7 freq appened (3) - 5 freq appen (3) - 25 freq oppinen (3) - 1 freq oppeneen (3) - 1 freq appin (3) - 2 freq append (3) - 2 freq appense (3) - 1 freq appens (3) - 5 freq appeelin (3) - 1 freq peenin (3) - 3 freq appealin (3) - 6 freq appearin (3) - 23 freq openin (3) - 126 freq lippenin (3) - 29 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 |
APPENIN |
| Time to execute Levenshtein function - 0.189343 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.347728 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.028006 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.037424 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.000915 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. |