| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nard (0) - 3 freq hard (1) - 782 freq bard (1) - 57 freq naard (1) - 1 freq card (1) - 61 freq lard (1) - 4 freq ard (1) - 4 freq yard (1) - 43 freq nord (1) - 1 freq eard (1) - 1 freq nark (1) - 1 freq narb (1) - 2 freq ward (1) - 89 freq nald (1) - 1 freq nar (1) - 15 freq sard (1) - 3 freq gard (1) - 4 freq nary (1) - 2 freq nare (1) - 1 freq nerd (1) - 2 freq haid (2) - 31 freq cawd (2) - 33 freq land (2) - 340 freq board (2) - 150 freq nain (2) - 5 freq |
nard (0) - 3 freq nord (1) - 1 freq naard (1) - 1 freq nerd (1) - 2 freq nar (2) - 15 freq nald (2) - 1 freq sard (2) - 3 freq nary (2) - 2 freq nare (2) - 1 freq ward (2) - 89 freq gard (2) - 4 freq neared (2) - 3 freq bard (2) - 57 freq hard (2) - 782 freq narb (2) - 2 freq lard (2) - 4 freq card (2) - 61 freq eard (2) - 1 freq ard (2) - 4 freq yard (2) - 43 freq nark (2) - 1 freq garde (3) - 1 freq kerd (3) - 1 freq beard (3) - 54 freq nears (3) - 3 freq |
SoundEx code - N630 north - 391 freq neruda - 1 freq nairriet - 1 freq ne'erday - 6 freq newerday - 1 freq norrad - 1 freq nard - 3 freq noarth - 23 freq nairret - 4 freq narrowed - 3 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 |
NARD |
| Time to execute Levenshtein function - 0.185074 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.340790 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.027239 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.036793 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.000982 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. |