| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oniehin (0) - 3 freq oniethin (1) - 81 freq oniehing (1) - 1 freq onieyin (1) - 4 freq onwithin (2) - 1 freq onythin (2) - 498 freq onethin (2) - 2 freq nihin (2) - 5 freq onhin (2) - 2 freq oniething (2) - 37 freq onyhin (2) - 23 freq oneithin (2) - 1 freq naehin (2) - 3 freq enihin (2) - 1 freq onniethin (2) - 2 freq 'oniethin (2) - 1 freq onicthin (2) - 1 freq onsein (2) - 2 freq oniehoo (2) - 10 freq nithin (2) - 71 freq naethin (3) - 800 freq onyeen (3) - 14 freq omethin (3) - 1 freq punishin (3) - 3 freq trehin (3) - 7 freq |
oniehin (0) - 3 freq onyhin (2) - 23 freq naehin (2) - 3 freq enihin (2) - 1 freq onhin (2) - 2 freq nihin (2) - 5 freq oniethin (2) - 81 freq onieyin (2) - 4 freq oniehing (2) - 1 freq nithin (3) - 71 freq nohin (3) - 1 freq onsein (3) - 2 freq anyhin (3) - 69 freq nuhin (3) - 48 freq enyhin (3) - 1 freq oniehoo (3) - 10 freq onythin (3) - 498 freq onethin (3) - 2 freq oneithin (3) - 1 freq neebin (4) - 2 freq anythin (4) - 145 freq na'hin (4) - 2 freq onieane (4) - 1 freq nyhn (4) - 1 freq unitin (4) - 2 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 |
ONIEHIN |
| Time to execute Levenshtein function - 0.191620 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.358831 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.028660 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.038901 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.001048 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. |