| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| addisence (0) - 1 freq audience (2) - 94 freq aadience (2) - 5 freq addison's (3) - 12 freq audiences (3) - 13 freq audiance (3) - 1 freq absence (3) - 20 freq accidence (3) - 1 freq owdience (3) - 10 freq adherence (3) - 3 freq audiscense (3) - 1 freq ambience (3) - 4 freq adrienne (3) - 1 freq avidence (3) - 2 freq addison (3) - 31 freq praisence (3) - 10 freq extistence (4) - 1 freq eveidence (4) - 1 freq insistence (4) - 7 freq lishence (4) - 1 freq diligence (4) - 1 freq advisable (4) - 4 freq €˜disnae (4) - 1 freq aliene (4) - 2 freq arisen (4) - 4 freq |
addisence (0) - 1 freq audience (4) - 94 freq aadience (4) - 5 freq addison (4) - 31 freq avidence (5) - 2 freq adherence (5) - 3 freq praisence (5) - 10 freq owdience (5) - 10 freq absence (5) - 20 freq audiance (5) - 1 freq addison's (5) - 12 freq daesency (5) - 1 freq advance (6) - 30 freq ordinance (6) - 2 freq daince (6) - 1 freq daicency (6) - 1 freq defence (6) - 46 freq eevidence (6) - 1 freq disnae (6) - 586 freq evidence (6) - 151 freq distince (6) - 1 freq indolence (6) - 1 freq advisin (6) - 3 freq sence (6) - 1 freq nonsence (6) - 1 freq |
SoundEx code - A325 addison - 31 freq addison's - 12 freq attackin' - 1 freq attachment - 3 freq aidgin - 1 freq attackin - 8 freq aitken - 32 freq adjoinin - 2 freq ati'sunbems - 1 freq aitken's - 4 freq addisence - 1 freq audiscense - 1 freq autism - 3 freq aitkin - 1 freq atakan - 1 freq attacking - 4 freq aitkenÂ’s - 1 freq aodsmegh - 1 freq aitkins - 1 freq aitkens - 1 freq adgmbfhvox - 1 freq addishanel - 1 freq atkinson - 1 freq |
MetaPhone code - ATSNS addison's - 12 freq addisence - 1 freq audiscense - 1 freq |
ADDISENCE |
| Time to execute Levenshtein function - 0.222465 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.426589 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.027182 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.037075 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.000881 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. |