Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nord (0) - 1 freq norm (1) - 11 freq nort (1) - 53 freq norn (1) - 34 freq nor' (1) - 1 freq norr (1) - 3 freq nerd (1) - 2 freq cord (1) - 18 freq nory (1) - 4 freq ford (1) - 13 freq word (1) - 711 freq nod (1) - 111 freq nor (1) - 1978 freq gord (1) - 1 freq nora (1) - 6 freq lord (1) - 404 freq noad (1) - 11 freq bord (1) - 2 freq kord (1) - 2 freq nard (1) - 3 freq nerp (2) - 1 freq oro (2) - 1 freq nerr (2) - 9 freq boru (2) - 6 freq noel (2) - 1 freq |
nord (0) - 1 freq nerd (1) - 2 freq nard (1) - 3 freq nor (2) - 1978 freq nora (2) - 6 freq gord (2) - 1 freq lord (2) - 404 freq noad (2) - 11 freq naard (2) - 1 freq bord (2) - 2 freq nod (2) - 111 freq kord (2) - 2 freq nort (2) - 53 freq word (2) - 711 freq norm (2) - 11 freq nor' (2) - 1 freq norn (2) - 34 freq cord (2) - 18 freq nory (2) - 4 freq norr (2) - 3 freq ford (2) - 13 freq gird (3) - 48 freq neruda (3) - 1 freq nemd (3) - 1 freq kerd (3) - 1 freq |
SoundEx code - N630 north - 402 freq neruda - 1 freq nairriet - 1 freq ne'erday - 6 freq newerday - 1 freq norrad - 1 freq nard - 3 freq narrowed - 5 freq noarth - 23 freq nairret - 4 freq nort - 53 freq narrate - 3 freq nirt - 1 freq nord - 1 freq narra'd - 1 freq noerth - 1 freq nairth' - 2 freq neared - 3 freq naard - 1 freq naerraed - 1 freq nairth - 1 freq norat - 1 freq narrete - 1 freq narraed - 1 freq nerrowed - 1 freq near-white - 1 freq nerd - 2 freq nairraed - 2 freq newerdy - 6 freq |
MetaPhone code - NRT neruda - 1 freq nairriet - 1 freq ne'erday - 6 freq norrad - 1 freq nard - 3 freq nairret - 4 freq nort - 53 freq narrate - 3 freq nirt - 1 freq nord - 1 freq narra'd - 1 freq neared - 3 freq naard - 1 freq naerraed - 1 freq norat - 1 freq narrete - 1 freq narraed - 1 freq nerd - 2 freq nairraed - 2 freq gnarred - 1 freq |
NORD |
Time to execute Levenshtein function - 0.413845 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.511702 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.027904 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.040584 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.000940 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. |