Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
haunnelt (0) - 1 freq haunnilt (1) - 1 freq haundet (2) - 4 freq haunlet (2) - 2 freq haundel (2) - 1 freq hunnel (2) - 4 freq haunel (2) - 3 freq haunners (2) - 1 freq hauntet (2) - 2 freq hanselt (2) - 3 freq hankelt (2) - 1 freq daunnert (2) - 5 freq haunnle (2) - 7 freq hannet (2) - 2 freq trunnelt (2) - 26 freq haunnils (2) - 1 freq haunnit (2) - 2 freq haunnil (2) - 1 freq waunnert (2) - 6 freq haunels (2) - 1 freq hunnert (2) - 14 freq hannel (2) - 1 freq haunbell (2) - 1 freq hunnels (2) - 2 freq caunnels (2) - 1 freq |
haunnelt (0) - 1 freq haunnilt (1) - 1 freq hankelt (3) - 1 freq hanselt (3) - 3 freq haunnle (3) - 7 freq hannet (3) - 2 freq haunnil (3) - 1 freq hannel (3) - 1 freq haunlet (3) - 2 freq hunnels (3) - 2 freq haunnit (3) - 2 freq hunnel (3) - 4 freq haunnils (3) - 1 freq hunnert (3) - 14 freq hinnert (4) - 3 freq kinnelt (4) - 3 freq kennelt (4) - 1 freq haunlit (4) - 1 freq hunnle (4) - 2 freq hannit (4) - 20 freq hunnul (4) - 4 freq haunnlin (4) - 1 freq hannile (4) - 1 freq haunnles (4) - 2 freq hannle (4) - 5 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 |
HAUNNELT |
Time to execute Levenshtein function - 0.219380 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.372788 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.030156 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.037683 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.004628 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. |