| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| omens (0) - 3 freq oens (1) - 1 freq womens (1) - 3 freq owens (1) - 3 freq omen (1) - 5 freq ovens (1) - 4 freq mens (1) - 3 freq opens (1) - 69 freq umes (2) - 1 freq ens (2) - 16 freq ones (2) - 31 freq mense (2) - 60 freq menus (2) - 3 freq meno (2) - 1 freq women's (2) - 9 freq 'means (2) - 1 freq means (2) - 556 freq one's (2) - 6 freq sens (2) - 6 freq whens (2) - 2 freq -mews (2) - 1 freq peens (2) - 6 freq raens (2) - 2 freq mins (2) - 30 freq oppens (2) - 4 freq |
omens (0) - 3 freq mens (1) - 3 freq meens (2) - 3 freq means (2) - 556 freq maens (2) - 3 freq menes (2) - 6 freq mons (2) - 12 freq mins (2) - 30 freq moyens (2) - 3 freq meuns (2) - 4 freq myns (2) - 5 freq menus (2) - 3 freq mense (2) - 60 freq omen (2) - 5 freq owens (2) - 3 freq womens (2) - 3 freq oens (2) - 1 freq ovens (2) - 4 freq opens (2) - 69 freq mensa (2) - 1 freq mans (2) - 21 freq mains (3) - 59 freq oman (3) - 2 freq bens (3) - 47 freq me's (3) - 5 freq |
SoundEx code - O552 ominous - 6 freq omens - 3 freq onyane's - 1 freq onions - 17 freq onhingin - 1 freq ownins - 1 freq onyhing - 11 freq onnen's - 1 freq onomasticians - 1 freq 'ominous' - 1 freq onhankit - 2 freq oniehing - 1 freq ominously - 2 freq owning - 1 freq onomastics - 2 freq oanyhing - 1 freq |
MetaPhone code - OMNS ominous - 6 freq omens - 3 freq 'ominous' - 1 freq omnies - 1 freq |
OMENS |
| Time to execute Levenshtein function - 0.243429 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.467151 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.029650 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.039985 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.000846 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. |