Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
onywheres (0) - 1 freq onywhere (1) - 27 freq anywhere (2) - 33 freq oniwhere (2) - 1 freq 'onywhere (2) - 1 freq naywhere (3) - 1 freq sumwheres (3) - 1 freq onytheen (3) - 3 freq onywyes (3) - 2 freq anywherr (3) - 1 freq onyweys (3) - 20 freq wheres (3) - 9 freq nowhere (3) - 9 freq erywhere (3) - 1 freq oniewhere (3) - 1 freq somewheres (3) - 1 freq onywhar (3) - 4 freq where's (4) - 30 freq ivrywhere (4) - 2 freq intherest (4) - 6 freq snashers (4) - 1 freq onywey (4) - 166 freq onyweiy (4) - 8 freq €™where (4) - 2 freq onywei (4) - 3 freq |
onywheres (0) - 1 freq onywhere (2) - 27 freq oniwhere (3) - 1 freq anywhere (3) - 33 freq wheres (4) - 9 freq oniewhere (4) - 1 freq onywhar (4) - 4 freq anywherr (4) - 1 freq nowhere (4) - 9 freq 'onywhere (4) - 1 freq naywhere (4) - 1 freq whores (5) - 2 freq naewhere (5) - 49 freq nothers (5) - 1 freq anywhur (5) - 2 freq unawares (5) - 5 freq nashers (5) - 2 freq whereas (5) - 8 freq onawaurs (5) - 1 freq anithers (5) - 5 freq nithers (5) - 1 freq anothers (5) - 1 freq onywhaur (5) - 58 freq oniewhaurs (5) - 3 freq onywhaar (5) - 1 freq |
SoundEx code - O562 ownership - 6 freq 'oonawaars' - 1 freq owners - 19 freq owners' - 1 freq owner's - 2 freq onywheres - 1 freq onerstaun - 1 freq onerstauns - 1 freq oniewhaurs - 3 freq ownerschip - 2 freq onnerstaun - 2 freq o'mirk - 1 freq oonregairded - 1 freq oonerstatement - 1 freq onroustit - 1 freq onawaurs - 1 freq onerous - 1 freq ownerÂ’s - 1 freq owenhargie - 1 freq oiomrxgiep - 1 freq |
MetaPhone code - ONHRS onywheres - 1 freq oniewhaurs - 3 freq |
ONYWHERES |
Time to execute Levenshtein function - 0.202418 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.372967 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.027700 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.038018 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.001132 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. |