| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nairne (0) - 3 freq nairae (1) - 8 freq lairne (1) - 2 freq nairn (1) - 6 freq lairie (2) - 2 freq wairned (2) - 2 freq mairnt (2) - 1 freq nine (2) - 234 freq yairn (2) - 32 freq bairns (2) - 1518 freq lairn (2) - 134 freq yairns (2) - 14 freq maire (2) - 146 freq saire (2) - 4 freq kairn (2) - 1 freq arne (2) - 1 freq hairns (2) - 8 freq naime (2) - 7 freq sairie (2) - 22 freq nairrie (2) - 1 freq lairned (2) - 14 freq cairna (2) - 1 freq bairnie (2) - 70 freq nairaes (2) - 1 freq mairie (2) - 1 freq |
nairne (0) - 3 freq nairn (1) - 6 freq nairae (2) - 8 freq lairne (2) - 2 freq larne (3) - 19 freq norn (3) - 34 freq nair (3) - 2 freq raine (3) - 1 freq narrae (3) - 15 freq nairra (3) - 9 freq nain (3) - 5 freq carne (3) - 1 freq wairn (3) - 2 freq navyne (3) - 3 freq nane (3) - 547 freq airn (3) - 52 freq bairney (3) - 1 freq cairn (3) - 43 freq bairn (3) - 794 freq cairnie (3) - 2 freq narrie (3) - 1 freq narnia (3) - 1 freq noarn (3) - 1 freq sarne (3) - 1 freq nairoo (3) - 2 freq |
SoundEx code - N650 nearhaun - 69 freq nearhan - 28 freq near-on - 2 freq nearin - 6 freq narrowin - 5 freq nairne - 3 freq norm - 11 freq near-haun - 5 freq norn' - 1 freq norn - 34 freq nearan - 1 freq nerr-haun - 1 freq nairn - 6 freq noarn - 1 freq narhaan - 1 freq naarhan - 17 freq neirhann - 1 freq norma - 2 freq €œnorm - 1 freq narnia - 1 freq normo - 1 freq nrm - 3 freq |
MetaPhone code - NRN near-on - 2 freq nearin - 6 freq nairne - 3 freq norn' - 1 freq norn - 34 freq nearan - 1 freq nairn - 6 freq noarn - 1 freq narnia - 1 freq |
NAIRNE |
| Time to execute Levenshtein function - 0.481006 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.801529 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.100036 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.098848 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.000941 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. |