| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owerby (0) - 9 freq owerbye (1) - 3 freq owerly (1) - 1 freq swerry (2) - 1 freq ower' (2) - 1 freq ower's (2) - 2 freq ower- (2) - 1 freq owerlay (2) - 1 freq derby (2) - 13 freq owers (2) - 2 freq kerby (2) - 2 freq owreby (2) - 2 freq oweraa (2) - 5 freq wery (2) - 1 freq awery (2) - 1 freq owey (2) - 1 freq €˜owerby (2) - 1 freq ower't (2) - 2 freq oweraw (2) - 7 freq fowerty (2) - 5 freq owre-by (2) - 1 freq overty (2) - 1 freq 'derby (2) - 1 freq overly (2) - 6 freq webby (2) - 1 freq |
owerby (0) - 9 freq owerbye (1) - 3 freq owerly (2) - 1 freq owreby (2) - 2 freq wery (3) - 1 freq awery (3) - 1 freq oweraa (3) - 5 freq ower (3) - 6224 freq owray (3) - 1 freq webby (3) - 1 freq oweraw (3) - 7 freq owre-by (3) - 1 freq ower- (3) - 1 freq kerby (3) - 2 freq owerlay (3) - 1 freq ower' (3) - 1 freq owers (3) - 2 freq derby (3) - 13 freq whereby (4) - 1 freq herb (4) - 2 freq owr (4) - 1 freq owir (4) - 7 freq wurry (4) - 3 freq hereby (4) - 3 freq naurby (4) - 2 freq |
SoundEx code - O610 owerby - 9 freq owerbye - 3 freq orpah - 2 freq owerview - 10 freq ower-ripe - 1 freq orb - 2 freq owreby - 2 freq oorbye - 1 freq orive - 1 freq owre-by - 1 freq orf - 20 freq €˜owerby - 1 freq |
MetaPhone code - OWRB owerby - 9 freq €˜owerby - 1 freq |
OWERBY |
| Time to execute Levenshtein function - 0.374328 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.521867 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.059456 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.038973 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.000808 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. |