| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithin (0) - 124 freq nithin (1) - 71 freq ithir (1) - 35 freq within (1) - 189 freq wthin (1) - 1 freq thin (1) - 323 freq athin (1) - 226 freq ishin (1) - 2 freq 'ithin (1) - 2 freq itchin (1) - 11 freq imkin (2) - 1 freq pishin (2) - 32 freq ithirs (2) - 10 freq ethan (2) - 1 freq i'thing (2) - 4 freq birthin (2) - 7 freq thi (2) - 2576 freq atin (2) - 3 freq pithie (2) - 1 freq innin (2) - 34 freq 'this (2) - 73 freq aitin (2) - 21 freq ithrr (2) - 1 freq kithan (2) - 1 freq kitthin (2) - 1 freq |
ithin (0) - 124 freq thin (1) - 323 freq athin (1) - 226 freq thyn (2) - 1 freq thon (2) - 2542 freq ythan (2) - 6 freq thein (2) - 23 freq thine (2) - 15 freq aathin (2) - 203 freq thain (2) - 6 freq athein (2) - 1 freq thn (2) - 1 freq thun (2) - 2 freq than (2) - 2763 freq ishin (2) - 2 freq 'ithin (2) - 2 freq wthin (2) - 1 freq within (2) - 189 freq nithin (2) - 71 freq ithir (2) - 35 freq itchin (2) - 11 freq then (2) - 4541 freq ethan (2) - 1 freq achin (3) - 14 freq awthin (3) - 133 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.224235 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.394852 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.031947 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.037730 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.000931 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. |