Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tholein (0) - 2 freq tholin (1) - 34 freq tholepin (1) - 1 freq trollin (2) - 1 freq thein (2) - 23 freq thoosin (2) - 1 freq therein (2) - 3 freq holdin (2) - 18 freq holin (2) - 2 freq tholit (2) - 4 freq tholes (2) - 17 freq tharein (2) - 1 freq showein (2) - 6 freq tholed (2) - 45 freq toolin (2) - 1 freq thole (2) - 285 freq howein (2) - 1 freq tholins (2) - 1 freq hopein (2) - 1 freq thoomin (2) - 2 freq hollin (2) - 1 freq hoddin (3) - 3 freq hiein (3) - 1 freq helen (3) - 46 freq howfin (3) - 5 freq |
tholein (0) - 2 freq tholin (1) - 34 freq tholepin (2) - 1 freq thole (3) - 285 freq toolin (3) - 1 freq tholed (3) - 45 freq thoomin (3) - 2 freq athelin (3) - 1 freq tholes (3) - 17 freq tholins (3) - 1 freq tharein (3) - 1 freq therein (3) - 3 freq thein (3) - 23 freq holin (3) - 2 freq thoosin (3) - 1 freq tholit (3) - 4 freq thule (4) - 5 freq tinlin (4) - 1 freq houlin (4) - 21 freq thoarn (4) - 11 freq thakin (4) - 1 freq tailin (4) - 1 freq thievin (4) - 16 freq then (4) - 4451 freq tellin (4) - 603 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 |
THOLEIN |
Time to execute Levenshtein function - 0.202312 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.372479 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.030129 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.043120 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.000847 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. |