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 ahint

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

Similar words to awfie-like in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
awfie-like (0) - 1 freq
awfy-like (2) - 1 freq
lassie-like (3) - 1 freq
whit-like (3) - 1 freq
wyse-like (3) - 1 freq
cannie-like (3) - 4 freq
wice-like (3) - 3 freq
fuffie-like (3) - 2 freq
dowie-like (3) - 8 freq
wise-like (3) - 3 freq
eerie-like (3) - 2 freq
wyce-like (3) - 15 freq
sweir-like (3) - 1 freq
lyfie-lik (3) - 1 freq
pawkie-lik (3) - 1 freq
owre-like (3) - 1 freq
firm-like (4) - 1 freq
sic-like (4) - 11 freq
dentie-like (4) - 1 freq
sik-like (4) - 2 freq
quiet-like (4) - 5 freq
fifelike (4) - 3 freq
sweirt-like (4) - 1 freq
wicelike (4) - 11 freq
tentie-like (4) - 1 freq
awfie-like (0) - 1 freq
awfy-like (2) - 1 freq
wice-like (4) - 3 freq
owre-like (4) - 1 freq
lyfie-lik (4) - 1 freq
wyse-like (4) - 1 freq
wise-like (4) - 3 freq
wyce-like (4) - 15 freq
pawkie-lik (5) - 1 freq
waa-like (5) - 1 freq
wyce-lyke (5) - 2 freq
wean-like (5) - 1 freq
dowf-like (5) - 2 freq
fuffie-like (5) - 2 freq
sweir-like (5) - 1 freq
whit-like (5) - 1 freq
eerie-like (5) - 2 freq
dowie-like (5) - 8 freq
whit-lik (6) - 1 freq
wycelike (6) - 12 freq
wab-lake (6) - 1 freq
safilike (6) - 1 freq
waeklike (6) - 1 freq
aiverie-like (6) - 4 freq
douce-like (6) - 8 freq
SoundEx code - A142
'application - 1 freq
applications - 7 freq
apologetic - 11 freq
aipples - 91 freq
applause - 28 freq
ableizin - 1 freq
a-flauchter - 1 freq
applies - 17 freq
apologisin - 5 freq
apologise - 28 freq
apologize - 1 freq
apples - 10 freq
ableeze - 9 freq
apologised - 8 freq
afflicted - 2 freq
appeals - 4 freq
affliction - 6 freq
afflict - 2 freq
appalachians - 1 freq
aiples - 4 freq
appoligised - 1 freq
appolijee - 1 freq
appolijyzed - 1 freq
apolijysed - 1 freq
awfy-like - 1 freq
apologies - 22 freq
ablachs - 2 freq
apology - 17 freq
ablach - 3 freq
a-bleeze - 1 freq
application - 24 freq
apologetically - 6 freq
apoligetic - 1 freq
ablice - 4 freq
aaaapppullls - 1 freq
ablaze - 5 freq
applicants - 5 freq
aafilest - 1 freq
'apologetic - 2 freq
'apologise' - 1 freq
aipplecross - 1 freq
affleectit - 1 freq
aff-licence - 1 freq
aa-place - 1 freq
appellachia - 1 freq
abolishin - 1 freq
apologeese - 1 freq
apologeesed - 1 freq
applicatioun - 1 freq
aflist - 1 freq
awpliss - 1 freq
afflictions - 1 freq
applecross - 2 freq
aipils - 1 freq
apologeised - 2 freq
apologeise - 1 freq
aflikkit - 1 freq
applees - 3 freq
ableize - 1 freq
appalachia - 1 freq
appalachian - 1 freq
aiblach - 1 freq
awfie-like - 1 freq
afflictit - 2 freq
applicaetions - 2 freq
apologises - 1 freq
apologist - 2 freq
abolisht - 1 freq
applicable - 3 freq
abolished - 2 freq
aplicability - 1 freq
aippuls - 1 freq
apollocreed - 1 freq
awopls - 1 freq
ablackeyedpeace - 6 freq
afflictioun - 1 freq
apolagise - 1 freq
apolajise - 1 freq
ableist - 1 freq
aipples' - 1 freq
aoifelockhart - 1 freq
abolish - 1 freq
MetaPhone code - AFLK
awfy-like - 1 freq
awfie-like - 1 freq
AWFIE-LIKE
Time to execute Levenshtein function - 0.268750 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.386996 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.031358 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.037017 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.000931 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.