| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onions (0) - 17 freq unions (1) - 8 freq inions (1) - 1 freq onion (1) - 14 freq orion (2) - 4 freq options (2) - 27 freq bonbons (2) - 3 freq pinions (2) - 1 freq opinions (2) - 27 freq onyone (2) - 23 freq lions (2) - 35 freq noons (2) - 1 freq notions (2) - 40 freq odious (2) - 4 freq oncoms (2) - 1 freq union' (2) - 1 freq union's (2) - 1 freq bunions (2) - 2 freq sions (2) - 1 freq inion (2) - 1 freq ions (2) - 3 freq lotions (2) - 1 freq motions (2) - 17 freq union (2) - 188 freq ownins (2) - 1 freq |
onions (0) - 17 freq inions (1) - 1 freq unions (1) - 8 freq noons (2) - 1 freq onion (2) - 14 freq minions (3) - 5 freq nines (3) - 12 freq ations (3) - 1 freq union (3) - 188 freq ions (3) - 3 freq annoys (3) - 4 freq ownins (3) - 1 freq nans (3) - 3 freq enns (3) - 11 freq anns (3) - 1 freq nuns (3) - 8 freq nouns (3) - 60 freq inion (3) - 1 freq inns (3) - 8 freq eenins (3) - 2 freq onyone (3) - 23 freq opinions (3) - 27 freq pinions (3) - 1 freq sions (3) - 1 freq notions (3) - 40 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 - ONNS onions - 17 freq ownins - 1 freq onnen's - 1 freq |
ONIONS |
| Time to execute Levenshtein function - 0.216179 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.397550 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.032323 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.044632 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.001106 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. |