| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| innerly (0) - 2 freq hinnerly (1) - 1 freq gingerly (2) - 2 freq unnerlay (2) - 1 freq mennerly (2) - 2 freq inner (2) - 44 freq innerlie (2) - 6 freq neerly (2) - 1 freq ainerly (2) - 2 freq anerly (2) - 7 freq mannerly (2) - 1 freq hinderly (2) - 1 freq linner (3) - 2 freq hinner (3) - 46 freq unnerwey (3) - 1 freq lanely (3) - 31 freq inny (3) - 3 freq knurly (3) - 1 freq inwartly (3) - 1 freq needly (3) - 4 freq unnerlie (3) - 1 freq sickerly (3) - 2 freq innes (3) - 14 freq dinner's (3) - 1 freq dinner (3) - 130 freq |
innerly (0) - 2 freq innerlie (2) - 6 freq unnerlay (2) - 1 freq hinnerly (2) - 1 freq anerly (3) - 7 freq mannerly (3) - 1 freq unnerlie (3) - 1 freq ainerly (3) - 2 freq neerly (3) - 1 freq inner (3) - 44 freq mennerly (3) - 2 freq unnerx (4) - 1 freq unnerwye (4) - 1 freq insnorl (4) - 1 freq nairly (4) - 1 freq onnly (4) - 37 freq hinnerlie (4) - 10 freq nearly (4) - 287 freq unnerin (4) - 1 freq unnerway (4) - 1 freq unnerlyin (4) - 6 freq unner (4) - 454 freq 'nearly (4) - 1 freq onner (4) - 3 freq anneal (4) - 2 freq |
SoundEx code - I564 innerlie - 6 freq immoral - 5 freq innerly - 2 freq innerleithen - 2 freq innerleithin - 1 freq |
MetaPhone code - INRL innerlie - 6 freq innerly - 2 freq |
INNERLY |
| Time to execute Levenshtein function - 0.228111 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.391859 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.029031 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.036940 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.000856 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. |