Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
near-at-haun (0) - 2 freq nearer-haun (3) - 1 freq near-haun (3) - 5 freq nearhaun (4) - 69 freq nerr-haun (4) - 1 freq near-be-gaan (4) - 1 freq nearesthaund (4) - 1 freq left-haun (5) - 9 freq first-haun (5) - 2 freq near-shut (5) - 2 freq ahint-haun (5) - 1 freq nearhan (5) - 28 freq stay-at-hame (5) - 1 freq fore-a-haun (5) - 1 freq naraeshun (5) - 1 freq aboot-haun (5) - 1 freq nearhaund (5) - 16 freq heir-at-law (5) - 2 freq nae-whaur (6) - 1 freq afore-haun (6) - 1 freq seratchin (6) - 2 freq narhaund (6) - 1 freq underataun (6) - 1 freq tear-arsin (6) - 1 freq second-haun (6) - 1 freq |
near-at-haun (0) - 2 freq near-haun (5) - 5 freq nearer-haun (5) - 1 freq nerr-haun (6) - 1 freq near-be-gaan (6) - 1 freq fore-a-haun (7) - 1 freq nearhaun (7) - 69 freq first-haun (7) - 2 freq nearesthaund (7) - 1 freq naraeshun (8) - 1 freq heir-at-law (8) - 2 freq stay-at-hame (8) - 1 freq aboot-haun (8) - 1 freq near-shut (8) - 2 freq nearhan (8) - 28 freq left-haun (8) - 9 freq ahint-haun (8) - 1 freq neathin (9) - 1 freq han-in-han (9) - 1 freq bide-at-hame (9) - 2 freq ear-tae-ear (9) - 1 freq nathan (9) - 4 freq richt-haun (9) - 6 freq breathan (9) - 4 freq far-han (9) - 2 freq |
SoundEx code - N635 northumbria-' - 4 freq northumbria - 10 freq near-at-haun - 2 freq northmen - 2 freq northumberland - 3 freq norton - 3 freq norration - 1 freq northumbria- - 1 freq noarthumbria - 1 freq northummerlaun - 1 freq northumbrian - 16 freq nortmaven - 1 freq northampton - 1 freq narration - 1 freq narrautioun - 1 freq nardini's - 1 freq northmaist - 1 freq northumb - 1 freq northmaven - 1 freq northumbrianrep - 1 freq |
MetaPhone code - NRTHN near-at-haun - 2 freq |
NEAR-AT-HAUN |
Time to execute Levenshtein function - 0.243726 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.431696 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.028967 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.040903 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.001094 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. |