| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onywhar (0) - 4 freq onywhaar (1) - 1 freq anywhar (1) - 2 freq onywhaur (1) - 58 freq onywhere (2) - 27 freq any-whar (2) - 1 freq nowhar (2) - 4 freq anywhur (2) - 2 freq onywan (2) - 19 freq oniewhar (2) - 2 freq anywhaur (2) - 2 freq onyway (2) - 22 freq onywi (3) - 3 freq onymare (3) - 2 freq onywety (3) - 1 freq onywy (3) - 5 freq onward (3) - 5 freq onyweiy (3) - 8 freq onywely (3) - 4 freq onywyes (3) - 2 freq somewhar (3) - 7 freq oanyway (3) - 2 freq anywherr (3) - 1 freq onywie (3) - 3 freq anywhere (3) - 33 freq |
onywhar (0) - 4 freq onywhaur (1) - 58 freq anywhar (1) - 2 freq onywhaar (1) - 1 freq oniewhar (2) - 2 freq anywhur (2) - 2 freq anywhaur (2) - 2 freq nowhar (2) - 4 freq onywhere (2) - 27 freq nowhaur (3) - 1 freq oniewhaur (3) - 16 freq oniwhere (3) - 1 freq oniewhur (3) - 1 freq anywhere (3) - 33 freq naewhar (3) - 3 freq any-whar (3) - 1 freq oniewhere (4) - 1 freq onnher (4) - 1 freq naewhaar (4) - 3 freq ontewhaur (4) - 1 freq naywhere (4) - 1 freq 'onywhere (4) - 1 freq naewhur (4) - 4 freq naewher (4) - 4 freq naewhair (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 ohumour - 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 |
ONYWHAR |
| Time to execute Levenshtein function - 0.206873 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.367679 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.029582 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.037642 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.001003 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. |