| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appairel (0) - 1 freq appairent (2) - 1 freq appairt (2) - 5 freq appar (3) - 2 freq appeared (3) - 134 freq appalled (3) - 2 freq applies (3) - 17 freq sapphire (3) - 1 freq repaired (3) - 8 freq apparent (3) - 22 freq aspire (3) - 3 freq sapphires (3) - 2 freq apprise (3) - 1 freq astaire (3) - 1 freq paired (3) - 1 freq apairt' (3) - 1 freq aspiret (3) - 1 freq paircel (3) - 10 freq apsire (3) - 1 freq appeir (3) - 1 freq appairently (3) - 18 freq appraise (3) - 1 freq impaired (3) - 2 freq pairl (3) - 3 freq apairt (3) - 197 freq |
appairel (0) - 1 freq appairt (3) - 5 freq appeir (4) - 1 freq apprise (4) - 1 freq appraise (4) - 1 freq pairl (4) - 3 freq appar (4) - 2 freq appairent (4) - 1 freq appeared (4) - 134 freq appearan (5) - 2 freq applee (5) - 1 freq pearl (5) - 8 freq approval (5) - 13 freq appearin (5) - 22 freq appeal (5) - 37 freq appeart (5) - 80 freq sparl (5) - 1 freq aprile (5) - 36 freq petrel (5) - 3 freq appeirinly (5) - 1 freq pirl (5) - 7 freq appert (5) - 1 freq spiral (5) - 10 freq appears (5) - 82 freq appruval (5) - 1 freq |
SoundEx code - A164 aprile - 36 freq april - 117 freq aiverel - 1 freq april's - 2 freq aberlour - 5 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.610265 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 - 1.092494 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.076923 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.042568 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.000819 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. |