Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hearer (0) - 1 freq heater (1) - 13 freq bearer (1) - 7 freq heared (1) - 14 freq header (1) - 2 freq healer (1) - 3 freq herer (1) - 1 freq nearer (1) - 72 freq dearer (1) - 8 freq shearer (1) - 4 freq heavier (2) - 10 freq heaney (2) - 4 freq weared (2) - 1 freq heer (2) - 19 freq leared (2) - 1 freq heave (2) - 13 freq hebrew (2) - 19 freq wearier (2) - 1 freq heaped (2) - 3 freq hearted (2) - 5 freq cheater (2) - 1 freq heres (2) - 8 freq hearts (2) - 32 freq harder (2) - 67 freq harr (2) - 2 freq |
hearer (0) - 1 freq herer (1) - 1 freq shearer (2) - 4 freq herr (2) - 9 freq hirer (2) - 2 freq harr (2) - 2 freq dearer (2) - 8 freq nearer (2) - 72 freq bearer (2) - 7 freq heater (2) - 13 freq heared (2) - 14 freq header (2) - 2 freq healer (2) - 3 freq farer (3) - 1 freq harem (3) - 1 freq herber (3) - 5 freq hearty (3) - 9 freq horrer (3) - 1 freq haver (3) - 6 freq hairier (3) - 2 freq harra (3) - 2 freq beirer (3) - 1 freq heiter (3) - 1 freq heirder (3) - 1 freq hearna (3) - 1 freq |
SoundEx code - H660 horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
MetaPhone code - HRR horror - 50 freq herer - 1 freq horrer - 1 freq hirer - 2 freq hairier - 2 freq hearer - 1 freq harrier - 2 freq horrur - 2 freq |
HEARER |
Time to execute Levenshtein function - 0.511707 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.918546 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.082811 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.111595 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.000882 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. |