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 sonsie

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

Similar words to aoifelockhart in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
aoifelockhart (0) - 1 freq
dougielockhart (4) - 1 freq
jmlockhart (5) - 1 freq
lockhart (5) - 4 freq
afloat (7) - 12 freq
orchart (7) - 9 freq
aifterwart (7) - 1 freq
afecwuat (7) - 1 freq
forflithert (7) - 1 freq
flochtert (7) - 1 freq
lockhart's (7) - 1 freq
lockfast (7) - 1 freq
aristocaat (7) - 1 freq
pitlochory (7) - 1 freq
lifeboat (7) - 7 freq
ballystockart (7) - 1 freq
soothart (7) - 1 freq
diffickwalt (7) - 1 freq
pitlochry (7) - 7 freq
flockit (7) - 1 freq
arrochar (7) - 1 freq
forfochan (7) - 5 freq
flochtit (7) - 1 freq
hielicht (7) - 3 freq
flocht (7) - 4 freq
aoifelockhart (0) - 1 freq
dougielockhart (6) - 1 freq
lockhart (6) - 4 freq
jmlockhart (7) - 1 freq
fluckert (8) - 1 freq
flicthert (8) - 1 freq
flickert (8) - 2 freq
flochtit (9) - 1 freq
flickerit (9) - 1 freq
flockit (9) - 1 freq
flocht (9) - 4 freq
flochtert (9) - 1 freq
focherty (10) - 1 freq
flicht (10) - 47 freq
hielichtit (10) - 1 freq
lockfast (10) - 1 freq
lockars (10) - 2 freq
flecker (10) - 1 freq
firelicht (10) - 2 freq
flickit (10) - 7 freq
flichtert (10) - 6 freq
clockwark (10) - 4 freq
pilchard (10) - 1 freq
orchart (10) - 9 freq
hielicht (10) - 3 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 - AFLKHRT
aoifelockhart - 1 freq
AOIFELOCKHART
Time to execute Levenshtein function - 0.221576 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.379844 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.029908 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.042408 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.001086 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.