| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thousand (0) - 12 freq thousands (1) - 17 freq thoosand (1) - 115 freq thousant (1) - 4 freq thousans (1) - 24 freq thousan (1) - 44 freq thowsand (1) - 3 freq thoosands (2) - 53 freq thousants (2) - 2 freq thoosan (2) - 114 freq thoosant (2) - 4 freq thoosans (2) - 59 freq houane (3) - 5 freq tossan (3) - 4 freq thomsonx (3) - 1 freq thoosinds (3) - 1 freq thoosen (3) - 2 freq husband (3) - 75 freq troussed (3) - 1 freq thomson' (3) - 1 freq shoutan (3) - 5 freq thoosand's (3) - 1 freq holland (3) - 16 freq thooosands (3) - 1 freq choosan (3) - 2 freq |
thousand (0) - 12 freq thoosand (1) - 115 freq thowsand (2) - 3 freq thousan (2) - 44 freq thousans (2) - 24 freq thousands (2) - 17 freq thousant (2) - 4 freq thoosans (3) - 59 freq thoosan (3) - 114 freq thoosant (3) - 4 freq thoosands (3) - 53 freq thoosint (4) - 2 freq thailand (4) - 7 freq thooosands (4) - 1 freq thoosen (4) - 2 freq thoosinds (4) - 1 freq thousants (4) - 2 freq thoosin (4) - 1 freq thoos'ns (5) - 1 freq housed (5) - 1 freq tousled (5) - 1 freq thusday (5) - 1 freq this'd (5) - 1 freq thooosunds (5) - 1 freq housing (5) - 4 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 |
THOUSAND |
| Time to execute Levenshtein function - 0.217975 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.384738 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.027387 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.037583 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.000820 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. |