| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| happier (0) - 18 freq happie (1) - 13 freq napier (2) - 25 freq chapper (2) - 2 freq dapper (2) - 4 freq cappie (2) - 3 freq sappie (2) - 12 freq lapper (2) - 1 freq tapper (2) - 1 freq rapper (2) - 4 freq mappies (2) - 13 freq pappie (2) - 1 freq hairier (2) - 2 freq nappies (2) - 9 freq happen (2) - 383 freq mappie (2) - 20 freq hippies (2) - 6 freq bappie (2) - 1 freq naipier (2) - 1 freq nippier (2) - 1 freq hamper (2) - 3 freq happins (2) - 3 freq wappie (2) - 1 freq napper (2) - 36 freq harrier (2) - 2 freq |
happier (0) - 18 freq happie (2) - 13 freq hamper (3) - 3 freq nippier (3) - 1 freq hippies (3) - 6 freq wapper (3) - 2 freq capper (3) - 2 freq napper (3) - 36 freq papper (3) - 1 freq harper (3) - 3 freq happily (3) - 40 freq happed (3) - 35 freq hippie (3) - 2 freq happen (3) - 383 freq halper (3) - 2 freq happit (3) - 102 freq happin (3) - 16 freq dapper (3) - 4 freq chapper (3) - 2 freq tapper (3) - 1 freq lapper (3) - 1 freq happeq (3) - 1 freq rapper (3) - 4 freq papier (3) - 1 freq dipper (4) - 3 freq |
SoundEx code - H160 however - 61 freq hooever - 31 freq happier - 18 freq hover - 9 freq hauf-oor - 8 freq haiver - 6 freq haver - 6 freq hoover - 18 freq houiver - 17 freq hyper - 4 freq hooivver - 51 freq haaver - 4 freq houever - 37 freq hooiver - 13 freq heavier - 9 freq hauf-hour - 3 freq heifer - 4 freq hebrew - 19 freq howivver - 21 freq howiwver - 2 freq 'hip-hooray - 1 freq houewvir - 1 freq 'hooever - 1 freq hever - 2 freq hivvier - 2 freq havera - 2 freq heefer - 1 freq houivver - 3 freq heffer - 2 freq howfur - 2 freq howiver - 1 freq hauf-aware - 1 freq hubber - 1 freq hoo-ivver - 1 freq hoovur - 1 freq hiprah - 2 freq |
MetaPhone code - HPR happier - 18 freq hiprah - 2 freq |
HAPPIER happy - 755 freq happiness - 56 freq happier - 18 freq |
| Time to execute Levenshtein function - 0.209772 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.338455 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.027309 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.036830 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.000849 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. |