| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspar (0) - 1 freq appar (1) - 2 freq spar (1) - 14 freq caspar (1) - 1 freq awar (2) - 4 freq akpap (2) - 2 freq papar (2) - 2 freq ashaor (2) - 1 freq asda (2) - 31 freq asma (2) - 1 freq spa (2) - 6 freq sper (2) - 1 freq spars (2) - 6 freq askan (2) - 10 freq astarn (2) - 1 freq star (2) - 255 freq awaar (2) - 20 freq spark (2) - 35 freq spam (2) - 8 freq spad (2) - 2 freq spaz (2) - 3 freq siar (2) - 1 freq ashak (2) - 1 freq aar (2) - 5 freq aspire (2) - 3 freq |
aspar (0) - 1 freq spar (1) - 14 freq spur (2) - 5 freq spair (2) - 1 freq sper (2) - 1 freq aspire (2) - 3 freq spear (2) - 27 freq spare (2) - 98 freq appar (2) - 2 freq caspar (2) - 1 freq spat (3) - 52 freq astir (3) - 1 freq spae (3) - 5 freq aspd (3) - 1 freq sear (3) - 1 freq scar (3) - 16 freq spak (3) - 307 freq sparl (3) - 1 freq oscar (3) - 6 freq rasper (3) - 1 freq shar (3) - 6 freq soar (3) - 10 freq pypar (3) - 1 freq cupar (3) - 5 freq spry (3) - 3 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 aspirated - 1 freq aspirations - 9 freq a-spoartin - 1 freq aspirin - 3 freq aspire - 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 - 3 freq asper- - 1 freq |
ASPAR |
| Time to execute Levenshtein function - 0.397747 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.615107 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.056936 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.038218 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.000784 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. |