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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
reapers (0) - 2 freq
readers (1) - 88 freq
reaper's (1) - 2 freq
reaper (1) - 20 freq
eaters (2) - 2 freq
peypers (2) - 5 freq
kempers (2) - 2 freq
renders (2) - 2 freq
rapurs (2) - 2 freq
reader's (2) - 3 freq
refters (2) - 1 freq
neipers (2) - 2 freq
reaps (2) - 11 freq
dealers (2) - 10 freq
rakers (2) - 1 freq
creepers (2) - 1 freq
beavers (2) - 2 freq
neepers (2) - 5 freq
breakers (2) - 2 freq
leaders (2) - 30 freq
leavers (2) - 1 freq
refers (2) - 27 freq
peppers (2) - 7 freq
peepers (2) - 6 freq
rapes (2) - 1 freq
reapers (0) - 2 freq
rapurs (2) - 2 freq
reaper (2) - 20 freq
rypers (2) - 1 freq
readers (2) - 88 freq
reaper's (2) - 2 freq
capers (3) - 7 freq
reivers (3) - 17 freq
leipers (3) - 2 freq
reuters (3) - 6 freq
rapes (3) - 1 freq
papers (3) - 137 freq
rears (3) - 2 freq
repairs (3) - 6 freq
keepers (3) - 16 freq
reapir (3) - 1 freq
reap's (3) - 1 freq
repares (3) - 1 freq
drapers (3) - 1 freq
japers (3) - 15 freq
racers (3) - 1 freq
peepers (3) - 6 freq
reopens (3) - 1 freq
lepers (3) - 4 freq
creepers (3) - 1 freq
SoundEx code - R162
rivers - 30 freq
refreshments - 7 freq
repressed - 2 freq
riverside - 4 freq
ruifers - 1 freq
reivers - 17 freq
river's - 7 freq
repercussions - 5 freq
representatives - 13 freq
reverse - 22 freq
repressing - 1 freq
representative - 20 freq
representit - 25 freq
represented - 9 freq
reveries - 2 freq
refreshment - 6 freq
represents - 18 freq
represent - 29 freq
repressin - 2 freq
reversed - 4 freq
rypers - 1 freq
ripper's - 4 freq
refreshed - 2 freq
riverse - 1 freq
repairs - 6 freq
repress - 6 freq
refreshing - 4 freq
refresh - 2 freq
reversible - 1 freq
refers - 27 freq
representation - 36 freq
rubber-stampin - 1 freq
representin - 12 freq
repressive - 1 freq
representatives' - 1 freq
reversin - 4 freq
referees - 2 freq
reverses - 1 freq
robbers - 7 freq
robberies - 2 freq
reviewers - 3 freq
reapers - 2 freq
rovers - 23 freq
reaper's - 2 freq
representing - 2 freq
representars - 1 freq
refractin - 1 freq
rover's - 1 freq
refraishit - 2 freq
repraisentit - 2 freq
refractors - 2 freq
reprogrammed - 1 freq
'reivers - 1 freq
refreshin - 6 freq
refracts - 1 freq
representan - 2 freq
reversan - 1 freq
rapurs - 2 freq
reprise - 1 freq
representations - 6 freq
representational - 1 freq
rovers' - 1 freq
refractit - 1 freq
repression - 3 freq
rievers - 1 freq
'representational' - 1 freq
representatioun - 2 freq
reivers' - 1 freq
reprocessed - 1 freq
refraish - 1 freq
representautiouns - 1 freq
refraisched - 1 freq
refraischin - 1 freq
repares - 1 freq
refreshes - 1 freq
representitives - 1 freq
reprisal - 1 freq
refreshinly - 1 freq
reproach - 2 freq
roberston - 1 freq
raipresent - 1 freq
roooveeers - 1 freq
rubbers - 1 freq
reversal - 1 freq
revrichardcoles - 2 freq
refreshingly - 1 freq
re-freezes - 1 freq
robroyston - 1 freq
rayforsyth - 6 freq
rephrase - 1 freq
riversidempcc - 1 freq
MetaPhone code - RPRS
wrappers - 8 freq
rypers - 1 freq
ripper's - 4 freq
repairs - 6 freq
repress - 6 freq
reapers - 2 freq
reaper's - 2 freq
rapurs - 2 freq
reprise - 1 freq
repares - 1 freq
REAPERS
Time to execute Levenshtein function - 0.364509 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.618992 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.079165 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.109082 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.001121 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.