| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bairns (1) - 1518 freq nairn (1) - 6 freq hairns (1) - 8 freq lairns (1) - 7 freq yairns (1) - 14 freq cairns (1) - 13 freq nairns' (1) - 1 freq wairns (1) - 1 freq nairne (1) - 3 freq hains (2) - 5 freq naips (2) - 1 freq cairna (2) - 1 freq yaarns (2) - 1 freq bairn's (2) - 37 freq pairls (2) - 4 freq aircs (2) - 1 freq nain (2) - 5 freq yarns (2) - 28 freq fairms (2) - 17 freq airts (2) - 356 freq ains (2) - 15 freq lairs (2) - 15 freq cairts (2) - 34 freq pairins (2) - 1 freq kairn (2) - 1 freq |
nairns' (2) - 1 freq nairne (2) - 3 freq norns (2) - 7 freq bairns (2) - 1518 freq cairns (2) - 13 freq wairns (2) - 1 freq yairns (2) - 14 freq hairns (2) - 8 freq lairns (2) - 7 freq nairn (2) - 6 freq laerns (3) - 4 freq neurons (3) - 1 freq birns (3) - 3 freq fairins (3) - 7 freq bairnis (3) - 6 freq baerns (3) - 1 freq earns (3) - 3 freq tarns (3) - 1 freq kirns (3) - 2 freq tirns (3) - 4 freq nirts (3) - 2 freq darns (3) - 1 freq nirls (3) - 1 freq nans (3) - 3 freq larns (3) - 1 freq |
SoundEx code - N652 norms - 5 freq norns - 7 freq nearmaist - 1 freq narrowing - 1 freq near-nyaakit - 1 freq neurons - 1 freq narrenschiff - 1 freq normous - 2 freq nairrowing - 1 freq nairns' - 1 freq near-enough - 1 freq near-incestuous - 1 freq neuromagnetic - 1 freq norriemacqueen - 1 freq |
MetaPhone code - NRNS norns - 7 freq neurons - 1 freq nairns' - 1 freq |
NAIRNS |
| Time to execute Levenshtein function - 0.194405 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.370891 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.028117 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.037677 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.001196 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. |