| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adorable (0) - 8 freq arable (2) - 8 freq parable (3) - 54 freq 'notable (3) - 1 freq oracle (3) - 5 freq adappable (3) - 1 freq favourable (3) - 1 freq disable (3) - 1 freq dooble (3) - 26 freq vocable (3) - 1 freq amiable (3) - 1 freq bearable (3) - 5 freq notable (3) - 5 freq workable (3) - 3 freq adobe (3) - 2 freq tholable (3) - 1 freq probable (3) - 4 freq double (3) - 126 freq deeable (3) - 1 freq amoral (3) - 1 freq memorable (3) - 10 freq gorble (3) - 2 freq portable (3) - 9 freq advisable (3) - 4 freq chorale (3) - 1 freq |
adorable (0) - 8 freq arable (3) - 8 freq bearable (4) - 5 freq deeable (4) - 1 freq gorble (4) - 2 freq dooble (4) - 26 freq dreeble (4) - 1 freq double (4) - 126 freq parable (4) - 54 freq disable (4) - 1 freq draigle (5) - 1 freq drebble (5) - 1 freq dubble (5) - 2 freq derbie (5) - 2 freq greeable (5) - 4 freq drawl (5) - 4 freq dorsal (5) - 1 freq gorblie (5) - 2 freq dabble (5) - 2 freq audible (5) - 2 freq dibble (5) - 1 freq dribble (5) - 3 freq mairble (5) - 4 freq proably (5) - 1 freq agreeable (5) - 3 freq |
SoundEx code - A361 adrift - 9 freq atrophy - 1 freq adorable - 8 freq attributes - 5 freq ati'rubbir - 1 freq attributive - 2 freq attributively - 1 freq attributit - 7 freq attributed - 1 freq attribution - 1 freq authorpetermay - 2 freq atarbuck - 1 freq |
MetaPhone code - ATRBL adorable - 8 freq |
ADORABLE |
| Time to execute Levenshtein function - 0.174537 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.369820 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.031350 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.039225 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.000842 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. |