| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appetite (0) - 19 freq appetites (1) - 2 freq eppatite (2) - 1 freq petite (2) - 1 freq apperit (2) - 3 freq applyit (3) - 1 freq appeir (3) - 1 freq appent (3) - 7 freq opposite (3) - 89 freq oapposite (3) - 1 freq apenit (3) - 1 freq appeart (3) - 80 freq appeert (3) - 2 freq happenit (3) - 12 freq appense (3) - 1 freq repetit (3) - 1 freq appruive (3) - 2 freq apprentice (3) - 22 freq appiteits (3) - 1 freq oappasite (3) - 1 freq appellit (3) - 1 freq paetie (3) - 2 freq peetie (3) - 24 freq appyntit (3) - 15 freq aplentie (3) - 2 freq |
appetite (0) - 19 freq eppatite (2) - 1 freq appetites (2) - 2 freq apperit (3) - 3 freq petite (3) - 1 freq appert (4) - 1 freq appintit (4) - 1 freq repetit (4) - 1 freq appyntit (4) - 15 freq appeert (4) - 2 freq oappasite (4) - 1 freq appiteits (4) - 1 freq appearit (4) - 5 freq appent (4) - 7 freq applyit (4) - 1 freq opposite (4) - 89 freq oapposite (4) - 1 freq petit (4) - 1 freq appeart (4) - 80 freq poutit (5) - 1 freq pattie (5) - 2 freq adaptit (5) - 6 freq pettie (5) - 1 freq appt (5) - 1 freq appointit (5) - 4 freq |
SoundEx code - A133 appetite - 19 freq abided - 1 freq avoidit - 8 freq avoided - 6 freq appetites - 2 freq avoidet - 1 freq apathetic - 1 freq apdatin - 2 freq aabody'd - 1 freq appiteits - 1 freq aptitudes - 1 freq abated - 1 freq afftaethecludgie - 1 freq |
MetaPhone code - APTT appetite - 19 freq |
APPETITE |
| Time to execute Levenshtein function - 0.428694 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.712235 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.057645 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.078849 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.000974 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. |