| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tholance (0) - 1 freq tholerance (2) - 1 freq tholable (2) - 1 freq trublance (3) - 2 freq balance (3) - 53 freq bromance (3) - 1 freq challance (3) - 1 freq solace (3) - 16 freq hance (3) - 2 freq tholin (3) - 34 freq glance (3) - 47 freq romance (3) - 39 freq trounce (3) - 1 freq torrance (3) - 1 freq ballance (3) - 1 freq violence (3) - 37 freq 'horace (3) - 1 freq thence (3) - 1 freq hollande (3) - 1 freq troonce (3) - 1 freq chance (3) - 548 freq tholins (3) - 1 freq lance (3) - 5 freq blance (3) - 2 freq parlance (3) - 2 freq |
tholance (0) - 1 freq tholerance (3) - 1 freq tholin (4) - 34 freq thence (4) - 1 freq tholins (4) - 1 freq tholable (4) - 1 freq thoan (5) - 1 freq thane (5) - 3 freq seelance (5) - 1 freq parlance (5) - 2 freq blance (5) - 2 freq trance (5) - 10 freq th'ane (5) - 1 freq esh-lance (5) - 1 freq tholein (5) - 2 freq thailand (5) - 7 freq sehlince (5) - 1 freq thole (5) - 287 freq tolerance (5) - 7 freq tholeable (5) - 1 freq lance (5) - 5 freq sclance (5) - 1 freq thone (5) - 13 freq chance (5) - 548 freq torrance (5) - 1 freq |
SoundEx code - T452 telling - 79 freq tellins - 5 freq talons - 5 freq tilling - 1 freq tholins - 1 freq tullynagardy - 3 freq tholance - 1 freq toiling - 2 freq thelonious - 8 freq tellingly - 1 freq tellemstevedave - 3 freq |
MetaPhone code - 0LNS tholins - 1 freq tholance - 1 freq thelonious - 8 freq |
THOLANCE |
| Time to execute Levenshtein function - 0.250276 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.412615 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.027724 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.038540 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.000933 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. |