Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
noerth (0) - 1 freq north (1) - 402 freq noarth (1) - 23 freq fowrth (2) - 2 freq nairth (2) - 1 freq werth (2) - 2 freq neth (2) - 5 freq borth (2) - 73 freq noth (2) - 5 freq neath (2) - 4 freq berth (2) - 21 freq perth (2) - 41 freq fowerth (2) - 6 freq derth (2) - 2 freq fourth (2) - 34 freq erth (2) - 3 freq worth (2) - 251 freq forth (2) - 82 freq nort (2) - 53 freq loert (2) - 2 freq herth (2) - 3 freq foarth (2) - 1 freq nerp (3) - 1 freq freith (3) - 2 freq nest (3) - 81 freq |
noerth (0) - 1 freq north (1) - 402 freq noarth (1) - 23 freq nairth (2) - 1 freq erth (3) - 3 freq worth (3) - 251 freq fourth (3) - 34 freq foarth (3) - 1 freq derth (3) - 2 freq herth (3) - 3 freq forth (3) - 82 freq nort (3) - 53 freq neth (3) - 5 freq werth (3) - 2 freq noth (3) - 5 freq borth (3) - 73 freq perth (3) - 41 freq berth (3) - 21 freq neath (3) - 4 freq wirth (4) - 91 freq i'north (4) - 1 freq bairth (4) - 1 freq yirth (4) - 43 freq unnerthe (4) - 1 freq hearth (4) - 30 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 - NR0 north - 402 freq noarth - 23 freq noerth - 1 freq nairth' - 2 freq nairth - 1 freq |
NOERTH |
Time to execute Levenshtein function - 0.214332 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.448799 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.030418 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.037808 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.000919 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. |