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 sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to devals in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
devals (0) - 1 freq
deval (1) - 4 freq
deals (1) - 18 freq
devauls (1) - 1 freq
devils (1) - 1 freq
decals (1) - 1 freq
deas (2) - 1 freq
dears (2) - 12 freq
metals (2) - 5 freq
dedalus (2) - 1 freq
dealt (2) - 33 freq
rivals (2) - 3 freq
devaal (2) - 5 freq
devalna (2) - 1 freq
petals (2) - 22 freq
devana (2) - 1 freq
deal (2) - 194 freq
dells (2) - 1 freq
devil (2) - 35 freq
ideals (2) - 6 freq
dedaws (2) - 1 freq
bevels (2) - 1 freq
devaall (2) - 1 freq
pedals (2) - 3 freq
heals (2) - 5 freq
devals (0) - 1 freq
devils (1) - 1 freq
devauls (1) - 1 freq
deval (2) - 4 freq
deivils (2) - 1 freq
deevils (2) - 11 freq
decals (2) - 1 freq
deals (2) - 18 freq
devaill (3) - 1 freq
reveals (3) - 10 freq
delays (3) - 1 freq
levils (3) - 1 freq
kevels (3) - 1 freq
dials (3) - 11 freq
de'ils (3) - 2 freq
details (3) - 70 freq
evils (3) - 4 freq
devil's (3) - 7 freq
devaall (3) - 1 freq
devaul (3) - 9 freq
deils (3) - 35 freq
levels (3) - 66 freq
devdas (3) - 3 freq
dedalus (3) - 1 freq
devil (3) - 35 freq
SoundEx code - D142
dowpless - 2 freq
devil's - 7 freq
doubles - 11 freq
dowf-like - 2 freq
deflected - 2 freq
double-quilted - 1 freq
deevilock - 2 freq
deivils - 1 freq
divil's - 1 freq
divulge - 1 freq
deevilocks-strigoiettled - 1 freq
double-check - 2 freq
deflect - 2 freq
divulged - 3 freq
duplicity - 2 freq
double-cross - 1 freq
devilish - 4 freq
deevils - 11 freq
divvels - 2 freq
divvel's - 1 freq
deevlick - 1 freq
devals - 1 freq
deef-lugs - 1 freq
deivilik - 1 freq
deevil's - 1 freq
doppelgangers - 1 freq
duplication - 2 freq
double-chap - 1 freq
deevilish - 4 freq
dooble-glazed - 1 freq
doobles - 2 freq
duplicate - 1 freq
deivil's - 1 freq
duplex - 1 freq
deevilocks - 1 freq
deevilocks' - 1 freq
deevil-lassie - 1 freq
deevil-lassies - 1 freq
deevilick - 3 freq
devauls - 1 freq
devillok - 1 freq
diabolical - 1 freq
dooblespeak - 1 freq
dufflecoat - 2 freq
€œdivulge - 1 freq
doppelganger - 3 freq
deflection - 2 freq
divulgin - 1 freq
devils - 1 freq
deflects - 1 freq
dwaibliest - 1 freq
deflecting - 1 freq
davehallcoltd - 5 freq
dvlce - 1 freq
deflectin - 1 freq
doublecross - 2 freq
dbalzoymim - 1 freq
MetaPhone code - TFLS
devil's - 7 freq
deivils - 1 freq
divil's - 1 freq
deevils - 11 freq
divvels - 2 freq
divvel's - 1 freq
devals - 1 freq
deevil's - 1 freq
deivil's - 1 freq
devauls - 1 freq
devils - 1 freq
dvlce - 1 freq
DEVALS
Time to execute Levenshtein function - 0.207964 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.370424 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.028496 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.042375 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.001241 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.