| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nirlt (0) - 1 freq birlt (1) - 25 freq nirt (1) - 1 freq mirlt (1) - 1 freq nirl (1) - 1 freq nirls (1) - 1 freq dirlt (1) - 4 freq tirlt (1) - 2 freq nilly (2) - 1 freq night (2) - 923 freq eurlt (2) - 1 freq birl't (2) - 1 freq kirnt (2) - 2 freq kilt (2) - 67 freq hurlt (2) - 3 freq dirlit (2) - 1 freq airnt (2) - 1 freq birly (2) - 10 freq nurst (2) - 2 freq curlt (2) - 7 freq girly (2) - 1 freq hilt (2) - 2 freq fillt (2) - 52 freq nirse (2) - 1 freq smirlt (2) - 1 freq |
nirlt (0) - 1 freq nirls (2) - 1 freq tirlt (2) - 2 freq nirl (2) - 1 freq dirlt (2) - 4 freq mirlt (2) - 1 freq birlt (2) - 25 freq nirt (2) - 1 freq snarlt (3) - 1 freq nairly (3) - 1 freq knurlt (3) - 1 freq nolt (3) - 1 freq harlt (3) - 5 freq norat (3) - 1 freq marlt (3) - 2 freq pairlt (3) - 1 freq burlt (3) - 1 freq birlit (3) - 2 freq norln (3) - 1 freq nailt (3) - 2 freq snorlt (3) - 2 freq firlot (3) - 2 freq nrl (3) - 1 freq dirlit (3) - 1 freq nort (3) - 53 freq |
SoundEx code - N643 nirlt - 1 freq |
MetaPhone code - NRLT gnarled - 4 freq gnurlit - 3 freq knarled - 1 freq nirlt - 1 freq knurlt - 1 freq knurlied - 1 freq |
NIRLT |
| Time to execute Levenshtein function - 0.187100 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.389609 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.027939 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.043690 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.003285 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. |