| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hampstead (0) - 1 freq hamesteid (2) - 3 freq hamsters (3) - 1 freq hamster (3) - 5 freq hasted (3) - 2 freq lampstan (3) - 1 freq hairsted (3) - 1 freq hamster's (4) - 1 freq stead (4) - 3 freq humped (4) - 2 freq mainsteam (4) - 1 freq hosted (4) - 3 freq artstrad (4) - 2 freq shaested (4) - 1 freq hammered (4) - 11 freq halped (4) - 2 freq khympstuar (4) - 1 freq amassed (4) - 2 freq hated (4) - 48 freq tasted (4) - 20 freq instead (4) - 171 freq hairsters (4) - 4 freq tamped (4) - 1 freq hailsteen (4) - 1 freq hanted (4) - 2 freq |
hampstead (0) - 1 freq hamesteid (3) - 3 freq lampstan (5) - 1 freq hasted (5) - 2 freq hairsted (5) - 1 freq hamster (5) - 5 freq harvested (6) - 1 freq dempster (6) - 11 freq hipster (6) - 2 freq humphed (6) - 9 freq haimster (6) - 2 freq hysted (6) - 3 freq hoasted (6) - 7 freq hoisted (6) - 3 freq hampshire (6) - 1 freq misted (6) - 2 freq campsite (6) - 1 freq lampshade (6) - 1 freq ham-sized (6) - 1 freq msteid (6) - 1 freq tempted (6) - 22 freq pasted (6) - 2 freq khympstuar (6) - 1 freq humped (6) - 2 freq hosted (6) - 3 freq |
SoundEx code - H512 haunbag - 9 freq humps - 3 freq haunfast - 2 freq hembist - 1 freq hanfoos - 1 freq humphs - 2 freq henna-busks - 1 freq hanbug - 11 freq hame-bakes - 1 freq humbug - 5 freq haunfus - 2 freq hanfaes - 1 freq hame-bakin - 1 freq home-baked - 1 freq hinny-bees - 1 freq hampstead - 1 freq han-pickit - 1 freq hinny-piece - 1 freq hymn-books - 1 freq hempies- - 1 freq haunbuik - 2 freq hampshire - 1 freq hempies - 2 freq humfished - 1 freq hanbags - 1 freq hanbag - 1 freq humbugs - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HMPSTT hampstead - 1 freq |
HAMPSTEAD |
| Time to execute Levenshtein function - 0.202668 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.402257 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.030881 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.040509 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.000836 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. |