| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onkerry (0) - 13 freq kerry (2) - 47 freq skerry (2) - 7 freq overly (3) - 6 freq kerby (3) - 2 freq nerra (3) - 33 freq okey (3) - 1 freq gerry (3) - 13 freq 'ferry (3) - 1 freq nerr (3) - 9 freq l'derry (3) - 2 freq perry (3) - 17 freq conkers (3) - 3 freq skeery (3) - 1 freq berry (3) - 17 freq onieway (3) - 2 freq jerry (3) - 15 freq mockery (3) - 9 freq janwerry (3) - 1 freq connery (3) - 5 freq unker (3) - 4 freq snorry (3) - 1 freq caerry (3) - 2 freq derry (3) - 49 freq anerly (3) - 7 freq |
onkerry (0) - 13 freq kerry (3) - 47 freq skerry (3) - 7 freq auskerry (4) - 1 freq unker (4) - 4 freq kerr (4) - 31 freq nerr (4) - 9 freq onrr (4) - 1 freq skurry (4) - 1 freq nerra (4) - 33 freq bunkery (5) - 2 freq cookery (5) - 4 freq onkent (5) - 2 freq fakery (5) - 1 freq 'ferry (5) - 1 freq skerrs (5) - 2 freq terry (5) - 16 freq 'merry (5) - 1 freq cherry (5) - 25 freq cerry (5) - 7 freq kerrs (5) - 9 freq merry (5) - 69 freq i'cerry (5) - 2 freq kerby (5) - 2 freq onner (5) - 3 freq |
SoundEx code - O526 ooncertain - 1 freq onkerry - 13 freq ouncer - 1 freq oncertane - 1 freq onyquhaar - 1 freq omicron - 1 freq |
MetaPhone code - ONKR onkerry - 13 freq |
ONKERRY |
| Time to execute Levenshtein function - 0.192768 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.357173 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.028156 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.038618 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. |