| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owerly (0) - 1 freq owerby (1) - 9 freq owerlay (1) - 1 freq overly (1) - 6 freq swirly (2) - 2 freq wely (2) - 1 freq owerbye (2) - 3 freq peerly (2) - 1 freq everly (2) - 1 freq oweraw (2) - 7 freq overtly (2) - 1 freq owerlap (2) - 3 freq ower' (2) - 1 freq owers (2) - 2 freq anerly (2) - 7 freq aerly (2) - 19 freq openly (2) - 11 freq erly (2) - 3 freq neerly (2) - 1 freq ferly (2) - 20 freq owey (2) - 1 freq ower's (2) - 2 freq orderly (2) - 4 freq owray (2) - 1 freq swerry (2) - 1 freq |
owerly (0) - 1 freq owerlay (1) - 1 freq owerby (2) - 9 freq overly (2) - 6 freq seerly (3) - 13 freq swurly (3) - 1 freq welly (3) - 5 freq ower- (3) - 1 freq wery (3) - 1 freq sweerly (3) - 1 freq oweraa (3) - 5 freq awely (3) - 8 freq worl (3) - 35 freq warl (3) - 164 freq wurl (3) - 2 freq wearily (3) - 1 freq wryly (3) - 1 freq warle (3) - 1 freq ower (3) - 6285 freq owray (3) - 1 freq awery (3) - 1 freq wrily (3) - 1 freq ower' (3) - 1 freq owers (3) - 2 freq anerly (3) - 7 freq |
SoundEx code - O640 orral - 6 freq oral - 23 freq orwell - 4 freq orally - 2 freq owerly - 1 freq owerlay - 1 freq oorwullie - 2 freq oreilly - 1 freq |
MetaPhone code - OWRL owerly - 1 freq owerlay - 1 freq |
OWERLY |
| Time to execute Levenshtein function - 0.466167 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.899555 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.031735 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.071817 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.001253 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. |