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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
daaner (0) - 1 freq
danner (1) - 13 freq
dainer (1) - 5 freq
daener (1) - 2 freq
dauner (1) - 57 freq
aaner (1) - 1 freq
daander (1) - 1 freq
daanert (1) - 1 freq
daunger (2) - 4 freq
ainer (2) - 2 freq
dramer (2) - 2 freq
wanner (2) - 18 freq
danser (2) - 1 freq
dealer (2) - 15 freq
dufner (2) - 1 freq
denner (2) - 273 freq
laayer (2) - 5 freq
dearer (2) - 8 freq
tapner (2) - 2 freq
deener (2) - 3 freq
dainjer (2) - 2 freq
dawned (2) - 14 freq
dazler (2) - 2 freq
wauner (2) - 2 freq
deane (2) - 3 freq
daaner (0) - 1 freq
daener (1) - 2 freq
dauner (1) - 57 freq
dainer (1) - 5 freq
diner (2) - 1 freq
doner (2) - 2 freq
dener (2) - 2 freq
daenr (2) - 2 freq
dooner (2) - 2 freq
daanert (2) - 1 freq
daander (2) - 1 freq
deener (2) - 3 freq
danner (2) - 13 freq
aaner (2) - 1 freq
dancer (3) - 31 freq
daun'er (3) - 1 freq
dan'er (3) - 1 freq
drainer (3) - 2 freq
draaer (3) - 2 freq
denier (3) - 1 freq
dainner (3) - 3 freq
diane (3) - 9 freq
dane' (3) - 1 freq
danger (3) - 110 freq
mainer (3) - 9 freq
SoundEx code - D560
denner - 273 freq
'denner - 2 freq
dauner - 57 freq
deenner - 1 freq
dinner - 140 freq
doun-here - 1 freq
dennir - 29 freq
daunner - 12 freq
dounreay - 2 freq
daenr - 2 freq
dainner - 3 freq
dainer - 5 freq
dunira - 3 freq
'dinner - 3 freq
daenner - 1 freq
dunner - 6 freq
dennèr - 4 freq
dan'er - 1 freq
demur - 1 freq
danner - 13 freq
dannér - 1 freq
dammer - 1 freq
doon-here - 1 freq
daaner - 1 freq
dooner - 2 freq
donor - 7 freq
diner - 1 freq
denar - 1 freq
daun'er - 1 freq
daener - 2 freq
dinnur - 1 freq
deener - 3 freq
denier - 1 freq
duneira - 7 freq
dener - 2 freq
downer - 1 freq
'denier' - 1 freq
donner - 2 freq
doner - 2 freq
MetaPhone code - TNR
denner - 273 freq
'denner - 2 freq
dauner - 57 freq
deenner - 1 freq
dinner - 140 freq
tanner - 10 freq
dennir - 29 freq
daunner - 12 freq
tenure - 4 freq
dounreay - 2 freq
daenr - 2 freq
tenner - 25 freq
dainner - 3 freq
dainer - 5 freq
dunira - 3 freq
'dinner - 3 freq
toner - 1 freq
daenner - 1 freq
dunner - 6 freq
dennèr - 4 freq
ten'er - 1 freq
dan'er - 1 freq
danner - 13 freq
dannér - 1 freq
tenor - 4 freq
tuner - 1 freq
daaner - 1 freq
tonner - 1 freq
dooner - 2 freq
donor - 7 freq
diner - 1 freq
denar - 1 freq
daun'er - 1 freq
daener - 2 freq
dinnur - 1 freq
deener - 3 freq
denier - 1 freq
duneira - 7 freq
tinner - 1 freq
tenior - 1 freq
dener - 2 freq
downer - 1 freq
'denier' - 1 freq
donner - 2 freq
doner - 2 freq
DAANER
Time to execute Levenshtein function - 0.392031 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.742576 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.083714 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.105593 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.000867 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.