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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
jerks (0) - 1 freq
perks (1) - 9 freq
jerbs (1) - 1 freq
yerks (1) - 1 freq
herks (1) - 1 freq
merks (1) - 45 freq
jerkt (1) - 1 freq
serks (1) - 1 freq
jerk (1) - 8 freq
jesus (2) - 835 freq
erk (2) - 5 freq
terk (2) - 1 freq
keeks (2) - 15 freq
jirk (2) - 1 freq
seks (2) - 1 freq
herts (2) - 119 freq
lurks (2) - 6 freq
pers (2) - 1 freq
cerds (2) - 1 freq
leeks (2) - 5 freq
'eres (2) - 1 freq
warks (2) - 132 freq
jew's (2) - 2 freq
yerns (2) - 1 freq
works (2) - 118 freq
jerks (0) - 1 freq
jerkt (2) - 1 freq
serks (2) - 1 freq
merks (2) - 45 freq
jerk (2) - 8 freq
herks (2) - 1 freq
perks (2) - 9 freq
jerbs (2) - 1 freq
yerks (2) - 1 freq
jinks (3) - 8 freq
wurks (3) - 3 freq
jocks (3) - 5 freq
jerkin (3) - 2 freq
barks (3) - 5 freq
parks (3) - 92 freq
wirks (3) - 49 freq
forks (3) - 15 freq
turks (3) - 4 freq
joris (3) - 1 freq
jaiks (3) - 1 freq
merkis (3) - 2 freq
surks (3) - 1 freq
jouks (3) - 10 freq
larks (3) - 4 freq
jerkan (3) - 1 freq
SoundEx code - J620
jaurs - 15 freq
jersey - 22 freq
jerries - 11 freq
jeers - 1 freq
jerk - 8 freq
jars - 21 freq
jrish - 1 freq
jairus's - 2 freq
jairus - 3 freq
jericho - 9 freq
jirg - 2 freq
jauries - 2 freq
jarr's - 1 freq
jurie's - 1 freq
jaírus's - 1 freq
jaírus - 2 freq
jours - 1 freq
jorg - 1 freq
jörg - 1 freq
jirk - 1 freq
jerks - 1 freq
jrc - 1 freq
joris - 1 freq
jury's - 1 freq
jcrg - 1 freq
juries - 1 freq
joryg - 1 freq
jerriais - 1 freq
MetaPhone code - JRKS
jerks - 1 freq
JERKS
Time to execute Levenshtein function - 0.258032 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.534692 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.028592 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.037770 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.000774 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.