| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asprin (0) - 1 freq aspirin (1) - 3 freq astrid (2) - 82 freq aspiring (2) - 1 freq apron (2) - 24 freq spirin (2) - 1 freq spron (2) - 1 freq wastrin (2) - 1 freq spin (2) - 65 freq spring (2) - 263 freq adorin (2) - 1 freq aapron (2) - 1 freq airin (2) - 4 freq spuin (2) - 7 freq askin (2) - 183 freq apin (2) - 13 freq sprig (2) - 6 freq sprint (2) - 8 freq sirin (2) - 1 freq antrin (2) - 67 freq aspen (2) - 10 freq april (2) - 117 freq aswerin (2) - 1 freq spein (2) - 2 freq aspirins (2) - 1 freq |
asprin (0) - 1 freq aspirin (1) - 3 freq spron (2) - 1 freq spirin (2) - 1 freq spein (3) - 2 freq aspirins (3) - 1 freq aswerin (3) - 1 freq sirin (3) - 1 freq spain (3) - 55 freq aspen (3) - 10 freq sprit (3) - 2 freq spyin (3) - 10 freq astron (3) - 1 freq sprayin (3) - 12 freq sprint (3) - 8 freq speerin (3) - 9 freq spierin (3) - 23 freq spin (3) - 65 freq sprig (3) - 6 freq apron (3) - 24 freq aspiring (3) - 1 freq spearin (3) - 1 freq aapron (3) - 1 freq spring (3) - 263 freq spurn (3) - 2 freq |
SoundEx code - A216 a-quiver - 1 freq aspar - 1 freq aspirins - 1 freq aspereens - 1 freq aspiration - 4 freq aspersions - 1 freq agpression - 1 freq aspire - 4 freq aspirated - 1 freq aspirations - 9 freq a-spoartin - 1 freq aspirin - 3 freq achievers - 1 freq asperities - 1 freq asprin - 1 freq asper- - 1 freq asperger - 1 freq aspirational - 2 freq aspiret - 1 freq aspirate - 1 freq askboris - 1 freq aspiring - 1 freq azhpbr - 1 freq axfroq - 1 freq axcprzrjm - 1 freq |
MetaPhone code - ASPRN aspirin - 3 freq asprin - 1 freq |
ASPRIN |
| Time to execute Levenshtein function - 0.577525 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.923900 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.090143 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.090508 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.001063 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. |