| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thoosands (0) - 53 freq thoosinds (1) - 1 freq thooosands (1) - 1 freq thoosand (1) - 115 freq thoosand's (1) - 1 freq thousands (1) - 17 freq thoosans (1) - 59 freq thoosan (2) - 114 freq thowsand (2) - 3 freq thoos'ns (2) - 1 freq 'thoosans (2) - 1 freq thousand (2) - 12 freq thousans (2) - 24 freq thooosunds (2) - 1 freq thoosant (2) - 4 freq thousants (2) - 2 freq thoonsans (2) - 1 freq thoosin's (2) - 2 freq thoosin (3) - 1 freq hoonds (3) - 1 freq thomson's (3) - 1 freq thousan (3) - 44 freq choosan (3) - 2 freq thoosint (3) - 2 freq thoosen (3) - 2 freq |
thoosands (0) - 53 freq thooosands (1) - 1 freq thousands (1) - 17 freq thoosinds (1) - 1 freq thooosunds (2) - 1 freq thoosand (2) - 115 freq thoosans (2) - 59 freq thoosand's (2) - 1 freq thousans (3) - 24 freq thousants (3) - 2 freq thousand (3) - 12 freq thoosin's (3) - 2 freq thoosan (4) - 114 freq 'thoosans (4) - 1 freq thowsand (4) - 3 freq thoonsans (4) - 1 freq thoos'ns (4) - 1 freq thoosant (4) - 4 freq thoosen (5) - 2 freq thousant (5) - 4 freq thousan (5) - 44 freq thoosint (5) - 2 freq hoonds (5) - 1 freq thoosin (5) - 1 freq thomson's (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 - 0SNTS thoosands - 53 freq thousands - 17 freq thoosand's - 1 freq thousants - 2 freq thooosunds - 1 freq thooosands - 1 freq thoosinds - 1 freq |
THOOSANDS |
| Time to execute Levenshtein function - 0.224921 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.387820 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.027172 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.037017 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.000852 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. |