| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunlit (0) - 1 freq haunlin (1) - 5 freq haunit (1) - 2 freq haundit (1) - 63 freq haulit (1) - 3 freq haunlet (1) - 2 freq haunnit (1) - 2 freq hauntit (1) - 15 freq hannlin (2) - 26 freq hauntet (2) - 2 freq wanlit (2) - 4 freq haunle (2) - 26 freq haufwit (2) - 2 freq haunling (2) - 6 freq hauflie (2) - 1 freq hangit (2) - 12 freq hailit (2) - 1 freq haunin (2) - 7 freq haandit (2) - 8 freq haunnin (2) - 1 freq haunnlin (2) - 1 freq haunnilt (2) - 1 freq hantit (2) - 3 freq haunil (2) - 1 freq haunt (2) - 28 freq |
haunlit (0) - 1 freq haunlet (1) - 2 freq haunnit (2) - 2 freq haulit (2) - 3 freq hauntit (2) - 15 freq haunlin (2) - 5 freq haunit (2) - 2 freq haundit (2) - 63 freq hurlit (3) - 1 freq handit (3) - 27 freq haun't (3) - 4 freq haundet (3) - 4 freq haunled (3) - 8 freq hankit (3) - 2 freq haunles (3) - 3 freq hunkit (3) - 2 freq sunlit (3) - 2 freq hainit (3) - 6 freq haantit (3) - 1 freq haunt (3) - 28 freq harlit (3) - 2 freq huntit (3) - 29 freq hault (3) - 18 freq haunil (3) - 1 freq haandit (3) - 8 freq |
SoundEx code - H543 haimelt - 5 freq hamelt - 72 freq hummlt - 3 freq hamilton - 40 freq haunled - 8 freq hamlets - 1 freq hummelt - 2 freq humiliatit - 2 freq humilitie - 1 freq hamlet's - 2 freq humiliate - 2 freq humiliation - 5 freq han-waaled - 2 freq humiliating - 1 freq han'led - 1 freq hum'led - 1 freq humiliated - 1 freq hamilton-megommerie - 1 freq humility - 2 freq hummled - 1 freq hannled - 2 freq hameilt - 1 freq 'hamlet' - 1 freq hamlet - 10 freq humelitie - 1 freq haunlit - 1 freq haunnilt - 1 freq hamilt - 1 freq haunnelt - 1 freq haunlet - 2 freq hamilton's - 3 freq hameldaeme - 1 freq hamiltondecor - 9 freq |
MetaPhone code - HNLT haunled - 8 freq han'led - 1 freq hannled - 2 freq haunlit - 1 freq haunnilt - 1 freq haunnelt - 1 freq haunlet - 2 freq |
HAUNLIT |
| Time to execute Levenshtein function - 0.201842 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.341411 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.027610 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.037126 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.001163 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. |