| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hogmanay (0) - 68 freq hogmanays (1) - 1 freq hogmany (1) - 3 freq €˜hogmanay (2) - 1 freq hogmanay's (2) - 2 freq humanly (3) - 1 freq hugmanæ (3) - 1 freq normandy (3) - 3 freq hogmagandy (3) - 2 freq hogan (3) - 1 freq hodman (3) - 1 freq womanly (3) - 2 freq howpan (4) - 1 freq ghana (4) - 1 freq holieday (4) - 1 freq booman (4) - 2 freq commans (4) - 3 freq mogganer (4) - 2 freq nominal (4) - 1 freq honey (4) - 413 freq sovranty (4) - 9 freq coman' (4) - 1 freq woman's (4) - 9 freq hopan (4) - 6 freq hangman's (4) - 3 freq |
hogmanay (0) - 68 freq hogmany (1) - 3 freq hogmanays (2) - 1 freq hodman (4) - 1 freq hegemony (4) - 9 freq hogmanay's (4) - 2 freq €˜hogmanay (4) - 1 freq hogan (4) - 1 freq hatman (5) - 1 freq haman (5) - 1 freq harmony (5) - 15 freq humane (5) - 4 freq he-man (5) - 1 freq huggan (5) - 2 freq hoggin (5) - 2 freq herman (5) - 1 freq hogmagandy (5) - 2 freq hugmanæ (5) - 1 freq henman (5) - 1 freq hormone (5) - 4 freq harman (5) - 1 freq hangman (5) - 9 freq human (5) - 317 freq humanly (5) - 1 freq homage (6) - 5 freq |
SoundEx code - H255 hogmanay - 68 freq hegemonies - 1 freq hegemonic - 3 freq hogmanay's - 2 freq hogmanays - 1 freq houseman - 2 freq highwayman - 1 freq 'highwayman' - 1 freq hugmanæ - 1 freq hogmany - 3 freq hoose-names - 1 freq haussmann - 1 freq €˜hogmanay - 1 freq hegemony - 9 freq hxmonwhmg - 1 freq |
MetaPhone code - HKMN hogmanay - 68 freq hugmanæ - 1 freq hogmany - 3 freq €˜hogmanay - 1 freq |
HOGMANAY |
| Time to execute Levenshtein function - 0.201242 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.336020 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.028047 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.037033 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.000874 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. |