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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dewar (0) - 9 freq
dewer (1) - 2 freq
fewar (1) - 1 freq
denar (1) - 1 freq
dear (1) - 419 freq
decay (2) - 11 freq
deur (2) - 2 freq
dead (2) - 272 freq
newark (2) - 1 freq
sewer (2) - 4 freq
ewer (2) - 2 freq
deas (2) - 1 freq
delay (2) - 17 freq
aeway (2) - 1 freq
dear' (2) - 1 freq
dwam (2) - 101 freq
ledar (2) - 1 freq
kawar (2) - 1 freq
dean (2) - 18 freq
€˜war (2) - 1 freq
der (2) - 302 freq
deer (2) - 69 freq
fear (2) - 415 freq
deday (2) - 5 freq
dwab (2) - 1 freq
dewar (0) - 9 freq
dewer (1) - 2 freq
dower (2) - 2 freq
dear (2) - 419 freq
denar (2) - 1 freq
fewar (2) - 1 freq
bewaar (3) - 1 freq
deyr (3) - 1 freq
twar (3) - 2 freq
dwarf (3) - 3 freq
deir (3) - 7 freq
fewr (3) - 1 freq
drar (3) - 1 freq
dener (3) - 2 freq
fewer (3) - 11 freq
demur (3) - 1 freq
dewy (3) - 2 freq
hwar (3) - 1 freq
dey'r (3) - 1 freq
doar (3) - 29 freq
beware (3) - 5 freq
weear (3) - 1 freq
dewie (3) - 1 freq
dwa (3) - 1 freq
awar (3) - 4 freq
SoundEx code - D600
door - 1896 freq
dry - 471 freq
dour - 124 freq
daar - 11 freq
daur - 73 freq
doorwey - 13 freq
dearie - 37 freq
dare - 57 freq
drew - 190 freq
draw - 172 freq
drowe - 8 freq
dree - 54 freq
dear - 419 freq
draa - 51 freq
deer - 69 freq
'draw - 4 freq
'dear - 4 freq
doorway - 17 freq
deary - 4 freq
dr - 199 freq
diary - 43 freq
der - 302 freq
'drew - 1 freq
diarrhoea - 3 freq
dure - 64 freq
dor - 5 freq
deir - 7 freq
'dearie - 1 freq
dar - 86 freq
doar - 29 freq
deer'' - 1 freq
dire - 9 freq
daur' - 1 freq
doorr - 1 freq
dorr - 43 freq
dra - 4 freq
drow - 4 freq
dour' - 1 freq
dur - 1 freq
dere - 207 freq
dairy - 28 freq
doyr - 1 freq
dewar - 9 freq
drah - 1 freq
dreh - 2 freq
doer - 1 freq
door' - 2 freq
dower - 2 freq
deere - 3 freq
diaorrhea - 2 freq
derry - 49 freq
dair - 11 freq
draaw - 1 freq
doorie - 3 freq
dir - 400 freq
dey're - 32 freq
'dey're - 2 freq
douro - 1 freq
duoro - 6 freq
dear' - 1 freq
duir - 26 freq
dray - 4 freq
duirwey - 1 freq
dore - 3 freq
dooer - 1 freq
d'ir - 39 freq
dær - 4 freq
deerie - 1 freq
droo - 1 freq
dey'r - 1 freq
door-a - 1 freq
de'r - 51 freq
dø-er - 2 freq
drowie - 5 freq
dorie - 1 freq
€˜dere - 1 freq
deyr - 1 freq
dorro - 1 freq
€˜dey're - 1 freq
€œdeirie - 1 freq
€˜dear - 3 freq
draw- - 1 freq
diarie - 1 freq
€˜deir - 1 freq
dowier - 1 freq
dewer - 2 freq
deur - 2 freq
doorwaiy - 1 freq
€œdear - 1 freq
dory - 1 freq
darry - 1 freq
€™dry - 1 freq
derri- - 2 freq
derri - 4 freq
doori - 1 freq
€œdearie - 2 freq
€œdr - 2 freq
draa' - 1 freq
durie - 1 freq
drewie - 1 freq
€˜door - 1 freq
dÂ’oor - 1 freq
dyr - 1 freq
dwra - 1 freq
dura - 1 freq
dahri - 1 freq
dere' - 1 freq
dury - 1 freq
drhue - 1 freq
doire - 1 freq
‘diary - 1 freq
'diary - 3 freq
MetaPhone code - TWR
tower - 44 freq
twa'r - 10 freq
twa-oor - 1 freq
dewar - 9 freq
dower - 2 freq
dowier - 1 freq
dewer - 2 freq
twar - 2 freq
DEWAR
Time to execute Levenshtein function - 0.234172 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.325825 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.027836 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.037186 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.000888 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.