| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hame-bakin (0) - 1 freq hame-gaein (2) - 1 freq hame-bakes (2) - 1 freq hame-farin (2) - 1 freq hame-gaun (3) - 5 freq hame-comin (3) - 4 freq cake-makin (3) - 2 freq name-caain (3) - 1 freq home-baked (3) - 1 freq hamefarin (3) - 9 freq hame-cumin (3) - 1 freq hamecookin (3) - 1 freq hamebidin (3) - 1 freq hamesucken (4) - 2 freq hauf-baked (4) - 1 freq haud-gauin (4) - 2 freq hame-grown (4) - 1 freq hamelan (4) - 1 freq hard-warkin (4) - 3 freq hae-in (4) - 1 freq aye-gauin (4) - 1 freq hamecummin (4) - 2 freq haemfarin (4) - 2 freq bare-nakit (4) - 2 freq hame-made (4) - 11 freq |
hame-bakin (0) - 1 freq hame-bakes (3) - 1 freq hame-gaein (4) - 1 freq home-baked (4) - 1 freq hame-farin (4) - 1 freq hamebidin (5) - 1 freq hamecookin (5) - 1 freq hame-comin (5) - 4 freq hame-gaun (5) - 5 freq hame-cumin (5) - 1 freq hamesucken (6) - 2 freq hauf-blin (6) - 1 freq hauf-baked (6) - 1 freq ham-actin (6) - 1 freq name-caain (6) - 1 freq cake-makin (6) - 2 freq hamefarin (6) - 9 freq hamelaun (7) - 1 freq hamecomin (7) - 11 freq smeakin (7) - 1 freq humblin (7) - 1 freq aye-bydin (7) - 5 freq hame-airt (7) - 1 freq has-been (7) - 3 freq hame-aboot (7) - 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 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 - HMBKN hame-bakin - 1 freq |
HAME-BAKIN |
| Time to execute Levenshtein function - 0.227808 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.432002 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.035384 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.046454 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.001025 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. |