| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onywhaur (0) - 58 freq onywhaar (1) - 1 freq anywhaur (1) - 2 freq onywhar (1) - 4 freq innywhaur (2) - 1 freq nowhaur (2) - 1 freq ontewhaur (2) - 1 freq oniewhaur (2) - 16 freq anywhur (2) - 2 freq anywhar (2) - 2 freq naewhaur (3) - 57 freq oniewhaurs (3) - 3 freq nowhar (3) - 4 freq sumwhaur (3) - 6 freq onymair (3) - 38 freq €œwhaur (3) - 15 freq onawaurs (3) - 1 freq aawhaur (3) - 5 freq onywhere (3) - 27 freq onyquhaar (3) - 1 freq onywan (3) - 19 freq onywuy (3) - 1 freq somewhaur (3) - 72 freq anywherr (3) - 1 freq any-whar (3) - 1 freq |
onywhaur (0) - 58 freq onywhaar (1) - 1 freq onywhar (1) - 4 freq anywhaur (1) - 2 freq anywhur (2) - 2 freq anywhar (2) - 2 freq oniewhaur (2) - 16 freq nowhaur (2) - 1 freq onywhere (3) - 27 freq oniewhar (3) - 2 freq oniewhur (3) - 1 freq nowhar (3) - 4 freq ontewhaur (3) - 1 freq naewhaur (3) - 57 freq innywhaur (3) - 1 freq awhaur (4) - 2 freq a'whaur (4) - 1 freq whaur (4) - 1972 freq 'whaur (4) - 24 freq naewhaar (4) - 3 freq anywhere (4) - 33 freq onie-whaur (4) - 1 freq naewhair (4) - 1 freq oniwhere (4) - 1 freq any-whar (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 |
ONYWHAUR |
| Time to execute Levenshtein function - 0.204188 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.326964 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.027297 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.037110 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.000984 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. |