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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
levers (0) - 6 freq
leavers (1) - 1 freq
slevers (1) - 2 freq
levels (1) - 66 freq
lepers (1) - 4 freq
fevers (1) - 1 freq
lever (1) - 2 freq
livers (1) - 1 freq
lovers (1) - 20 freq
luvers (1) - 12 freq
jeers (2) - 1 freq
lee's (2) - 3 freq
slivers (2) - 5 freq
laeves (2) - 16 freq
meters (2) - 12 freq
leears (2) - 6 freq
ledes (2) - 12 freq
teers (2) - 4 freq
livert (2) - 1 freq
seers (2) - 3 freq
hovers (2) - 3 freq
liver's (2) - 2 freq
leefs (2) - 1 freq
revere (2) - 1 freq
givers (2) - 2 freq
levers (0) - 6 freq
luvers (1) - 12 freq
livers (1) - 1 freq
lovers (1) - 20 freq
leavers (1) - 1 freq
fevers (2) - 1 freq
lepers (2) - 4 freq
slevers (2) - 2 freq
lever (2) - 2 freq
levels (2) - 66 freq
rovers (3) - 23 freq
luve's (3) - 5 freq
loves (3) - 68 freq
weavers (3) - 9 freq
leaders (3) - 30 freq
leirs (3) - 1 freq
cavers (3) - 6 freq
leipers (3) - 2 freq
lyves (3) - 1 freq
reivers (3) - 17 freq
loners (3) - 1 freq
luver's (3) - 2 freq
losers (3) - 3 freq
leeves (3) - 19 freq
syvers (3) - 2 freq
SoundEx code - L162
luvers - 12 freq
lippers - 9 freq
lipperous - 1 freq
laboryus - 1 freq
lea-perk - 2 freq
labours - 5 freq
laverocks - 5 freq
lappers - 1 freq
liver's - 2 freq
lovers - 20 freq
liberace's - 2 freq
leverage - 4 freq
leverock - 1 freq
levers - 6 freq
leavers - 1 freq
leprosie - 8 freq
lepers - 4 freq
laverock's - 2 freq
lipprosy - 1 freq
liprosy - 2 freq
lavroos - 1 freq
luver's - 2 freq
leprosy - 1 freq
'leprechaun - 2 freq
leprechauns - 1 freq
leprechaun - 3 freq
laverock - 14 freq
laveroks - 1 freq
liver-spotted - 1 freq
laebrack - 1 freq
lapraik - 1 freq
lawburrows - 14 freq
laevrick - 2 freq
laborious - 2 freq
lawborrowis - 6 freq
lawborrouis - 1 freq
law-borowis - 1 freq
law-borrowis - 1 freq
lawbawrous - 1 freq
lawbarrowis - 1 freq
lauborris - 1 freq
lawborch - 1 freq
laebrak - 1 freq
laverick - 1 freq
lawbors - 1 freq
laabours - 1 freq
laphroaig - 2 freq
low-prestige - 2 freq
luve-arras - 1 freq
luvvers - 1 freq
louvres - 2 freq
livers - 1 freq
€œleverage - 1 freq
leipers - 2 freq
liveries - 1 freq
loversaberdeen - 1 freq
law-breaking - 1 freq
labourrichard - 2 freq
lavrock's - 1 freq
MetaPhone code - LFRS
luvers - 12 freq
liver's - 2 freq
lovers - 20 freq
levers - 6 freq
leavers - 1 freq
lavroos - 1 freq
luver's - 2 freq
luve-arras - 1 freq
luvvers - 1 freq
louvres - 2 freq
livers - 1 freq
liveries - 1 freq
LEVERS
Time to execute Levenshtein function - 0.275796 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.398044 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.027515 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.037142 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.000874 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.