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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
refers (0) - 27 freq
defers (1) - 1 freq
refters (1) - 1 freq
prefers (1) - 3 freq
refer (1) - 35 freq
reform (2) - 42 freq
yeers (2) - 2 freq
rivers (2) - 24 freq
rakers (2) - 1 freq
levers (2) - 6 freq
rievers (2) - 1 freq
remerks (2) - 8 freq
remerk (2) - 3 freq
reforms (2) - 2 freq
renders (2) - 2 freq
veers (2) - 1 freq
reverse (2) - 19 freq
peers (2) - 26 freq
prefert (2) - 1 freq
rulers (2) - 6 freq
ruifers (2) - 1 freq
reivers (2) - 17 freq
referrt (2) - 1 freq
sewers (2) - 5 freq
heffers (2) - 1 freq
refers (0) - 27 freq
referees (2) - 2 freq
refer (2) - 35 freq
ruifers (2) - 1 freq
refters (2) - 1 freq
prefers (2) - 3 freq
defers (2) - 1 freq
refeese (3) - 1 freq
rafters (3) - 9 freq
rogers (3) - 6 freq
ruders (3) - 1 freq
heefers (3) - 1 freq
referin (3) - 1 freq
redars (3) - 1 freq
readers (3) - 85 freq
referee (3) - 15 freq
fyfers (3) - 7 freq
racers (3) - 1 freq
fifers (3) - 8 freq
reefs (3) - 6 freq
rears (3) - 2 freq
offers (3) - 59 freq
refs (3) - 6 freq
rowers (3) - 3 freq
riders (3) - 8 freq
SoundEx code - R162
rivers - 24 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 - 19 freq
repressing - 1 freq
representative - 19 freq
representit - 24 freq
represented - 9 freq
reveries - 1 freq
refreshment - 6 freq
represents - 18 freq
represent - 28 freq
repressin - 2 freq
reversed - 4 freq
refreshing - 4 freq
refresh - 2 freq
reversible - 1 freq
refers - 27 freq
representation - 35 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 - 5 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
repairs - 5 freq
refreshes - 1 freq
representitives - 1 freq
reprisal - 1 freq
repress - 1 freq
refreshinly - 1 freq
reproach - 2 freq
roberston - 1 freq
raipresent - 1 freq
refreshed - 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 - RFRS
rivers - 24 freq
ruifers - 1 freq
reivers - 17 freq
river's - 7 freq
reverse - 19 freq
reveries - 1 freq
refers - 27 freq
referees - 2 freq
rovers - 23 freq
rover's - 1 freq
'reivers - 1 freq
rovers' - 1 freq
rievers - 1 freq
reivers' - 1 freq
roooveeers - 1 freq
rephrase - 1 freq
REFERS
Time to execute Levenshtein function - 0.540509 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.813503 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.057911 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.077116 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.000880 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.