| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| narrowin (0) - 4 freq harrowin (1) - 2 freq narrows (2) - 2 freq harrowing (2) - 1 freq harrowtn (2) - 1 freq burrowin (2) - 2 freq furrowin (2) - 1 freq narrow (2) - 14 freq borrowin (2) - 5 freq narrower (2) - 2 freq narrowed (2) - 3 freq narrowly (2) - 1 freq nairrowing (2) - 1 freq warrin (3) - 1 freq tarrin (3) - 1 freq caroosin (3) - 1 freq crowin (3) - 2 freq carron (3) - 4 freq barrin (3) - 7 freq narratit (3) - 1 freq yarrow (3) - 6 freq barrowman (3) - 1 freq harrow (3) - 2 freq growin (3) - 237 freq norrow (3) - 1 freq |
narrowin (0) - 4 freq harrowin (2) - 2 freq borrowin (3) - 5 freq narrower (3) - 2 freq nairrowing (3) - 1 freq narrow (3) - 14 freq narrowly (3) - 1 freq narrowed (3) - 3 freq furrowin (3) - 1 freq narrows (3) - 2 freq burrowin (3) - 2 freq nerrowed (4) - 1 freq norrowey (4) - 2 freq norrow (4) - 1 freq nerrow (4) - 1 freq norrowa (4) - 26 freq narration (4) - 1 freq nairrow (4) - 1 freq harrowtn (4) - 1 freq harrowing (4) - 1 freq norroway (4) - 7 freq srowin (5) - 1 freq barrowfu (5) - 2 freq jarrin (5) - 2 freq garrin (5) - 35 freq |
SoundEx code - N650 nearhaun - 68 freq nearhan - 28 freq near-on - 2 freq nearin - 6 freq norm - 10 freq nairne - 2 freq near-haun - 5 freq norn' - 1 freq norn - 34 freq narrowin - 4 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 - NRWN narrowin - 4 freq |
NARROWIN |
| Time to execute Levenshtein function - 0.388686 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.593428 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.030469 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.084581 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.000838 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. |