| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onyhin (0) - 23 freq anyhin (1) - 69 freq onhin (1) - 2 freq enyhin (1) - 1 freq onythin (1) - 498 freq onyyin (1) - 1 freq onyin (1) - 1 freq onyhing (1) - 11 freq onyhthin (2) - 1 freq onyhow (2) - 9 freq enythin (2) - 1 freq oshin (2) - 1 freq onything (2) - 213 freq oanyhing (2) - 1 freq 'onythin (2) - 3 freq onywiy (2) - 3 freq anyhing (2) - 33 freq nihin (2) - 5 freq enihin (2) - 1 freq onsein (2) - 2 freq onyhou (2) - 1 freq oniehin (2) - 3 freq onywie (2) - 3 freq nyhn (2) - 1 freq onythin' (2) - 13 freq |
onyhin (0) - 23 freq anyhin (1) - 69 freq enyhin (1) - 1 freq onhin (1) - 2 freq nohin (2) - 1 freq oniehin (2) - 3 freq nuhin (2) - 48 freq nyhn (2) - 1 freq enihin (2) - 1 freq nihin (2) - 5 freq onythin (2) - 498 freq onyin (2) - 1 freq onyhing (2) - 11 freq onyyin (2) - 1 freq onyman (3) - 1 freq onyhoo (3) - 8 freq onyeen (3) - 14 freq onywan (3) - 19 freq onethin (3) - 2 freq anyfin (3) - 8 freq inchin (3) - 2 freq oneythin (3) - 1 freq naehin (3) - 3 freq ongoin (3) - 4 freq anythin (3) - 145 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 - ONHN onyhin - 23 freq ony'hin' - 1 freq oniehin - 3 freq onhin - 2 freq |
ONYHIN |
| Time to execute Levenshtein function - 0.313346 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.476258 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.030089 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.038809 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.001207 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. |