| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| near-haun (0) - 5 freq nearhaun (1) - 69 freq nerr-haun (1) - 1 freq nearhan (2) - 28 freq nearhaund (2) - 16 freq nearer-haun (2) - 1 freq nearan (3) - 1 freq neirhaund (3) - 1 freq far-han (3) - 2 freq neirhann (3) - 1 freq near-shut (3) - 2 freq naarhan (3) - 17 freq dab-haun (3) - 1 freq near-high (3) - 1 freq left-haun (3) - 9 freq narhaund (3) - 1 freq narhaan (3) - 1 freq near-on (3) - 2 freq nearhand (3) - 2 freq near-at-haun (3) - 2 freq near-seen (3) - 1 freq nae-whaur (4) - 1 freq peat-hags (4) - 4 freq learnan (4) - 2 freq year-en (4) - 1 freq |
near-haun (0) - 5 freq nerr-haun (2) - 1 freq nearhaun (2) - 69 freq nearer-haun (3) - 1 freq nearhan (3) - 28 freq near-seen (4) - 1 freq near-on (4) - 2 freq far-han (4) - 2 freq nearhaund (4) - 16 freq narhaan (4) - 1 freq naarhan (4) - 17 freq afore-haun (5) - 1 freq narhaund (5) - 1 freq near-at-haun (5) - 2 freq nearhand (5) - 2 freq neirhann (5) - 1 freq nearan (5) - 1 freq near-shut (5) - 2 freq neirhaund (5) - 1 freq near-high (5) - 1 freq dab-haun (5) - 1 freq year-roon (6) - 1 freq nearin (6) - 6 freq reachan (6) - 3 freq norlaun (6) - 1 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 - NRHN nearhaun - 69 freq nearhan - 28 freq near-haun - 5 freq nerr-haun - 1 freq narhaan - 1 freq naarhan - 17 freq neirhann - 1 freq |
NEAR-HAUN |
| Time to execute Levenshtein function - 0.521791 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.758270 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.028874 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.088607 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.000870 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. |