| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onywhere (0) - 27 freq onywheres (1) - 1 freq anywhere (1) - 33 freq oniwhere (1) - 1 freq 'onywhere (1) - 1 freq onywhar (2) - 4 freq naywhere (2) - 1 freq anywherr (2) - 1 freq nowhere (2) - 9 freq oniewhere (2) - 1 freq erywhere (2) - 1 freq onywie (3) - 3 freq €˜where (3) - 15 freq onyene (3) - 1 freq naewhere (3) - 49 freq onyweiy (3) - 8 freq where (3) - 739 freq anhere (3) - 1 freq onytheen (3) - 3 freq onywyes (3) - 2 freq €œwhere (3) - 3 freq anywhur (3) - 2 freq onywhaur (3) - 58 freq onywey (3) - 166 freq onywely (3) - 4 freq |
onywhere (0) - 27 freq oniwhere (1) - 1 freq anywhere (1) - 33 freq oniewhere (2) - 1 freq nowhere (2) - 9 freq naywhere (2) - 1 freq onywhar (2) - 4 freq 'onywhere (2) - 1 freq onywheres (2) - 1 freq naewhere (3) - 49 freq anywhar (3) - 2 freq anywhur (3) - 2 freq erywhere (3) - 1 freq onywhaur (3) - 58 freq anywherr (3) - 1 freq onywhaar (3) - 1 freq onyither (4) - 2 freq 'naewhere (4) - 1 freq 'where (4) - 15 freq onnher (4) - 1 freq oniewhar (4) - 2 freq anywhaur (4) - 2 freq a'where (4) - 1 freq where (4) - 739 freq anhere (4) - 1 freq |
SoundEx code - O560 onywhere - 27 freq oniewhaur - 16 freq owner - 28 freq onywhaur - 58 freq oneywury - 1 freq onner - 3 freq onywhar - 4 freq oniewhur - 1 freq oniewhar - 2 freq ooner - 2 freq 'onywhere - 1 freq one-year - 1 freq oniewhere - 1 freq onywhaar - 1 freq onnir - 1 freq ownur - 1 freq onie-whaur - 1 freq onniewhare - 1 freq onnher - 1 freq oÂ’humour - 1 freq onrr - 1 freq oniwhere - 1 freq |
MetaPhone code - ONHR onywhere - 27 freq oniewhaur - 16 freq onywhaur - 58 freq onywhar - 4 freq oniewhur - 1 freq oniewhar - 2 freq 'onywhere - 1 freq oniewhere - 1 freq onywhaar - 1 freq onie-whaur - 1 freq onniewhare - 1 freq onnher - 1 freq oniwhere - 1 freq |
ONYWHERE |
| Time to execute Levenshtein function - 0.185752 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.389871 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.034935 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.047665 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.001225 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. |