| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hampden (0) - 15 freq happen (2) - 386 freq camden (2) - 1 freq hamper (2) - 3 freq hauden (2) - 49 freq haaden (2) - 2 freq harden (2) - 21 freq €œhampden (2) - 1 freq handen (2) - 1 freq hadden (2) - 3 freq dampen (2) - 1 freq hade (3) - 1 freq haedin (3) - 1 freq lambeen (3) - 3 freq handee (3) - 4 freq happend (3) - 1 freq lumpen (3) - 1 freq hamley (3) - 1 freq hopen (3) - 1 freq hadean (3) - 3 freq hamster (3) - 6 freq damper (3) - 3 freq harpoon (3) - 8 freq hapes (3) - 1 freq hammin (3) - 1 freq |
hampden (0) - 15 freq dampen (4) - 1 freq handen (4) - 1 freq humphin (4) - 18 freq humped (4) - 2 freq humpin (4) - 1 freq €œhampden (4) - 1 freq hadden (4) - 3 freq harden (4) - 21 freq camden (4) - 1 freq hamper (4) - 3 freq hauden (4) - 49 freq happen (4) - 386 freq haaden (4) - 2 freq hampdeners (5) - 1 freq halpin (5) - 5 freq hodden (5) - 8 freq happenen (5) - 2 freq hadn (5) - 2 freq hamada (5) - 1 freq happan (5) - 2 freq hardon (5) - 2 freq handin (5) - 15 freq amadan (5) - 1 freq hawdin (5) - 8 freq |
SoundEx code - H513 humphed - 9 freq humphd - 1 freq hamebidin - 1 freq hampden - 15 freq humpit - 1 freq humpty - 7 freq haun-fudge - 1 freq hameaboot - 1 freq hinny-pot - 1 freq humpty-dumpty - 2 freq humphit - 1 freq hame-aboot - 3 freq hempt - 1 freq haemaboot - 1 freq humped - 2 freq €œhampden - 1 freq hampdeners - 1 freq hampdenroarpod - 1 freq |
MetaPhone code - HMPTN hampden - 15 freq €œhampden - 1 freq |
HAMPDEN |
| Time to execute Levenshtein function - 0.208742 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.370980 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.038318 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.039762 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.000988 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. |