| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hampdenroarpod (0) - 1 freq hampdeners (6) - 1 freq hameward (7) - 13 freq hate-warped (7) - 1 freq emperoar (7) - 1 freq hameword (7) - 1 freq haudendoon (7) - 1 freq hampden (7) - 15 freq hydrocarbon (8) - 1 freq cameraloon (8) - 1 freq hadubrand (8) - 4 freq hameland (8) - 7 freq havenport (8) - 1 freq champenoise (8) - 1 freq hildebrand (8) - 6 freq happenchance (8) - 2 freq wammanhood (8) - 1 freq compeirand (8) - 2 freq happened (8) - 461 freq comperand (8) - 1 freq raindroaps (8) - 2 freq hamegrowen (8) - 1 freq haird-earned (8) - 1 freq hamewards (8) - 2 freq hamefarin (8) - 9 freq |
hampdenroarpod (0) - 1 freq hampdeners (9) - 1 freq hampden (11) - 15 freq hmodinraven (12) - 1 freq hameword (12) - 1 freq emperoar (12) - 1 freq hameward (12) - 13 freq hate-warped (12) - 1 freq ianpiriepod (13) - 2 freq hard-earned (13) - 1 freq emperor's (13) - 20 freq happend (13) - 1 freq imperor (13) - 3 freq hand-rearit (13) - 1 freq compeared (13) - 2 freq amymacleanpod (13) - 1 freq hamelaund (13) - 1 freq homeward (13) - 3 freq hamewird (13) - 1 freq emperors (13) - 2 freq handicapped (13) - 1 freq hamper (13) - 3 freq dampened (13) - 2 freq humdinger (13) - 2 freq moderated (13) - 1 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 - HMPTNRRP |
HAMPDENROARPOD |
| Time to execute Levenshtein function - 0.433397 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.648570 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.027697 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.038637 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.000852 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. |