| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humfished (0) - 1 freq humfishin (2) - 1 freq humphed (3) - 9 freq furnished (3) - 2 freq famished (3) - 3 freq fished (3) - 20 freq scomfished (3) - 3 freq burnished (3) - 4 freq published (3) - 52 freq punished (3) - 12 freq unfashed (3) - 1 freq hushed (3) - 10 freq dumpised (3) - 4 freq ramished (3) - 2 freq dimished (3) - 1 freq poalished (4) - 1 freq notished (4) - 1 freq 'offisher (4) - 1 freq uissed (4) - 4 freq fashed (4) - 82 freq virmished (4) - 1 freq fínished (4) - 1 freq uised (4) - 281 freq admonished (4) - 1 freq unweshed (4) - 1 freq |
humfished (0) - 1 freq humfishin (3) - 1 freq unfashed (5) - 1 freq ramished (5) - 2 freq dimished (5) - 1 freq scomfished (5) - 3 freq hushed (5) - 10 freq humphed (5) - 9 freq famished (5) - 3 freq fished (5) - 20 freq meshed (6) - 1 freq hashed (6) - 4 freq manished (6) - 4 freq humphd (6) - 1 freq ambushed (6) - 1 freq diminished (6) - 5 freq ramshed (6) - 1 freq raamished (6) - 2 freq fyshed (6) - 1 freq mashed (6) - 5 freq hilshed (6) - 1 freq demolished (6) - 9 freq mushed (6) - 1 freq smashed (6) - 35 freq hamish (6) - 46 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 humfishin - 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 humbugs - 5 freq hanbags - 1 freq hanbag - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HMFXT humfished - 1 freq |
HUMFISHED |
| Time to execute Levenshtein function - 0.468118 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.899541 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.086085 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.127384 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.001126 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. |