| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neruda (0) - 1 freq merida (2) - 1 freq garuda (2) - 1 freq veruca (2) - 39 freq nerd (2) - 2 freq bermuda (2) - 2 freq nerra (2) - 33 freq needa (2) - 1 freq gerda (2) - 4 freq natura (3) - 1 freq rerun (3) - 1 freq derd (3) - 1 freq nero (3) - 1 freq nevur (3) - 1 freq nerrer (3) - 2 freq freda (3) - 2 freq gerunds (3) - 1 freq tertia (3) - 5 freq hera (3) - 12 freq nebdy (3) - 1 freq werna (3) - 13 freq heryd (3) - 1 freq verucca (3) - 2 freq nerrow (3) - 1 freq serug (3) - 3 freq |
neruda (0) - 1 freq nerd (2) - 2 freq needa (3) - 1 freq neared (3) - 3 freq nerra (3) - 33 freq gerda (3) - 4 freq nord (3) - 1 freq garuda (3) - 1 freq merida (3) - 1 freq nard (3) - 3 freq kerd (4) - 1 freq erd (4) - 11 freq unrade (4) - 1 freq corda (4) - 1 freq ferd (4) - 2 freq nude (4) - 4 freq hered (4) - 2 freq naebudy (4) - 2 freq trudy (4) - 1 freq nede (4) - 3 freq inertia (4) - 1 freq berde (4) - 2 freq yerd (4) - 7 freq rude (4) - 37 freq necd (4) - 2 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 |
NERUDA |
| Time to execute Levenshtein function - 0.369738 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.614348 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.029751 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.039868 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.000916 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. |