| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| home-baked (0) - 1 freq hame-bakes (2) - 1 freq hame-bakin (3) - 1 freq hauf-baked (3) - 1 freq home-made (3) - 1 freq home-brew (3) - 2 freq homemaker (3) - 1 freq hame-made (4) - 11 freq homemade (4) - 3 freq shame-faced (4) - 2 freq sun-baked (4) - 1 freq half-naked (4) - 1 freq homepage (4) - 1 freq lang-baked (4) - 1 freq horse-rake (4) - 1 freq some-like (4) - 1 freq hoaked (4) - 2 freq homebrew (4) - 1 freq hame-brewed (4) - 1 freq rose-bed (4) - 1 freq poe-faced (4) - 3 freq homeward (4) - 3 freq homeland (4) - 1 freq fine-baned (4) - 1 freq bombazed (4) - 2 freq |
home-baked (0) - 1 freq hame-bakes (3) - 1 freq hauf-baked (4) - 1 freq hame-bakin (4) - 1 freq home-brew (5) - 2 freq home-made (5) - 1 freq hame-brewed (6) - 1 freq sun-baked (6) - 1 freq homemaker (6) - 1 freq hame-made (6) - 11 freq wire-baned (7) - 1 freq bombazed (7) - 2 freq fine-baned (7) - 1 freq homeland (7) - 1 freq hauf-bauld (7) - 1 freq homeward (7) - 3 freq hause-baund (7) - 2 freq humbled (7) - 1 freq ibis-beaked (7) - 1 freq hat-band (7) - 1 freq ham-sized (7) - 1 freq hummocked (7) - 1 freq homemade (7) - 3 freq some-like (7) - 1 freq shame-faced (7) - 2 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 - HMBKT home-baked - 1 freq |
HOME-BAKED |
| Time to execute Levenshtein function - 0.213777 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.393570 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.030512 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.049449 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.000913 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. |