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 unasked-for in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unasked-for (0) - 1 freq
tasked- (5) - 1 freq
langed-fir (5) - 2 freq
knocked-oot (5) - 1 freq
unmasked (5) - 1 freq
snaiked (6) - 1 freq
un-self (6) - 1 freq
unused (6) - 2 freq
naked (6) - 22 freq
ken-or (6) - 1 freq
unnser (6) - 8 freq
tasted- (6) - 1 freq
no-looked-for (6) - 1 freq
back-a-fore (6) - 1 freq
fankle-fork (6) - 2 freq
back-door (6) - 2 freq
snawed-in (6) - 1 freq
unsteddy (6) - 1 freq
unker (6) - 4 freq
see-foo (6) - 1 freq
unser (6) - 3 freq
charterfor (6) - 1 freq
snaked (6) - 2 freq
knackeroso (6) - 1 freq
marked-up (6) - 1 freq
unasked-for (0) - 1 freq
no-looked-for (8) - 1 freq
langed-fir (8) - 2 freq
tasked- (8) - 1 freq
knocked-aff (9) - 1 freq
back-a-fore (9) - 1 freq
task-force (9) - 1 freq
unmasked (9) - 1 freq
knocked-oot (9) - 1 freq
nassed (10) - 1 freq
unner-fed (10) - 1 freq
backdoor (10) - 2 freq
eisteddfod (10) - 4 freq
used-an (10) - 1 freq
asked (10) - 506 freq
hunkey-dory (10) - 1 freq
backed-up (10) - 1 freq
tasked (10) - 1 freq
basker (10) - 1 freq
mashed-up (10) - 2 freq
insider (10) - 1 freq
masked (10) - 8 freq
needfire (10) - 1 freq
insofar (10) - 2 freq
inysdif (10) - 1 freq
SoundEx code - U523
unsettl't - 2 freq
unquateness - 1 freq
uncut - 1 freq
unsteady - 3 freq
unsettled - 3 freq
uncouthie - 3 freq
unstringin - 1 freq
unstoppable - 5 freq
unsettlin - 3 freq
unsettle - 1 freq
un-yeesed - 1 freq
unsaed - 1 freq
ungoadly - 1 freq
unskaithd - 1 freq
unsettles - 1 freq
unheuked - 1 freq
unsaid - 6 freq
unsteik - 1 freq
unsteikit - 1 freq
unsheathit - 1 freq
'unsteik - 1 freq
unstappit - 2 freq
unsticking - 1 freq
unsettling - 3 freq
unmistakable - 3 freq
unwashed - 5 freq
unkit's - 1 freq
unhooked - 1 freq
unasked-for - 1 freq
uncouth - 5 freq
unmistakeable - 3 freq
unsatisfied - 1 freq
unsuitable - 2 freq
unwashit - 1 freq
unsteeked - 1 freq
unstuck - 1 freq
unstick - 1 freq
unctioneer - 2 freq
unstaundart - 2 freq
unst - 12 freq
unstitute - 1 freq
unsteek - 3 freq
ungat - 1 freq
unstapt - 1 freq
unsheddied - 1 freq
unshadowed - 1 freq
unstable - 1 freq
unsatisfactorie - 1 freq
unwasht - 1 freq
unsteekit - 2 freq
unwaashed - 1 freq
unstappable - 2 freq
unstressed - 27 freq
unstessed - 1 freq
unquait - 1 freq
unction - 1 freq
unwaged - 1 freq
unsattled - 1 freq
unstintin - 1 freq
unsturdy - 1 freq
ungodly - 2 freq
unsatisfactor - 1 freq
uncuddomt - 1 freq
unstappin - 1 freq
unstickan - 1 freq
unmistakible - 1 freq
unhowkit - 1 freq
unused - 2 freq
unstintit - 1 freq
unctuous - 1 freq
unsaturatit - 1 freq
unweshed - 1 freq
unsteeks - 1 freq
unscathed - 2 freq
unsatisfaiän - 1 freq
ungwdrj - 1 freq
unstfest - 1 freq
unstagram - 1 freq
unmasked - 1 freq
unistrathclyde - 1 freq
unsteddy - 1 freq
unstlass - 3 freq
MetaPhone code - UNSKTFR
unasked-for - 1 freq
UNASKED-FOR
Time to execute Levenshtein function - 0.457764 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.708014 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.070788 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.048095 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.001341 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.