| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norat (0) - 1 freq nort (1) - 53 freq nooat (1) - 1 freq corat (1) - 1 freq noat (1) - 6 freq nora (1) - 6 freq nouat (1) - 1 freq morag (2) - 47 freq normo (2) - 1 freq 'rat (2) - 1 freq format (2) - 37 freq noak (2) - 3 freq o'at (2) - 1 freq norma (2) - 2 freq fort (2) - 39 freq noad (2) - 11 freq nor' (2) - 1 freq poat (2) - 3 freq grat (2) - 59 freq nolt (2) - 1 freq porrt (2) - 1 freq foraa (2) - 1 freq carat (2) - 1 freq neat (2) - 44 freq hoat (2) - 50 freq |
norat (0) - 1 freq nort (1) - 53 freq nirt (2) - 1 freq nora (2) - 6 freq nouat (2) - 1 freq noat (2) - 6 freq corat (2) - 1 freq nooat (2) - 1 freq nout (3) - 2 freq nowt (3) - 116 freq nor (3) - 1978 freq norm (3) - 11 freq nott (3) - 55 freq not (3) - 733 freq unrit (3) - 1 freq norge (3) - 1 freq hort (3) - 5 freq ort (3) - 2 freq notae (3) - 1 freq noreast (3) - 2 freq foryat (3) - 2 freq noust (3) - 2 freq noost (3) - 4 freq wort (3) - 1 freq north (3) - 402 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 |
NORAT |
| Time to execute Levenshtein function - 0.192616 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.641042 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.029932 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.061547 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.001153 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. |