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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
yolkers (0) - 1 freq
golders (2) - 3 freq
younkers (2) - 9 freq
yokels (2) - 1 freq
dolders (2) - 1 freq
sookers (2) - 2 freq
doukers (2) - 1 freq
workers (2) - 34 freq
powkers (2) - 1 freq
hookers (2) - 2 freq
yerkers (2) - 2 freq
porkers (2) - 2 freq
lockers (2) - 4 freq
boskers (2) - 2 freq
yolks (2) - 2 freq
yoles (2) - 9 freq
conkers (2) - 3 freq
yollert (2) - 2 freq
polders (2) - 1 freq
yorker (2) - 1 freq
howkers (2) - 1 freq
walkers (2) - 18 freq
talkers (2) - 1 freq
holders (2) - 3 freq
dockers (2) - 12 freq
yolkers (0) - 1 freq
hookers (3) - 2 freq
yolks (3) - 2 freq
yerkers (3) - 2 freq
dookers (3) - 10 freq
lockers (3) - 4 freq
jokers (3) - 2 freq
doukers (3) - 1 freq
younkers (3) - 9 freq
talkers (3) - 1 freq
walkers (3) - 18 freq
sookers (3) - 2 freq
nokers (3) - 1 freq
allers (4) - 1 freq
seekers (4) - 9 freq
kers (4) - 6 freq
ackers (4) - 16 freq
keekers (4) - 3 freq
maakers (4) - 3 freq
makers (4) - 8 freq
bikers (4) - 2 freq
lousers (4) - 1 freq
elders (4) - 21 freq
lickers (4) - 2 freq
gyokeres (4) - 1 freq
SoundEx code - Y426
yallicrack - 1 freq
yolkers - 1 freq
ylgckrvnk - 1 freq
yljorzic - 1 freq
yul-girs - 1 freq
ylzrj - 1 freq
MetaPhone code - YLKRS
yolkers - 1 freq
YOLKERS
Time to execute Levenshtein function - 0.288513 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.452681 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.060526 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.038291 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.000862 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.