| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appairel (0) - 1 freq appairt (2) - 5 freq appairent (2) - 1 freq appairently (3) - 18 freq apairt (3) - 197 freq repaired (3) - 8 freq sapphire (3) - 1 freq applied (3) - 27 freq appraise (3) - 1 freq pairl (3) - 3 freq sapphires (3) - 2 freq apparent (3) - 23 freq applies (3) - 17 freq appeared (3) - 137 freq apprised (3) - 1 freq apairt' (3) - 1 freq appar (3) - 2 freq paired (3) - 1 freq apsire (3) - 1 freq apprise (3) - 2 freq aspire (3) - 4 freq appeir (3) - 1 freq appalled (3) - 2 freq impaired (3) - 2 freq paircel (3) - 11 freq |
appairel (0) - 1 freq appairt (3) - 5 freq appraise (4) - 1 freq appar (4) - 2 freq pairl (4) - 3 freq appeared (4) - 137 freq appairent (4) - 1 freq apprise (4) - 2 freq appeir (4) - 1 freq approval (5) - 14 freq appeart (5) - 80 freq april (5) - 117 freq appreive (5) - 1 freq appeal (5) - 37 freq petrel (5) - 3 freq appruive (5) - 2 freq paiper (5) - 7 freq appruval (5) - 1 freq appearit (5) - 5 freq pearl (5) - 8 freq appearin (5) - 23 freq appert (5) - 1 freq appear (5) - 98 freq apperit (5) - 3 freq apple (5) - 30 freq |
SoundEx code - A164 aprile - 36 freq april - 117 freq aiverel - 1 freq april's - 2 freq aberlour - 5 freq abril - 1 freq aprily - 2 freq appairel - 1 freq aiverie-like - 4 freq aff-warld - 13 freq a-birlin - 1 freq aberlemno - 1 freq aprill - 1 freq apryle - 2 freq averill - 1 freq averillb - 1 freq |
MetaPhone code - APRL aprile - 36 freq april - 117 freq aprily - 2 freq appairel - 1 freq aprill - 1 freq apryle - 2 freq |
APPAIREL |
| Time to execute Levenshtein function - 0.224764 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.396764 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.027327 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.040038 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.000910 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. |