| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyane (0) - 13 freq onyene (1) - 1 freq onyone (1) - 23 freq inane (2) - 2 freq nane (2) - 547 freq onysake (2) - 1 freq ongan (2) - 2 freq oyne (2) - 3 freq onywan (2) - 19 freq insane (2) - 8 freq onygate (2) - 1 freq on'ae (2) - 2 freq ontae (2) - 348 freq onyane's (2) - 1 freq onieane (2) - 1 freq ondang (2) - 3 freq anyone (2) - 67 freq ongyans (2) - 4 freq oanyone (2) - 1 freq nyne (2) - 4 freq onyman (2) - 1 freq onymare (2) - 2 freq onywye (2) - 181 freq onywie (2) - 3 freq onyin (2) - 1 freq |
onyane (0) - 13 freq onyene (1) - 1 freq onyone (1) - 23 freq nyne (2) - 4 freq oanyone (2) - 1 freq anyone (2) - 67 freq onieane (2) - 1 freq onyin (2) - 1 freq nane (2) - 547 freq inane (2) - 2 freq nan (3) - 14 freq nean (3) - 1 freq anyun (3) - 1 freq onny (3) - 3 freq onna (3) - 18 freq onno (3) - 20 freq none (3) - 57 freq onyeen (3) - 14 freq nine (3) - 230 freq onion (3) - 14 freq nani (3) - 1 freq onyyin (3) - 1 freq nne (3) - 1 freq ouyang (3) - 1 freq unean (3) - 1 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 - ONYN onyane - 13 freq onieyin - 4 freq onyin - 1 freq onyeen - 14 freq onyone - 23 freq onyene - 1 freq oanyone - 1 freq |
ONYANE |
| Time to execute Levenshtein function - 0.176116 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.393116 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.036681 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.040112 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.001018 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. |