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 unshared in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unshared (0) - 1 freq
unspared (1) - 1 freq
unsered (2) - 1 freq
ushare (2) - 1 freq
unashamed (2) - 3 freq
ushered (2) - 5 freq
unspaed (2) - 1 freq
unphased (2) - 1 freq
unswered (2) - 4 freq
ensnared (2) - 2 freq
shared (2) - 87 freq
unsaed (2) - 1 freq
share (3) - 285 freq
neared (3) - 3 freq
shaired (3) - 3 freq
unthwarted (3) - 1 freq
'soared (3) - 1 freq
share' (3) - 1 freq
'ushare' (3) - 1 freq
unfazed (3) - 1 freq
untamed (3) - 1 freq
shaaed (3) - 3 freq
unfaaled (3) - 2 freq
unsolved (3) - 2 freq
unmarked (3) - 1 freq
unshared (0) - 1 freq
unspared (2) - 1 freq
unswered (3) - 4 freq
shared (3) - 87 freq
ushered (3) - 5 freq
ensnared (3) - 2 freq
unashamed (3) - 3 freq
unsered (3) - 1 freq
unheard (4) - 8 freq
inspired (4) - 50 freq
answered (4) - 116 freq
shired (4) - 5 freq
shard (4) - 2 freq
sheared (4) - 6 freq
unshair (4) - 3 freq
unherd (4) - 2 freq
anchored (4) - 10 freq
enshore (4) - 2 freq
shred (4) - 1 freq
insured (4) - 3 freq
unphased (4) - 1 freq
shaired (4) - 3 freq
unspaed (4) - 1 freq
unsaed (4) - 1 freq
ushare (4) - 1 freq
SoundEx code - U526
unswered - 4 freq
unsered - 1 freq
unscrewed - 3 freq
unswers - 1 freq
unswer - 6 freq
ungairded - 1 freq
uncertaintie - 2 freq
unicorns - 9 freq
unker - 4 freq
unser - 3 freq
ungert - 1 freq
uncracked - 1 freq
uncharmin - 1 freq
uncarbonated - 1 freq
uncertamty - 1 freq
ungroomed - 1 freq
unicorn - 61 freq
uncarin - 3 freq
unsure - 6 freq
uncharacteristically - 2 freq
ungaretti - 1 freq
unguardit - 1 freq
uncertainty - 7 freq
unsurpation - 1 freq
uncorked - 1 freq
ungaro - 2 freq
unscrewit - 1 freq
unscrewin - 2 freq
unscrew - 3 freq
unshair - 3 freq
ungratefu - 6 freq
unscrannable - 1 freq
unnser - 8 freq
uncorkin - 1 freq
unnsers - 1 freq
uncurled - 2 freq
ungrateful - 3 freq
uncurlin - 1 freq
uncertain - 8 freq
ungrip - 1 freq
'unnser - 2 freq
uncertainly - 2 freq
uncrc - 1 freq
uncried - 1 freq
unshared - 1 freq
uncrook - 1 freq
ungrammatical - 3 freq
ungehörte - 1 freq
unchristen'd - 2 freq
unicorms - 1 freq
uncertainties - 1 freq
unscrupulous - 2 freq
unchartered - 1 freq
un-christian - 1 freq
unsurpassable - 1 freq
uncrunklin - 1 freq
unceremoniously - 1 freq
unsurprised - 1 freq
unnserstuid - 1 freq
unsurprisingly - 1 freq
ungrhd - 1 freq
ungreatful - 1 freq
unsurprisinly - 1 freq
'ungrateful' - 1 freq
MetaPhone code - UNXRT
unshared - 1 freq
UNSHARED
Time to execute Levenshtein function - 0.213757 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.382039 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.029232 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.037708 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.000911 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.