| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| north (0) - 391 freq borth (1) - 73 freq noth (1) - 5 freq nort (1) - 53 freq worth (1) - 248 freq forth (1) - 80 freq noerth (1) - 1 freq noarth (1) - 23 freq sorts (2) - 70 freq nout (2) - 2 freq eirth (2) - 1 freq footh (2) - 4 freq nirts (2) - 2 freq yooth (2) - 6 freq south (2) - 88 freq werth (2) - 2 freq doth (2) - 9 freq goth (2) - 8 freq forts (2) - 3 freq porch (2) - 22 freq sortd (2) - 2 freq orta (2) - 1 freq nory (2) - 4 freq orti (2) - 1 freq forty (2) - 100 freq |
north (0) - 391 freq noarth (1) - 23 freq noerth (1) - 1 freq nairth (2) - 1 freq borth (2) - 73 freq nort (2) - 53 freq noth (2) - 5 freq forth (2) - 80 freq worth (2) - 248 freq norton (3) - 3 freq neath (3) - 4 freq yirth (3) - 41 freq worthy (3) - 21 freq wirth (3) - 89 freq herth (3) - 3 freq norther (3) - 3 freq irth (3) - 37 freq darth (3) - 3 freq routh (3) - 3 freq earth (3) - 251 freq garth (3) - 3 freq nith (3) - 12 freq hirth (3) - 1 freq berth (3) - 21 freq mirth (3) - 10 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 - NR0 north - 391 freq noarth - 23 freq noerth - 1 freq nairth' - 2 freq nairth - 1 freq |
NORTH |
| Time to execute Levenshtein function - 0.173838 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.344274 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.029679 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.042969 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.000886 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. |