| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| omen (0) - 5 freq oman (1) - 2 freq oven (1) - 51 freq amen (1) - 24 freq ofen (1) - 2 freq oen (1) - 5 freq men (1) - 1133 freq ome (1) - 1 freq women (1) - 77 freq omens (1) - 3 freq owen (1) - 6 freq 'men (1) - 1 freq oxen (1) - 2 freq open (1) - 719 freq comes (2) - 926 freq homes (2) - 10 freq mef (2) - 2 freq saen (2) - 71 freq meh (2) - 192 freq obe (2) - 2 freq oee (2) - 1 freq man (2) - 3440 freq 'amen (2) - 2 freq den (2) - 103 freq womens (2) - 3 freq |
omen (0) - 5 freq amen (1) - 24 freq men (1) - 1133 freq oman (1) - 2 freq aman (2) - 2 freq imn (2) - 2 freq yemen (2) - 2 freq mn (2) - 8 freq myn (2) - 128 freq moyen (2) - 14 freq mein (2) - 2 freq yeomen (2) - 1 freq amn (2) - 3 freq amon (2) - 22 freq amun (2) - 5 freq maen (2) - 5 freq eomin (2) - 1 freq amene (2) - 1 freq meen (2) - 49 freq amin (2) - 1 freq mene (2) - 6 freq meyn (2) - 23 freq mun (2) - 20 freq mien (2) - 3 freq meun (2) - 3 freq |
SoundEx code - O550 onyhin - 23 freq ownin - 22 freq onion - 14 freq onyane - 13 freq onywan - 19 freq onieyin - 4 freq oman - 2 freq onyin - 1 freq onyeen - 14 freq ony-ean - 7 freq onyone - 23 freq omen - 5 freq onnen - 2 freq onyyin - 1 freq onyene - 1 freq ony'hin' - 1 freq oniehin - 3 freq onieane - 1 freq onhin - 2 freq o'mine - 4 freq oanyone - 1 freq |
MetaPhone code - OMN oman - 2 freq omen - 5 freq oemnu - 1 freq o'mine - 4 freq |
OMEN |
| Time to execute Levenshtein function - 0.176227 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.335174 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.027878 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.038128 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.000925 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. |