| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thoosant (0) - 4 freq thoosand (1) - 115 freq thoosan (1) - 114 freq thoosans (1) - 59 freq thousant (1) - 4 freq thoosint (1) - 2 freq thoosands (2) - 53 freq thousand (2) - 12 freq choosan (2) - 2 freq thoosen (2) - 2 freq thowsand (2) - 3 freq 'thoosans (2) - 1 freq thousan (2) - 44 freq thousants (2) - 2 freq thoonsans (2) - 1 freq thousans (2) - 24 freq thoos'ns (2) - 1 freq thoosin (2) - 1 freq thoosand's (3) - 1 freq thomson (3) - 26 freq thoomin (3) - 2 freq thoosinds (3) - 1 freq thoomit (3) - 1 freq thooosands (3) - 1 freq thoosin's (3) - 2 freq |
thoosant (0) - 4 freq thousant (1) - 4 freq thoosint (1) - 2 freq thoosand (2) - 115 freq thoosan (2) - 114 freq thoosans (2) - 59 freq thousans (3) - 24 freq thoosen (3) - 2 freq thoosin (3) - 1 freq thousand (3) - 12 freq thousan (3) - 44 freq thousants (3) - 2 freq pheasant (4) - 6 freq thoonsans (4) - 1 freq thoos'ns (4) - 1 freq 'thoosans (4) - 1 freq thoosands (4) - 53 freq choosan (4) - 2 freq thowsand (4) - 3 freq tossan (5) - 4 freq thoat (5) - 103 freq tooskit (5) - 1 freq toost (5) - 1 freq thooasa (5) - 1 freq tooslet (5) - 1 freq |
SoundEx code - T253 thoosand - 115 freq thoosands - 53 freq thousands - 17 freq thousand - 12 freq thoosand's - 1 freq thoosint - 2 freq thoosant - 4 freq thousant - 4 freq teachin'the - 1 freq t-century - 1 freq thousants - 2 freq thowsand - 3 freq tissue-matchin - 2 freq th-century - 16 freq tsimmit - 1 freq thoosan-telt - 1 freq thooosunds - 1 freq thooosands - 1 freq takemeout - 1 freq thoosinds - 1 freq thejamtarts - 1 freq tgshuntly - 1 freq |
MetaPhone code - 0SNT thoosand - 115 freq thousand - 12 freq thoosint - 2 freq thoosant - 4 freq thousant - 4 freq thowsand - 3 freq |
THOOSANT |
| Time to execute Levenshtein function - 0.231121 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.386523 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.028058 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.038855 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.001035 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. |