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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
midges (0) - 26 freq
mudges (1) - 1 freq
midgets (1) - 5 freq
ridges (1) - 6 freq
midgies (1) - 20 freq
midges' (1) - 1 freq
midge (1) - 10 freq
fidges (1) - 2 freq
midget (1) - 6 freq
widge (2) - 1 freq
fudges (2) - 1 freq
meidaes (2) - 2 freq
meidies (2) - 1 freq
bides (2) - 228 freq
mingus (2) - 1 freq
mines (2) - 63 freq
mires (2) - 3 freq
minces (2) - 1 freq
ridgers (2) - 3 freq
lieges (2) - 1 freq
tidies (2) - 2 freq
hinges (2) - 19 freq
middles (2) - 1 freq
wedges (2) - 1 freq
midder (2) - 64 freq
midges (0) - 26 freq
mudges (1) - 1 freq
midgies (1) - 20 freq
mudgos (2) - 1 freq
midget (2) - 6 freq
mudgies (2) - 1 freq
fidges (2) - 2 freq
midgets (2) - 5 freq
midges' (2) - 1 freq
ridges (2) - 6 freq
midge (2) - 10 freq
gadges (3) - 1 freq
wadges (3) - 1 freq
madge (3) - 9 freq
mings (3) - 1 freq
misgaes (3) - 1 freq
juidges (3) - 1 freq
radges (3) - 1 freq
ludges (3) - 2 freq
judges (3) - 19 freq
modes (3) - 2 freq
ledges (3) - 3 freq
mids (3) - 70 freq
midgie (3) - 27 freq
smudges (3) - 2 freq
SoundEx code - M322
matches - 41 freq
midges - 26 freq
mudchucks - 2 freq
motoguzzi - 1 freq
midges' - 1 freq
midgies - 20 freq
match-stick - 1 freq
mudgos - 1 freq
matchstick - 1 freq
mudgies - 1 freq
médicis - 1 freq
mitchison - 4 freq
mutchkin - 1 freq
mudges - 1 freq
mmtkyjr - 1 freq
mdzyjyvtrl - 1 freq
mwydzuk - 1 freq
meatsack - 1 freq
mdtyewcukz - 1 freq
MetaPhone code - MJS
midges - 26 freq
mojo's - 1 freq
midges' - 1 freq
midgies - 20 freq
mages - 1 freq
mudgies - 1 freq
mudges - 1 freq
mbjs - 1 freq
MIDGES
Time to execute Levenshtein function - 0.210014 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.388608 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.027216 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.037696 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.000816 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.