| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| audible (0) - 4 freq audibly (1) - 1 freq edible (2) - 3 freq aible (2) - 2 freq ansible (2) - 2 freq inaudible (2) - 2 freq aedie (3) - 1 freq tangible (3) - 4 freq gaudie (3) - 1 freq laudably (3) - 1 freq amble (3) - 3 freq uile (3) - 2 freq fumble (3) - 1 freq mumble (3) - 3 freq aprile (3) - 36 freq nuisle (3) - 1 freq abdie (3) - 1 freq humble (3) - 27 freq faisible (3) - 3 freq quhile (3) - 5 freq anbile (3) - 1 freq rumble (3) - 9 freq adige (3) - 1 freq lucille (3) - 2 freq agile (3) - 2 freq |
audible (0) - 4 freq audibly (1) - 1 freq edible (2) - 3 freq aible (3) - 2 freq inaudible (3) - 2 freq able (4) - 436 freq dibble (4) - 1 freq inaudibly (4) - 1 freq buile (4) - 1 freq dubble (4) - 2 freq bauble (4) - 5 freq ible (4) - 1 freq double (4) - 129 freq dwaible (4) - 2 freq adobe (4) - 2 freq arable (4) - 8 freq dooble (4) - 26 freq deeable (4) - 1 freq adele (4) - 1 freq bible (4) - 95 freq unable (4) - 19 freq amiable (4) - 1 freq taible (4) - 2 freq aidle (4) - 1 freq daudle (4) - 1 freq |
SoundEx code - A314 audible - 4 freq audibly - 1 freq autopilot - 1 freq |
MetaPhone code - ATBL audible - 4 freq audibly - 1 freq |
AUDIBLE |
| Time to execute Levenshtein function - 0.199019 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.339525 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.027292 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.037542 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. |