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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
verbs (0) - 98 freq
serbs (1) - 2 freq
yerbs (1) - 2 freq
verus (1) - 1 freq
kerbs (1) - 3 freq
herbs (1) - 14 freq
vers (1) - 1 freq
verb' (1) - 1 freq
verb (1) - 129 freq
verb's (1) - 1 freq
jerbs (1) - 1 freq
verish (2) - 1 freq
her's (2) - 3 freq
verk (2) - 2 freq
herns (2) - 1 freq
germs (2) - 4 freq
ceres (2) - 11 freq
gers (2) - 8 freq
veyb's (2) - 1 freq
veers (2) - 1 freq
verve (2) - 2 freq
hers (2) - 85 freq
versy (2) - 1 freq
aers (2) - 2 freq
'er's (2) - 1 freq
verbs (0) - 98 freq
verb' (2) - 1 freq
verb (2) - 129 freq
verb's (2) - 1 freq
vers (2) - 1 freq
jerbs (2) - 1 freq
herbs (2) - 14 freq
yerbs (2) - 2 freq
serbs (2) - 2 freq
kerbs (2) - 3 freq
verus (2) - 1 freq
verse (3) - 134 freq
versus (3) - 7 freq
virus (3) - 57 freq
rbs (3) - 1 freq
gorbs (3) - 1 freq
verbals (3) - 1 freq
urbs (3) - 1 freq
averts (3) - 1 freq
barbs (3) - 1 freq
versa (3) - 4 freq
vbs (3) - 1 freq
adverbs (3) - 13 freq
rebs (3) - 3 freq
versy (3) - 1 freq
SoundEx code - V612
verbs - 98 freq
verb's - 1 freq
verbs-fousomiver - 1 freq
vrafz - 1 freq
verbisan - 3 freq
vrvfhqehxw - 1 freq
MetaPhone code - FRBS
forbes - 10 freq
verbs - 98 freq
freebies - 1 freq
verb's - 1 freq
firebaws - 1 freq
furbas - 1 freq
VERBS
Time to execute Levenshtein function - 0.166266 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.319651 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.027500 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.037757 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.000875 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.