| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nirl (0) - 1 freq birl (1) - 92 freq pirl (1) - 7 freq niro (1) - 1 freq niel (1) - 1 freq nirt (1) - 1 freq girl (1) - 73 freq nirls (1) - 1 freq dirl (1) - 45 freq nial (1) - 4 freq tirl (1) - 14 freq nirlt (1) - 1 freq nrl (1) - 1 freq nil (1) - 7 freq mirl (1) - 1 freq nir (1) - 49 freq nied (2) - 3 freq wirs (2) - 4 freq wirk (2) - 334 freq yill (2) - 59 freq swirl (2) - 16 freq 'ill (2) - 4 freq mirk (2) - 154 freq ir' (2) - 4 freq dire (2) - 9 freq |
nirl (0) - 1 freq nrl (1) - 1 freq nirlt (2) - 1 freq tirl (2) - 14 freq mirl (2) - 1 freq nairly (2) - 1 freq nial (2) - 4 freq nil (2) - 7 freq nir (2) - 49 freq niro (2) - 1 freq pirl (2) - 7 freq birl (2) - 92 freq dirl (2) - 45 freq niel (2) - 1 freq girl (2) - 73 freq nirt (2) - 1 freq nirls (2) - 1 freq nr (3) - 8 freq nur (3) - 61 freq warl (3) - 164 freq nark (3) - 1 freq purl (3) - 3 freq neri (3) - 3 freq carl (3) - 13 freq noel (3) - 1 freq |
SoundEx code - N640 nearly - 287 freq narrowly - 1 freq near-low - 1 freq 'nearly - 1 freq nirl - 1 freq narraly - 1 freq nairly - 1 freq nrl - 1 freq neerly - 1 freq |
MetaPhone code - NRL nearly - 287 freq knurl - 2 freq narrowly - 1 freq near-low - 1 freq 'nearly - 1 freq knurlie - 1 freq nirl - 1 freq knurly - 1 freq narraly - 1 freq nairly - 1 freq nrl - 1 freq neerly - 1 freq |
NIRL |
| Time to execute Levenshtein function - 0.197039 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.344451 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.027305 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.036684 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.000897 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. |