| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aprile (0) - 36 freq aprill (1) - 1 freq prile (1) - 3 freq april (1) - 117 freq apryle (1) - 2 freq aprily (1) - 2 freq arite (2) - 7 freq arrive (2) - 51 freq apprise (2) - 1 freq pride (2) - 167 freq aple (2) - 2 freq arise (2) - 10 freq apple (2) - 32 freq apsire (2) - 1 freq spile (2) - 11 freq april's (2) - 2 freq price (2) - 177 freq prize (2) - 83 freq airie (2) - 1 freq rile (2) - 3 freq epril (2) - 1 freq prise (2) - 3 freq anbile (2) - 1 freq arrige (2) - 1 freq awrite (2) - 36 freq |
aprile (0) - 36 freq aprily (1) - 2 freq apryle (1) - 2 freq prile (1) - 3 freq april (1) - 117 freq epril (2) - 1 freq proile (2) - 1 freq aprill (2) - 1 freq puerile (3) - 1 freq prise (3) - 3 freq pile (3) - 110 freq rile (3) - 3 freq prie (3) - 4 freq prize (3) - 83 freq apirie (3) - 1 freq proil (3) - 1 freq peril (3) - 7 freq prime (3) - 36 freq apple (3) - 32 freq aple (3) - 2 freq pride (3) - 167 freq parle (3) - 1 freq price (3) - 177 freq paidle (4) - 1 freq pairl (4) - 3 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 |
APRILE |
| Time to execute Levenshtein function - 0.190640 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.332637 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.027840 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.041510 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.000804 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. |