Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ihe (0) - 2 freq che (1) - 7 freq ih (1) - 81 freq ive (1) - 11 freq ihre (1) - 1 freq ihy (1) - 1 freq ohe (1) - 1 freq ipe (1) - 1 freq ifhe (1) - 1 freq iht (1) - 1 freq ike (1) - 1 freq lhe (1) - 1 freq ide (1) - 3 freq ize (1) - 1 freq 'he (1) - 77 freq iye (1) - 10 freq iae (1) - 5 freq iho (1) - 1 freq ite (1) - 3 freq ire (1) - 9 freq ice (1) - 254 freq dhe (1) - 2 freq bhe (1) - 1 freq fhe (1) - 1 freq ithe (1) - 14 freq |
ihe (0) - 2 freq ohe (1) - 1 freq yhe (1) - 1 freq he (1) - 25273 freq ihy (1) - 1 freq iho (1) - 1 freq ih (1) - 81 freq hae (2) - 8019 freq oh (2) - 1175 freq eih (2) - 51 freq h (2) - 257 freq ieh (2) - 1 freq heu (2) - 1 freq hy (2) - 5 freq uha (2) - 2 freq hey (2) - 157 freq hu (2) - 2 freq aha (2) - 8 freq ahae (2) - 1 freq eh (2) - 1127 freq uh (2) - 8 freq hoe (2) - 2 freq ah (2) - 16973 freq hie (2) - 113 freq hee (2) - 289 freq |
SoundEx code - I000 i - 18446 freq 'i - 531 freq ii - 69 freq ih' - 1 freq iii - 31 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 - 191 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 - IH ihe - 2 freq iho - 1 freq |
IHE |
Time to execute Levenshtein function - 0.295409 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.485501 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.034749 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.071784 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.000918 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. |