| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onion (0) - 14 freq inion (1) - 1 freq orion (1) - 4 freq onions (1) - 17 freq union (1) - 192 freq unions (2) - 8 freq ohio (2) - 3 freq onto (2) - 20 freq ion (2) - 1 freq onic (2) - 1 freq fion (2) - 2 freq sion (2) - 1 freq opinion (2) - 70 freq minion (2) - 3 freq oioo (2) - 1 freq option (2) - 56 freq unison (2) - 8 freq conlon (2) - 1 freq union' (2) - 1 freq onhin (2) - 2 freq nibon (2) - 1 freq onyin (2) - 1 freq ixion (2) - 1 freq onieb (2) - 1 freq odin (2) - 43 freq |
onion (0) - 14 freq union (1) - 192 freq inion (1) - 1 freq neon (2) - 7 freq onyin (2) - 1 freq uinion (2) - 1 freq non (2) - 39 freq onyone (2) - 23 freq anon (2) - 6 freq noon (2) - 29 freq nien (2) - 5 freq enin (2) - 4 freq onions (2) - 17 freq orion (2) - 4 freq nin (2) - 1 freq onno (2) - 20 freq anno (3) - 5 freq nina (3) - 1 freq uinioun (3) - 1 freq nino (3) - 1 freq onnie (3) - 7 freq nine (3) - 234 freq unean (3) - 1 freq naan (3) - 2 freq aanin (3) - 2 freq |
SoundEx code - O550 onyhin - 23 freq ownin - 22 freq onion - 14 freq onyane - 13 freq onywan - 19 freq onieyin - 4 freq owaaanannnnnnnyyyeooooo - 1 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 - ONN ownin - 22 freq onion - 14 freq ony-ean - 7 freq onnen - 2 freq onyyin - 1 freq onieane - 1 freq |
ONION |
| Time to execute Levenshtein function - 0.232609 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.352390 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.028531 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.039808 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.001058 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. |