| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oniewhaur (0) - 16 freq oniewhur (1) - 1 freq oniewhaurs (1) - 3 freq oniewhar (1) - 2 freq onie-whaur (1) - 1 freq ontewhaur (1) - 1 freq naewhaur (2) - 57 freq onywhaur (2) - 58 freq nae-whaur (3) - 1 freq elsewhaur (3) - 13 freq innywhaur (3) - 1 freq onniewhare (3) - 1 freq onie-hou (3) - 7 freq anywhaur (3) - 2 freq naewhar (3) - 3 freq somewhaur (3) - 72 freq naewhaar (3) - 3 freq onywhar (3) - 4 freq oniemair (3) - 4 freq onywhaar (3) - 1 freq nowhaur (3) - 1 freq naewhair (3) - 1 freq onieways (3) - 1 freq naewhaurs (3) - 1 freq oniewhere (3) - 1 freq |
oniewhaur (0) - 16 freq oniewhar (1) - 2 freq oniewhur (1) - 1 freq onywhaur (2) - 58 freq ontewhaur (2) - 1 freq naewhaur (2) - 57 freq onie-whaur (2) - 1 freq oniewhaurs (2) - 3 freq nowhaur (3) - 1 freq onywhaar (3) - 1 freq naewhair (3) - 1 freq oniewhere (3) - 1 freq naewhaar (3) - 3 freq naewhur (3) - 4 freq onywhar (3) - 4 freq anywhaur (3) - 2 freq naewhar (3) - 3 freq anywhar (4) - 2 freq oniwhere (4) - 1 freq naewher (4) - 4 freq naewahr (4) - 1 freq anywhur (4) - 2 freq nae-whaur (4) - 1 freq innywhaur (4) - 1 freq nowhar (4) - 4 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 |
ONIEWHAUR |
| Time to execute Levenshtein function - 0.230580 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.366673 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.027916 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.037198 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.000876 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. |