| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithin (0) - 124 freq itchin (1) - 11 freq 'ithin (1) - 2 freq wthin (1) - 1 freq nithin (1) - 71 freq athin (1) - 226 freq within (1) - 185 freq thin (1) - 317 freq ithir (1) - 34 freq ishin (1) - 2 freq thid (2) - 1 freq thit (2) - 566 freq pishin (2) - 29 freq innin (2) - 34 freq awhin (2) - 1 freq wtin (2) - 1 freq tein (2) - 3 freq tithir (2) - 1 freq iin (2) - 2 freq pitin (2) - 1 freq tain (2) - 42 freq injin (2) - 33 freq thin' (2) - 1 freq rtin (2) - 1 freq thine (2) - 15 freq |
ithin (0) - 124 freq athin (1) - 226 freq thin (1) - 317 freq ythan (2) - 6 freq thyn (2) - 1 freq thn (2) - 1 freq then (2) - 4451 freq thein (2) - 23 freq thon (2) - 2518 freq than (2) - 2715 freq thun (2) - 2 freq ethan (2) - 1 freq aathin (2) - 203 freq athein (2) - 1 freq thine (2) - 15 freq nithin (2) - 71 freq within (2) - 185 freq ithir (2) - 34 freq ishin (2) - 2 freq wthin (2) - 1 freq thain (2) - 6 freq itchin (2) - 11 freq 'ithin (2) - 2 freq thig (3) - 3 freq ithe (3) - 14 freq |
SoundEx code - I350 iodine - 4 freq itn - 2 freq 'ithin - 2 freq item - 17 freq itan - 1 freq idiom - 9 freq ithin - 124 freq i'time - 22 freq i'toon - 8 freq i'don - 1 freq i'ythan - 1 freq idunn - 1 freq €˜ithin - 3 freq iden - 2 freq Èideann - 1 freq |
MetaPhone code - I0N 'ithin - 2 freq ithin - 124 freq i'ythan - 1 freq €˜ithin - 3 freq |
ITHIN |
| Time to execute Levenshtein function - 0.185865 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.343837 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.027010 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.036506 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.000790 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. |