Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nearhan (0) - 28 freq nearhand (1) - 2 freq naarhan (1) - 17 freq nearhaun (1) - 68 freq nearan (1) - 1 freq nearin (2) - 6 freq narhaan (2) - 1 freq near-haun (2) - 5 freq reachan (2) - 3 freq rearan (2) - 1 freq near-on (2) - 2 freq teachan (2) - 1 freq learnan (2) - 2 freq hearan (2) - 14 freq nethan (2) - 3 freq neirhann (2) - 1 freq neathin (2) - 1 freq nearhaund (2) - 16 freq nathan (2) - 4 freq wearan (2) - 9 freq dartan (3) - 1 freq washan (3) - 3 freq earnin (3) - 7 freq beachin (3) - 1 freq markan (3) - 1 freq |
nearhan (0) - 28 freq nearhaun (1) - 68 freq naarhan (1) - 17 freq nearan (2) - 1 freq narhaan (2) - 1 freq nearhand (2) - 2 freq nearhaund (3) - 16 freq neathin (3) - 1 freq neirhann (3) - 1 freq near-on (3) - 2 freq nathan (3) - 4 freq nethan (3) - 3 freq near-haun (3) - 5 freq nearin (3) - 6 freq narhaund (4) - 1 freq neithen (4) - 3 freq neighin (4) - 1 freq neythin (4) - 1 freq arhin (4) - 1 freq nashin (4) - 3 freq na'hin (4) - 2 freq naehin (4) - 3 freq noarn (4) - 1 freq brahan (4) - 3 freq neithin (4) - 3 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 - NRHN nearhaun - 68 freq nearhan - 28 freq near-haun - 5 freq nerr-haun - 1 freq narhaan - 1 freq naarhan - 17 freq neirhann - 1 freq |
NEARHAN |
Time to execute Levenshtein function - 0.171241 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.355096 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.036132 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.038284 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.001000 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. |