| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithoot (0) - 53 freq athoot (1) - 319 freq 'ithoot (1) - 1 freq ithout (1) - 11 freq withoot (1) - 405 freq thout (2) - 2 freq idoot (2) - 1 freq thot (2) - 21 freq thaot (2) - 1 freq 'withoot (2) - 1 freq pit-oot (2) - 5 freq athout (2) - 27 freq thoor (2) - 11 freq troot (2) - 55 freq €™ithoot (2) - 6 freq thoom (2) - 12 freq stoot (2) - 44 freq aathoot (2) - 1 freq shoot (2) - 70 freq with-oot (2) - 1 freq thool (2) - 2 freq athott (2) - 1 freq thoo (2) - 277 freq thoat (2) - 103 freq athort (2) - 122 freq |
ithoot (0) - 53 freq athoot (1) - 319 freq ithout (1) - 11 freq athout (2) - 27 freq thoat (2) - 103 freq thaot (2) - 1 freq thot (2) - 21 freq withoot (2) - 405 freq 'ithoot (2) - 1 freq aathoot (2) - 1 freq thout (2) - 2 freq thoct (3) - 7 freq a'thoot (3) - 1 freq thowt (3) - 97 freq throt (3) - 3 freq tholt (3) - 1 freq ahoot (3) - 1 freq thooht (3) - 1 freq toot (3) - 33 freq toht (3) - 1 freq theat (3) - 1 freq theit (3) - 2 freq thait (3) - 3 freq thet (3) - 9 freq that (3) - 26604 freq |
SoundEx code - I330 ithout - 11 freq idiot - 21 freq ithoot - 53 freq idoot - 1 freq itida - 1 freq €˜ithoot - 3 freq 'ithoot - 1 freq €™ithoot - 6 freq €˜idiot - 1 freq €œidiot - 1 freq idot - 1 freq itet - 1 freq |
MetaPhone code - I0T ithout - 11 freq ithoot - 53 freq €˜ithoot - 3 freq 'ithoot - 1 freq €™ithoot - 6 freq |
ITHOOT |
| Time to execute Levenshtein function - 0.184824 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.336277 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.027435 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.042613 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.000827 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. |