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 ablow

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

Similar words to scotnorma in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
scotnorma (0) - 2 freq
scotarea (3) - 1 freq
scotorum (3) - 2 freq
connor (4) - 5 freq
scotsoun (4) - 18 freq
scotgov's (4) - 1 freq
sconir (4) - 1 freq
scottm (4) - 1 freq
scotamfa (4) - 19 freq
scoto (4) - 1 freq
scoors (4) - 2 freq
stroma (4) - 1 freq
scoter (4) - 1 freq
honoria (4) - 1 freq
scooren (4) - 2 freq
scoorie (4) - 3 freq
scotgovfm (4) - 6 freq
scoor (4) - 12 freq
stormt (4) - 1 freq
scottda (4) - 7 freq
connord (4) - 2 freq
stoma (4) - 5 freq
scotscores (4) - 3 freq
norma (4) - 2 freq
scotnight (4) - 2 freq
scotnorma (0) - 2 freq
scotorum (4) - 2 freq
scotarea (5) - 1 freq
scoter (6) - 1 freq
stroma (6) - 1 freq
scottyron (6) - 1 freq
scottories (6) - 21 freq
scotparl (6) - 4 freq
storme (6) - 1 freq
storm (6) - 125 freq
stormy (6) - 19 freq
scotspoem (6) - 2 freq
sconir (6) - 1 freq
scottr (6) - 2 freq
sconnered (6) - 1 freq
scottm (6) - 1 freq
scunnerin (7) - 8 freq
sector' (7) - 2 freq
schooner (7) - 2 freq
iscotnews (7) - 5 freq
scorem (7) - 1 freq
scatter (7) - 14 freq
astorm (7) - 1 freq
scottreid (7) - 1 freq
scenario (7) - 6 freq
SoundEx code - S356
sittin-room - 2 freq
stunnert - 1 freq
stane-haurd - 1 freq
stammert - 2 freq
stunner - 9 freq
stunners - 1 freq
stammered - 4 freq
steamers - 1 freq
steam-roller - 1 freq
staunnertised - 1 freq
steamer - 6 freq
staumer - 5 freq
staumerin - 1 freq
stammers - 4 freq
scoto-american - 2 freq
staunnerts - 2 freq
sittinroom - 1 freq
stammer - 1 freq
stumor - 1 freq
stumour - 2 freq
stumer - 3 freq
sitteen-room - 2 freq
stannèrts - 8 freq
stannèrt - 7 freq
stannarteised - 1 freq
stannart - 10 freq
stimmerie - 1 freq
shitmarack - 1 freq
stannarts- - 1 freq
stannarts - 6 freq
stannerts - 4 freq
stumoured - 1 freq
stammer't - 1 freq
staneweir - 1 freq
stannard - 1 freq
staunert - 2 freq
stane-wrocht - 1 freq
staunardised - 2 freq
staunart - 47 freq
sweetener - 1 freq
staunners - 1 freq
staunardisation - 8 freq
stannartisers - 1 freq
staunnards - 1 freq
€˜stannard - 1 freq
sittan-room - 1 freq
staunnart - 6 freq
stannert - 3 freq
stanework - 1 freq
stannertisation - 1 freq
stonewark - 1 freq
scotnorma - 2 freq
stannards - 1 freq
scotthenriksen - 1 freq
scotmarshy - 6 freq
staunnerdised - 1 freq
stemorry - 1 freq
staunertisashun - 1 freq
stmarksirvine - 1 freq
stammering - 1 freq
staunnert - 4 freq
sittinrooms - 1 freq
MetaPhone code - SKTNRM
scotnorma - 2 freq
SCOTNORMA
Time to execute Levenshtein function - 0.387656 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.636265 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.029097 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.070771 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.000902 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.