| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tholin (0) - 34 freq toolin (1) - 1 freq holin (1) - 2 freq tholins (1) - 1 freq tholein (1) - 2 freq tholit (1) - 4 freq tholes (2) - 17 freq chowin (2) - 16 freq thon (2) - 2518 freq throwin (2) - 31 freq showin (2) - 75 freq tholed (2) - 45 freq houlin (2) - 21 freq thin (2) - 317 freq tootin (2) - 2 freq tumlin (2) - 1 freq whilin (2) - 1 freq tinlin (2) - 1 freq throbin (2) - 1 freq toyin (2) - 2 freq thoan (2) - 1 freq tailin (2) - 1 freq tovin (2) - 8 freq honin (2) - 2 freq trollin (2) - 1 freq |
tholin (0) - 34 freq tholein (1) - 2 freq tholit (2) - 4 freq athelin (2) - 1 freq tholins (2) - 1 freq toolin (2) - 1 freq holin (2) - 2 freq thein (3) - 23 freq toilin (3) - 2 freq tellin (3) - 603 freq tholyd (3) - 1 freq thawin (3) - 2 freq thirlin (3) - 7 freq tholepin (3) - 1 freq thoomin (3) - 2 freq tholt (3) - 1 freq thakin (3) - 1 freq hoolin (3) - 6 freq shilin (3) - 1 freq thrain (3) - 1 freq thoosin (3) - 1 freq halin (3) - 1 freq tirlin (3) - 13 freq tillin (3) - 3 freq thoarn (3) - 11 freq |
SoundEx code - T450 tellin - 603 freq tholin - 34 freq toilin - 2 freq toilan - 1 freq tillin - 3 freq tellen - 3 freq tellin' - 5 freq tail-en - 2 freq tail-an - 1 freq taelem - 1 freq tellan - 13 freq telleen - 1 freq til'm - 2 freq tweelin - 2 freq tholein - 2 freq toulon - 1 freq talamh - 1 freq tailen - 1 freq tulyiein - 1 freq tailin - 1 freq telllin - 1 freq tuilyein - 1 freq €˜taliani - 1 freq toolin - 1 freq towellin - 1 freq ‘tholianÂ’ - 1 freq tellem - 1 freq tail-eyne - 1 freq tellinÂ’ - 1 freq |
MetaPhone code - 0LN tholin - 34 freq tholein - 2 freq ‘tholian’ - 1 freq |
THOLIN |
| Time to execute Levenshtein function - 0.165485 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.319909 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.027290 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.036976 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. |