| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspire (0) - 4 freq aspiret (1) - 1 freq spire (1) - 5 freq vampire (2) - 14 freq spine (2) - 28 freq spike (2) - 23 freq inspire (2) - 24 freq saire (2) - 4 freq attire (2) - 12 freq astir (2) - 1 freq aspirin (2) - 3 freq amyire (2) - 1 freq expire (2) - 2 freq apsire (2) - 1 freq assie (2) - 1 freq asper- (2) - 1 freq ashore (2) - 35 freq swire (2) - 1 freq assure (2) - 21 freq aire (2) - 61 freq impire (2) - 2 freq sire (2) - 8 freq empire (2) - 82 freq spires (2) - 2 freq admire (2) - 32 freq |
aspire (0) - 4 freq spire (1) - 5 freq spare (2) - 100 freq aspar (2) - 1 freq aspiret (2) - 1 freq spirk (3) - 3 freq spirl (3) - 4 freq pire (3) - 1 freq asure (3) - 1 freq suire (3) - 2 freq spie (3) - 3 freq astaire (3) - 1 freq spile (3) - 11 freq apirie (3) - 1 freq spair (3) - 1 freq osprey (3) - 2 freq spur (3) - 5 freq spar (3) - 14 freq spree (3) - 12 freq sper (3) - 1 freq spice (3) - 25 freq shire (3) - 26 freq spite (3) - 73 freq spry (3) - 3 freq aspirate (3) - 1 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 - ASPR aspar - 1 freq aspire - 4 freq asper- - 1 freq |
ASPIRE |
| Time to execute Levenshtein function - 0.199077 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.351501 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.027131 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.037401 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.000899 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. |