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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
reverses (0) - 1 freq
reveries (1) - 1 freq
reversed (1) - 4 freq
reverse (1) - 21 freq
riverse (2) - 1 freq
reversan (2) - 1 freq
verses (2) - 58 freq
reverie (2) - 2 freq
revered (2) - 3 freq
reversal (2) - 1 freq
reverted (2) - 1 freq
revere (2) - 1 freq
reversin (2) - 4 freq
revenues (2) - 4 freq
reeses (2) - 1 freq
referees (2) - 2 freq
recesses (2) - 4 freq
reserves (2) - 4 freq
releases (2) - 2 freq
realises (3) - 6 freq
converses (3) - 1 freq
rovers' (3) - 1 freq
reveesit (3) - 1 freq
reenges (3) - 4 freq
remerks (3) - 8 freq
reverses (0) - 1 freq
reverse (2) - 21 freq
reversed (2) - 4 freq
reveries (2) - 1 freq
reversal (3) - 1 freq
reversin (3) - 4 freq
verses (3) - 58 freq
riverse (3) - 1 freq
reversan (3) - 1 freq
overseas (4) - 2 freq
rivers (4) - 30 freq
reivers' (4) - 1 freq
river's (4) - 7 freq
rievers (4) - 1 freq
versus (4) - 7 freq
rover's (4) - 1 freq
rovers (4) - 23 freq
reivers (4) - 17 freq
rovers' (4) - 1 freq
releases (4) - 2 freq
reeses (4) - 1 freq
revere (4) - 1 freq
reverted (4) - 1 freq
reverie (4) - 2 freq
revered (4) - 3 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 - 21 freq
repressing - 1 freq
representative - 20 freq
representit - 25 freq
represented - 9 freq
reveries - 1 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
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
repress - 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 - RFRSS
reverses - 1 freq
re-freezes - 1 freq
REVERSES
Time to execute Levenshtein function - 0.245554 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.400182 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.027621 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.038743 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.000889 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.