| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nirls (0) - 1 freq birls (1) - 31 freq nirl (1) - 1 freq girls (1) - 59 freq tirls (1) - 4 freq dirls (1) - 7 freq nirlt (1) - 1 freq pirls (1) - 4 freq nirts (1) - 2 freq girs (2) - 4 freq wirld (2) - 73 freq nls (2) - 6 freq mills (2) - 33 freq nilly (2) - 1 freq gills (2) - 8 freq irs (2) - 1 freq dirks (2) - 4 freq wills (2) - 3 freq skirls (2) - 16 freq tirl (2) - 14 freq wires (2) - 27 freq oils (2) - 2 freq tills (2) - 4 freq dirl (2) - 46 freq aires (2) - 1 freq |
nirls (0) - 1 freq nirlt (2) - 1 freq nirts (2) - 2 freq dirls (2) - 7 freq pirls (2) - 4 freq tirls (2) - 4 freq nirl (2) - 1 freq birls (2) - 31 freq girls (2) - 59 freq nyirs (3) - 1 freq hurls (3) - 4 freq worls (3) - 5 freq nyirps (3) - 1 freq barls (3) - 1 freq nals (3) - 1 freq norln (3) - 1 freq gurls (3) - 1 freq nibals (3) - 1 freq pairls (3) - 4 freq snarls (3) - 7 freq nuris (3) - 1 freq intirls (3) - 1 freq nirse (3) - 1 freq norms (3) - 5 freq snorls (3) - 3 freq |
SoundEx code - N642 neurologist - 1 freq norloch - 1 freq nirls - 1 freq no-really-sweerin - 1 freq |
MetaPhone code - NRLS nirls - 1 freq |
NIRLS |
| Time to execute Levenshtein function - 0.217465 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.382619 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.028286 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.040635 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.000930 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. |