| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspirins (0) - 1 freq aspirin (1) - 3 freq aspiring (1) - 1 freq asprin (2) - 1 freq sperins (2) - 1 freq spirits (2) - 50 freq spirin (2) - 1 freq spierins (2) - 2 freq speirins (2) - 106 freq spires (3) - 2 freq aspirations (3) - 9 freq spcirin (3) - 1 freq spierin (3) - 23 freq spirals (3) - 2 freq shirin (3) - 2 freq spiking (3) - 9 freq swirin (3) - 1 freq spuins (3) - 1 freq sprints (3) - 4 freq sprint (3) - 8 freq spierin' (3) - 2 freq stirlins (3) - 1 freq asinine (3) - 2 freq osiris (3) - 1 freq 'spirit (3) - 1 freq |
aspirins (0) - 1 freq speirins (2) - 106 freq sperins (2) - 1 freq spierins (2) - 2 freq aspiring (2) - 1 freq aspirin (2) - 3 freq spurns (3) - 1 freq sprains (3) - 1 freq spirin (3) - 1 freq asprin (3) - 1 freq aspereens (3) - 1 freq spirits (3) - 50 freq speirits (4) - 10 freq spewins (4) - 2 freq aaprons (4) - 1 freq spiering (4) - 1 freq sparing (4) - 2 freq speirins- (4) - 1 freq sprigs (4) - 1 freq spring (4) - 263 freq sperrins (4) - 1 freq springs (4) - 34 freq spins (4) - 10 freq parins (4) - 3 freq spirks (4) - 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 - ASPRNS aspirins - 1 freq aspereens - 1 freq |
ASPIRINS |
| Time to execute Levenshtein function - 0.228232 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.361434 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.028083 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.037212 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.000895 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. |