| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nort (0) - 53 freq nirt (1) - 1 freq nolt (1) - 1 freq norm (1) - 11 freq nory (1) - 4 freq nord (1) - 1 freq not (1) - 733 freq oort (1) - 8 freq nor (1) - 1978 freq nora (1) - 6 freq wort (1) - 1 freq nor' (1) - 1 freq sort (1) - 310 freq norat (1) - 1 freq north (1) - 402 freq nout (1) - 2 freq dort (1) - 2 freq mort (1) - 3 freq port (1) - 70 freq nowt (1) - 116 freq norr (1) - 3 freq snort (1) - 8 freq hort (1) - 5 freq noat (1) - 6 freq ort (1) - 2 freq |
nort (0) - 53 freq nirt (1) - 1 freq norat (1) - 1 freq norr (2) - 3 freq nowt (2) - 116 freq port (2) - 70 freq hort (2) - 5 freq mort (2) - 3 freq ort (2) - 2 freq norn (2) - 34 freq inert (2) - 3 freq fort (2) - 39 freq nott (2) - 55 freq dort (2) - 2 freq noat (2) - 6 freq snort (2) - 8 freq not (2) - 733 freq oort (2) - 8 freq nord (2) - 1 freq nory (2) - 4 freq nolt (2) - 1 freq nout (2) - 2 freq nor (2) - 1978 freq norm (2) - 11 freq sort (2) - 310 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 |
NORT |
| Time to execute Levenshtein function - 0.282339 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.520520 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.034623 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.083106 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.001204 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. |