| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naard (0) - 1 freq haard (1) - 17 freq waard (1) - 2 freq nard (1) - 3 freq naar (1) - 7 freq guard (2) - 38 freq nare (2) - 1 freq nauld (2) - 3 freq vaar (2) - 1 freq haad (2) - 71 freq waa'd (2) - 2 freq faird (2) - 3 freq baar (2) - 6 freq nord (2) - 1 freq baand (2) - 13 freq naan (2) - 2 freq aa'd (2) - 2 freq beard (2) - 54 freq laar (2) - 2 freq snaad (2) - 1 freq garrd (2) - 3 freq laird (2) - 172 freq maa'd (2) - 1 freq saand (2) - 13 freq kyard (2) - 3 freq |
naard (0) - 1 freq nard (1) - 3 freq neared (2) - 3 freq nerd (2) - 2 freq nord (2) - 1 freq naar (2) - 7 freq haard (2) - 17 freq waard (2) - 2 freq daared (3) - 2 freq hoard (3) - 9 freq nears (3) - 3 freq bard (3) - 57 freq haird (3) - 124 freq narra (3) - 38 freq narb (3) - 2 freq gard (3) - 4 freq daurd (3) - 1 freq naur (3) - 10 freq board (3) - 150 freq peard (3) - 1 freq naebd (3) - 1 freq raird (3) - 1 freq gaird (3) - 60 freq ard (3) - 4 freq hard (3) - 782 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 |
NAARD |
| Time to execute Levenshtein function - 0.176417 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.422068 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.028644 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.075992 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.000883 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. |