| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iye (0) - 10 freq iys (1) - 2 freq kye (1) - 140 freq ike (1) - 3 freq ime (1) - 1 freq aye (1) - 6435 freq ide (1) - 3 freq iya (1) - 1 freq bye (1) - 115 freq 'ye (1) - 198 freq ire (1) - 9 freq ise (1) - 2 freq ie (1) - 40 freq pye (1) - 52 freq ive (1) - 11 freq ye (1) - 20880 freq ipe (1) - 1 freq iyq (1) - 1 freq ice (1) - 254 freq wiye (1) - 2 freq rye (1) - 5 freq yye (1) - 2 freq oye (1) - 1 freq ile (1) - 65 freq ifye (1) - 1 freq |
iye (0) - 10 freq oye (1) - 1 freq ye (1) - 20880 freq eye (1) - 237 freq iy (1) - 3 freq iae (1) - 5 freq ie (1) - 40 freq yye (1) - 2 freq aye (1) - 6435 freq iya (1) - 1 freq oy (2) - 5 freq ia (2) - 5 freq yy (2) - 1 freq yae (2) - 1059 freq yoe (2) - 4 freq io (2) - 7 freq i (2) - 18870 freq y (2) - 155 freq yee (2) - 19 freq yue (2) - 1 freq ay (2) - 2481 freq yo (2) - 15 freq ya (2) - 481 freq uy (2) - 4 freq yey (2) - 2 freq |
SoundEx code - I000 i - 18870 freq 'i - 538 freq ii - 73 freq ih' - 1 freq iii - 34 freq i' - 347 freq ioo - 1 freq ihe - 2 freq -i - 1 freq i- - 1 freq -'i - 1 freq io - 7 freq iae - 5 freq i'we - 1 freq ie - 40 freq iho - 1 freq ih - 81 freq iwa - 3 freq «i - 1 freq ia - 5 freq i¢ - 1 freq iowa - 3 freq i-a - 1 freq éi - 1 freq 'ie - 1 freq iwo - 1 freq 'i' - 3 freq i'wee - 1 freq i'wa - 1 freq i'wie - 10 freq i'waa - 1 freq iy - 3 freq i - 1 freq -ie - 8 freq þið - 1 freq i - 99 freq i - 193 freq iye - 10 freq i - 1 freq i - 1 freq i - 1 freq i - 12 freq i - 1 freq i - 6 freq i - 1 freq iya - 1 freq i - 1 freq i - 1 freq ihy - 1 freq ieh - 1 freq iaw - 1 freq iu - 2 freq iio - 1 freq iyuyh - 1 freq iw - 2 freq |
MetaPhone code - IY iye - 10 freq iya - 1 freq iyuyh - 1 freq |
IYE |
| Time to execute Levenshtein function - 0.196848 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.317080 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.028572 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.038282 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.000975 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. |