Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onyhing (0) - 11 freq onything (1) - 213 freq anyhing (1) - 33 freq onyting (1) - 1 freq oanyhing (1) - 1 freq onyhin (1) - 23 freq anything (2) - 138 freq ony'hin' (2) - 1 freq onythin' (2) - 13 freq onythin (2) - 498 freq inching (2) - 1 freq oniehing (2) - 1 freq aeyhing (2) - 1 freq nohing (2) - 3 freq onyyin (2) - 1 freq oanything (2) - 1 freq onhin (2) - 2 freq anyhin (2) - 69 freq nuhing (2) - 3 freq ongoing (2) - 2 freq onyin (2) - 1 freq enyhin (2) - 1 freq nihing (2) - 3 freq onding (2) - 9 freq enythin (3) - 1 freq |
onyhing (0) - 11 freq oanyhing (1) - 1 freq anyhing (1) - 33 freq nohing (2) - 3 freq nuhing (2) - 3 freq oniehing (2) - 1 freq nihing (2) - 3 freq onyhin (2) - 23 freq onything (2) - 213 freq onyting (2) - 1 freq anyhin (3) - 69 freq onhin (3) - 2 freq onding (3) - 9 freq oanything (3) - 1 freq enyhin (3) - 1 freq ongoing (3) - 2 freq anything (3) - 138 freq inching (3) - 1 freq aeyhing (3) - 1 freq ending (4) - 17 freq aching (4) - 4 freq nathing (4) - 1 freq ahing (4) - 1 freq ching (4) - 14 freq oniething (4) - 37 freq |
SoundEx code - O552 ominous - 6 freq omens - 3 freq onyane's - 1 freq onions - 17 freq onhingin - 1 freq ownins - 1 freq onyhing - 11 freq onnen's - 1 freq onomasticians - 1 freq 'ominous' - 1 freq onhankit - 2 freq oniehing - 1 freq ominously - 2 freq owning - 1 freq onomastics - 2 freq oanyhing - 1 freq |
MetaPhone code - ONHNK onyhing - 11 freq oniehing - 1 freq oanyhing - 1 freq |
ONYHING |
Time to execute Levenshtein function - 0.205614 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.341199 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.028159 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.037651 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.000862 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. |