| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twalmont (0) - 1 freq twalmonth (1) - 8 freq twalmond (1) - 5 freq twal-month (2) - 2 freq waltons (3) - 1 freq wament (3) - 1 freq tapmost (3) - 1 freq talent (3) - 65 freq twalt (3) - 2 freq salmon (3) - 46 freq almost (3) - 120 freq talons (3) - 5 freq belmont (3) - 6 freq walmart (3) - 1 freq twa-foot (3) - 1 freq waement (3) - 1 freq talbot (3) - 4 freq twalbore (3) - 1 freq twaloors (3) - 2 freq lamont (3) - 8 freq aalmost (3) - 1 freq salmond (3) - 24 freq almond (3) - 4 freq diamant (4) - 2 freq two-man (4) - 1 freq |
twalmont (0) - 1 freq twalmond (2) - 5 freq twalmonth (2) - 8 freq twal-month (4) - 2 freq belmont (5) - 6 freq walmart (5) - 1 freq lamont (5) - 8 freq waement (5) - 1 freq twalt (5) - 2 freq wament (5) - 1 freq talent (5) - 65 freq twaalt (6) - 1 freq tenement (6) - 21 freq willint (6) - 5 freq rolment (6) - 1 freq tormint (6) - 1 freq twaluggit (6) - 1 freq termint (6) - 2 freq twilight (6) - 9 freq walnut (6) - 11 freq towmond (6) - 12 freq traetment (6) - 2 freq twonty (6) - 1 freq ailmint (6) - 1 freq traitmint (6) - 1 freq |
SoundEx code - T455 twalmond - 5 freq twal-nuin - 1 freq twalmonth - 8 freq twal-month - 2 freq tullimentan - 4 freq twalmont - 1 freq toulmin- - 1 freq |
MetaPhone code - TWLMNT twalmond - 5 freq twalmont - 1 freq |
TWALMONT |
| Time to execute Levenshtein function - 0.202899 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.407038 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.028228 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.040232 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.001333 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. |