| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyhin (0) - 23 freq enyhin (1) - 1 freq onyyin (1) - 1 freq onythin (1) - 498 freq onyin (1) - 1 freq anyhin (1) - 72 freq onhin (1) - 2 freq onyhing (1) - 11 freq omythin (2) - 1 freq oneythin (2) - 1 freq knypin (2) - 4 freq nyhn (2) - 1 freq 'onythin (2) - 3 freq oanythin (2) - 2 freq onyhthin (2) - 1 freq inchin (2) - 2 freq onything (2) - 212 freq onyeen (2) - 14 freq onywie (2) - 3 freq onywan (2) - 19 freq nohin (2) - 1 freq onyhow (2) - 9 freq enihin (2) - 1 freq onnythin (2) - 1 freq onywiy (2) - 2 freq |
onyhin (0) - 23 freq onhin (1) - 2 freq anyhin (1) - 72 freq enyhin (1) - 1 freq nyhn (2) - 1 freq oniehin (2) - 3 freq nihin (2) - 5 freq nuhin (2) - 48 freq enihin (2) - 1 freq onyhing (2) - 11 freq onyyin (2) - 1 freq onythin (2) - 498 freq onyin (2) - 1 freq nohin (2) - 1 freq oanyhing (3) - 1 freq anythin (3) - 138 freq onyhoo (3) - 8 freq anyhing (3) - 33 freq onsein (3) - 2 freq oshin (3) - 1 freq naehin (3) - 3 freq 'nuhin (3) - 2 freq onyman (3) - 1 freq onyhou (3) - 1 freq enythin (3) - 1 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 - ONHN onyhin - 23 freq ony'hin' - 1 freq oniehin - 3 freq onhin - 2 freq |
ONYHIN |
| Time to execute Levenshtein function - 0.237677 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.384058 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.027418 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.036901 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.000809 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. |