Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onyyin (0) - 1 freq onyhin (1) - 23 freq onyin (1) - 1 freq onhin (2) - 2 freq onyhing (2) - 11 freq obeyin (2) - 1 freq ongoin (2) - 4 freq ingyin (2) - 2 freq onywie (2) - 3 freq onyman (2) - 1 freq onieyin (2) - 4 freq anyfin (2) - 8 freq onywiy (2) - 3 freq onythin (2) - 498 freq enjyin (2) - 2 freq onywi (2) - 3 freq enyhin (2) - 1 freq onyeen (2) - 14 freq anyhin (2) - 69 freq knypin (2) - 4 freq onsein (2) - 2 freq onywan (2) - 19 freq onyting (2) - 1 freq nohin (3) - 1 freq convoyin (3) - 4 freq |
onyyin (0) - 1 freq onyin (1) - 1 freq onyeen (2) - 14 freq onieyin (2) - 4 freq onyhin (2) - 23 freq onyane (3) - 13 freq onyene (3) - 1 freq nain (3) - 5 freq nein (3) - 4 freq yinyin (3) - 1 freq enin (3) - 4 freq naein (3) - 1 freq naeyin (3) - 2 freq onyone (3) - 23 freq anyun (3) - 1 freq onion (3) - 14 freq nuin (3) - 14 freq onnie (3) - 7 freq nin (3) - 1 freq onywan (3) - 19 freq neyn (3) - 1 freq onny (3) - 3 freq ingyin (3) - 2 freq ongoin (3) - 4 freq onywi (3) - 3 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 |
ONYYIN |
Time to execute Levenshtein function - 0.226737 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.382022 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.035626 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.049944 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.001152 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. |