A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to normative in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
normative (0) - 1 freq
formative (1) - 2 freq
normalise (2) - 4 freq
informative (2) - 1 freq
hortative (2) - 1 freq
narrative (2) - 41 freq
formartine (3) - 1 freq
formation (3) - 11 freq
creative (3) - 102 freq
negative (3) - 41 freq
'narrative (3) - 1 freq
normalised (3) - 1 freq
nairrative (3) - 3 freq
comatie (3) - 2 freq
nairative (3) - 3 freq
vocative (3) - 1 freq
norration (3) - 1 freq
narratives (3) - 2 freq
normality (3) - 9 freq
non-native (3) - 2 freq
normandie (3) - 1 freq
'creative (3) - 4 freq
native (3) - 94 freq
moralise (4) - 1 freq
affirmative (4) - 2 freq
normative (0) - 1 freq
formative (2) - 2 freq
informative (3) - 1 freq
narrative (3) - 41 freq
nairrative (4) - 3 freq
nairative (4) - 3 freq
hortative (4) - 1 freq
normalise (4) - 4 freq
norration (5) - 1 freq
normality (5) - 9 freq
native (5) - 94 freq
primitive (5) - 4 freq
nairitive (5) - 1 freq
normandie (5) - 1 freq
narratives (5) - 2 freq
creative (5) - 102 freq
formation (5) - 11 freq
'narrative (5) - 1 freq
negative (5) - 41 freq
narratit (6) - 1 freq
fricative (6) - 17 freq
format (6) - 37 freq
locomotive (6) - 4 freq
normal (6) - 133 freq
inidcative (6) - 1 freq
SoundEx code - N653
nearhaund - 16 freq
neerendin - 1 freq
nearhaunthat's - 1 freq
ne'er-endin - 1 freq
neirhaund - 1 freq
naurhaund - 1 freq
narhaund - 1 freq
nearhand - 2 freq
normative - 1 freq
€˜naurhaund - 1 freq
MetaPhone code - NRMTF
normative - 1 freq
NORMATIVE
Time to execute Levenshtein function - 0.222661 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.383011 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.029157 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.039648 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.000969 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.