Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nairth (0) - 1 freq pairth (1) - 1 freq bairth (1) - 1 freq nairth' (1) - 2 freq airth (1) - 11 freq dairth (1) - 1 freq hairth (1) - 26 freq pairt' (2) - 3 freq wailth (2) - 1 freq rairt (2) - 1 freq raith (2) - 9 freq daith (2) - 294 freq tairt (2) - 3 freq warth (2) - 64 freq pairty (2) - 293 freq garth (2) - 3 freq dairt (2) - 6 freq airts (2) - 356 freq nairly (2) - 1 freq fairt (2) - 26 freq sairch (2) - 7 freq saith (2) - 2 freq firth (2) - 46 freq dairts (2) - 2 freq wirth (2) - 91 freq |
nairth (0) - 1 freq north (2) - 402 freq noerth (2) - 1 freq dairth (2) - 1 freq noarth (2) - 23 freq hairth (2) - 26 freq pairth (2) - 1 freq bairth (2) - 1 freq nairth' (2) - 2 freq airth (2) - 11 freq nirt (3) - 1 freq mirth (3) - 12 freq mairtha (3) - 3 freq anaith (3) - 7 freq eirth (3) - 1 freq ninth (3) - 10 freq yirth (3) - 43 freq wirth (3) - 91 freq girth (3) - 5 freq nirts (3) - 2 freq earth (3) - 253 freq firth (3) - 46 freq garth (3) - 3 freq irth (3) - 37 freq warth (3) - 64 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 |
NAIRTH |
Time to execute Levenshtein function - 0.487517 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.703342 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.032048 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.083161 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. |