Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onyone (0) - 23 freq anyone (1) - 64 freq onyane (1) - 13 freq onyene (1) - 1 freq oanyone (1) - 1 freq yone (2) - 7 freq onyin (2) - 1 freq none (2) - 57 freq annone (2) - 1 freq onion (2) - 14 freq condone (2) - 1 freq oncome (2) - 40 freq 'none (2) - 1 freq 'anyone (2) - 1 freq oyne (2) - 3 freq onywie (2) - 3 freq onywye (2) - 180 freq anyont (2) - 1 freq nyne (2) - 4 freq o'yon (2) - 2 freq online (2) - 142 freq undone (2) - 4 freq ochone (2) - 13 freq onions (2) - 17 freq opon (3) - 1 freq |
onyone (0) - 23 freq anyone (1) - 64 freq oanyone (1) - 1 freq onyene (1) - 1 freq onyane (1) - 13 freq nyne (2) - 4 freq onion (2) - 14 freq none (2) - 57 freq onyin (2) - 1 freq non (3) - 36 freq onyyin (3) - 1 freq inane (3) - 2 freq nine (3) - 229 freq anon (3) - 6 freq onno (3) - 20 freq anne (3) - 74 freq noon (3) - 28 freq onny (3) - 3 freq nane (3) - 544 freq onieane (3) - 1 freq onyeen (3) - 14 freq nne (3) - 1 freq anyun (3) - 1 freq inion (3) - 1 freq union (3) - 188 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 - ONYN onyane - 13 freq onieyin - 4 freq onyin - 1 freq onyeen - 14 freq onyone - 23 freq onyene - 1 freq oanyone - 1 freq |
ONYONE |
Time to execute Levenshtein function - 0.188967 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.329164 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.027928 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.037386 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.001021 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. |