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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
uniquely (0) - 4 freq
unique (2) - 52 freq
untimely (3) - 5 freq
unlikely (3) - 22 freq
cliquey (3) - 1 freq
iniquity (3) - 2 freq
untiques (3) - 3 freq
nicely (3) - 16 freq
unequal (3) - 1 freq
undique (3) - 1 freq
princely (4) - 2 freq
brusquely (4) - 2 freq
wifely (4) - 2 freq
vievely (4) - 1 freq
uncouple (4) - 1 freq
lively (4) - 10 freq
miguel (4) - 1 freq
nickety (4) - 1 freq
wilely (4) - 1 freq
united (4) - 75 freq
nibbelt (4) - 2 freq
kinely (4) - 4 freq
untrue (4) - 2 freq
antique (4) - 9 freq
dubiously (4) - 1 freq
uniquely (0) - 4 freq
unequal (3) - 1 freq
unique (3) - 52 freq
iniquity (4) - 2 freq
nicely (4) - 16 freq
inquiry (5) - 14 freq
unweel (5) - 2 freq
uneasily (5) - 4 freq
unrael (5) - 1 freq
sequel (5) - 8 freq
unul (5) - 1 freq
namely (5) - 10 freq
untul (5) - 1 freq
nately (5) - 2 freq
niel (5) - 1 freq
unholy (5) - 4 freq
raquel (5) - 1 freq
unquait (5) - 1 freq
onywely (5) - 4 freq
untiques (5) - 3 freq
undique (5) - 1 freq
inequity (5) - 1 freq
unlikely (5) - 22 freq
untimely (5) - 5 freq
unusual (5) - 25 freq
SoundEx code - U524
uncle - 275 freq
unusual - 25 freq
uneasily - 4 freq
un-cleek - 1 freq
uncleids - 1 freq
unco-like - 4 freq
unkil - 4 freq
unclean - 6 freq
unshillit - 1 freq
unself-isolatin - 2 freq
'uncle - 1 freq
umquhile - 18 freq
unyoosual - 1 freq
unclenches - 1 freq
un-guiltily - 1 freq
umquwhile - 1 freq
'uncle' - 1 freq
unyaisual - 1 freq
unusually - 3 freq
unsolved - 2 freq
unglued - 1 freq
'uncles - 1 freq
unwycelike - 1 freq
unassailable - 1 freq
uncle's - 8 freq
uncles - 19 freq
unselt - 1 freq
unusal - 1 freq
uncoil - 2 freq
unco-lookin - 1 freq
unclips - 1 freq
unclasps - 1 freq
unclippin - 1 freq
uncoilan - 1 freq
ungleg - 1 freq
unjieldin - 1 freq
unslochen't - 1 freq
un-self - 1 freq
uncolike - 1 freq
uncalled - 2 freq
unsealt - 1 freq
unchallenged - 2 freq
unco-leukin - 2 freq
unclean' - 1 freq
umquhyle - 5 freq
unequal - 1 freq
unchallanced - 1 freq
€œuncle - 2 freq
uniquely - 4 freq
un-sel-conscious - 1 freq
umsel - 1 freq
uncle-like - 1 freq
unselfishly - 1 freq
unselfish - 1 freq
unslung - 1 freq
uneasy-like - 1 freq
unsolvable - 1 freq
unusuall - 1 freq
umzeltdw - 1 freq
unclouded - 1 freq
uinxxsxlhh - 1 freq
MetaPhone code - UNKL
uncle - 275 freq
unkil - 4 freq
'uncle - 1 freq
'uncle' - 1 freq
uncoil - 2 freq
unequal - 1 freq
€œuncle - 2 freq
uniquely - 4 freq
UNIQUELY
Time to execute Levenshtein function - 0.491312 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 - 1.061208 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.028254 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.088426 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.000992 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.