Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oneywutiy (0) - 1 freq oneywuty (1) - 8 freq oneywuiy (1) - 23 freq oneywuliy (1) - 1 freq onywuiy (2) - 2 freq oncywuty (2) - 1 freq onywuty (2) - 1 freq oneywuly (2) - 12 freq oneywaiy (2) - 1 freq oneywulty (2) - 2 freq oneywury (2) - 1 freq oneybudy (3) - 1 freq onywiy (3) - 2 freq onywety (3) - 1 freq onywuy (3) - 1 freq onyweiy (3) - 8 freq oneywey (3) - 1 freq onywaiy (3) - 1 freq onywei (4) - 3 freq oneythin (4) - 1 freq onywie (4) - 3 freq naywuly (4) - 1 freq uneytit (4) - 1 freq onybuddy (4) - 8 freq onyway (4) - 22 freq |
oneywutiy (0) - 1 freq oneywuty (1) - 8 freq onywuty (2) - 1 freq oneywuliy (2) - 1 freq oneywuiy (2) - 23 freq oneywury (3) - 1 freq onywety (3) - 1 freq oneywulty (3) - 2 freq oneywuly (3) - 12 freq oneywaiy (3) - 1 freq onywuiy (3) - 2 freq oncywuty (3) - 1 freq oneywey (4) - 1 freq onywaiy (4) - 1 freq onyweiy (4) - 8 freq onywiy (4) - 2 freq onywuy (4) - 1 freq onywaly (5) - 1 freq onywi (5) - 3 freq anywaiy (5) - 17 freq onywey (5) - 166 freq onywy (5) - 5 freq newt (5) - 1 freq anywiy (5) - 2 freq onywely (5) - 4 freq |
SoundEx code - O530 ontae - 343 freq on't - 39 freq oantae - 89 freq owned - 22 freq onto - 20 freq on-it - 2 freq one-day - 1 freq o'need - 1 freq onywey-heid - 1 freq oanty - 3 freq oantie - 1 freq onty - 3 freq ont - 5 freq onte - 18 freq onywuty - 1 freq oneywutiy - 1 freq onta - 2 freq oneywuty - 8 freq onywety - 1 freq ownit - 8 freq onno't - 1 freq oan't - 3 freq one-eyed - 1 freq on'-at - 1 freq onti - 8 freq ond - 1 freq €“on-ti - 1 freq onyday - 1 freq on-tae - 1 freq onduee - 1 freq onutu - 1 freq |
MetaPhone code - ONWT onywuty - 1 freq oneywutiy - 1 freq oneywuty - 8 freq onywety - 1 freq |
ONEYWUTIY |
Time to execute Levenshtein function - 0.193602 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.403373 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.029509 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.044110 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.000839 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. |