| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norms (0) - 5 freq norm (1) - 11 freq forms (1) - 113 freq gorms (1) - 2 freq worms (1) - 22 freq normo (1) - 1 freq norma (1) - 2 freq norns (1) - 7 freq holms (2) - 8 freq noons (2) - 1 freq wirms (2) - 13 freq rorys (2) - 1 freq nops (2) - 1 freq words (2) - 811 freq norn' (2) - 1 freq cords (2) - 5 freq norse (2) - 53 freq corrs (2) - 2 freq formt (2) - 2 freq poems (2) - 279 freq horns (2) - 43 freq firms (2) - 11 freq orts (2) - 3 freq nuris (2) - 1 freq ormi (2) - 3 freq |
norms (0) - 5 freq normous (2) - 2 freq norns (2) - 7 freq normo (2) - 1 freq norma (2) - 2 freq worms (2) - 22 freq norm (2) - 11 freq forms (2) - 113 freq gorms (2) - 2 freq normal (3) - 133 freq nrm (3) - 3 freq foarms (3) - 12 freq atrms (3) - 1 freq forums (3) - 4 freq nems (3) - 20 freq terms (3) - 133 freq nirts (3) - 2 freq enormous (3) - 17 freq wurms (3) - 3 freq perms (3) - 2 freq furms (3) - 9 freq aurms (3) - 1 freq norris (3) - 1 freq nories (3) - 25 freq enorm (3) - 11 freq |
SoundEx code - N652 norms - 5 freq norns - 7 freq nearmaist - 1 freq narrowing - 1 freq near-nyaakit - 1 freq neurons - 1 freq narrenschiff - 1 freq normous - 2 freq nairrowing - 1 freq nairns' - 1 freq near-enough - 1 freq near-incestuous - 1 freq neuromagnetic - 1 freq norriemacqueen - 1 freq |
MetaPhone code - NRMS norms - 5 freq normous - 2 freq |
NORMS |
| Time to execute Levenshtein function - 0.223186 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.406359 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.029936 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.038393 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.000949 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. |