| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunled (0) - 8 freq hannled (1) - 2 freq haundled (1) - 1 freq haunded (1) - 19 freq haunle (1) - 26 freq hauled (1) - 20 freq haunles (1) - 3 freq haunted (1) - 11 freq haunlet (1) - 2 freq hounded (2) - 1 freq hanked (2) - 1 freq hailed (2) - 14 freq hanged (2) - 6 freq haled (2) - 1 freq haunless (2) - 3 freq haunel (2) - 3 freq haaled (2) - 21 freq hunxed (2) - 1 freq han'led (2) - 1 freq wauled (2) - 1 freq daunced (2) - 18 freq harled (2) - 6 freq haunlin (2) - 5 freq haused (2) - 3 freq caunles (2) - 13 freq |
haunled (0) - 8 freq haunles (2) - 3 freq haunted (2) - 11 freq hauled (2) - 20 freq haunlet (2) - 2 freq haunle (2) - 26 freq hannled (2) - 2 freq haundled (2) - 1 freq haunded (2) - 19 freq hanted (3) - 2 freq hunred (3) - 1 freq hanles (3) - 1 freq hurled (3) - 20 freq haunlit (3) - 1 freq haanded (3) - 6 freq hanle (3) - 4 freq hunkled (3) - 1 freq haeled (3) - 2 freq hained (3) - 27 freq handed (3) - 49 freq halled (3) - 2 freq hauld (3) - 11 freq hunsed (3) - 1 freq handled (3) - 7 freq haund (3) - 384 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 humiliate - 2 freq humiliation - 5 freq hamlet's - 1 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 |
HAUNLED |
| Time to execute Levenshtein function - 0.184671 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.339597 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.027559 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.036855 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.000854 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. |