| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adhesive (0) - 1 freq cohesive (2) - 9 freq adoptive (3) - 1 freq aesie (3) - 3 freq adeline (3) - 2 freq deive (3) - 1 freq dhrive (3) - 4 freq acteive (3) - 1 freq dreive (3) - 4 freq aleive (3) - 1 freq desire (3) - 52 freq additive (3) - 3 freq deeside (3) - 14 freq dhese (3) - 1 freq derive (3) - 2 freq adhere (3) - 7 freq adjective (3) - 13 freq desine (3) - 1 freq abusive (3) - 8 freq resile (4) - 1 freq these (4) - 1129 freq donsie (4) - 2 freq aisie (4) - 11 freq baeside (4) - 1 freq a'hve (4) - 1 freq |
adhesive (0) - 1 freq cohesive (3) - 9 freq dhese (4) - 1 freq dhrive (4) - 4 freq desine (5) - 1 freq adhere (5) - 7 freq derive (5) - 2 freq abusive (5) - 8 freq dhose (5) - 1 freq devisive (5) - 2 freq mahoosive (5) - 2 freq divisive (5) - 7 freq decisive (5) - 3 freq dhriv (5) - 5 freq adoptive (5) - 1 freq deeside (5) - 14 freq deive (5) - 1 freq dreive (5) - 4 freq additive (5) - 3 freq desire (5) - 52 freq dhriven (6) - 3 freq heise (6) - 1 freq dese (6) - 6 freq desiree (6) - 1 freq cheise (6) - 1 freq |
SoundEx code - A321 aithsvoe - 1 freq adjf - 1 freq adhesive - 1 freq atouchofsense - 1 freq adzxfaymxx - 1 freq autzofamwl - 1 freq |
MetaPhone code - ATHSF adhesive - 1 freq |
ADHESIVE |
| Time to execute Levenshtein function - 0.209547 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.377047 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.027707 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.044438 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.001212 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. |