| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appunct (0) - 1 freq appynt (2) - 4 freq appent (2) - 7 freq appeart (3) - 80 freq appeert (3) - 2 freq abduct (3) - 1 freq appened (3) - 5 freq aunt (3) - 75 freq apun (3) - 2 freq appin (3) - 2 freq oppint (3) - 2 freq amount (3) - 48 freq apperit (3) - 3 freq alunt (3) - 1 freq auct (3) - 1 freq appenin (3) - 3 freq happent (3) - 194 freq appairt (3) - 5 freq apent (3) - 29 freq annuncit (3) - 1 freq uppance (3) - 1 freq happen't (3) - 2 freq approch (3) - 1 freq sprunt (3) - 1 freq happin't (3) - 1 freq |
appunct (0) - 1 freq appent (3) - 7 freq appynt (3) - 4 freq appyntit (4) - 15 freq uppance (4) - 1 freq appoint (4) - 2 freq oppint (4) - 2 freq appintit (4) - 1 freq happence (5) - 1 freq appenan (5) - 3 freq apen't (5) - 3 freq appointit (5) - 4 freq aspect (5) - 21 freq plunkt (5) - 1 freq applyit (5) - 1 freq aipen't (5) - 1 freq apenit (5) - 1 freq appt (5) - 1 freq happint (5) - 15 freq punch (5) - 47 freq punt (5) - 9 freq appens (5) - 5 freq prauncit (5) - 1 freq uppercut (5) - 1 freq appert (5) - 1 freq |
SoundEx code - A152 apens - 7 freq abeyance - 1 freq avenge - 11 freq avenues - 5 freq affeomes - 1 freq appens - 5 freq apenness - 2 freq affens - 8 freq avengit - 2 freq avenged - 3 freq avengin - 1 freq avenger - 1 freq abins - 1 freq aff-fawins - 2 freq avengers - 2 freq appunct - 1 freq appense - 1 freq afens - 2 freq appen-access - 1 freq |
MetaPhone code - APNKT appunct - 1 freq |
APPUNCT |
| Time to execute Levenshtein function - 0.174783 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.397929 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.030112 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.041218 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.000809 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. |