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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
reifs (0) - 1 freq
ruifs (1) - 9 freq
refs (1) - 6 freq
reids (1) - 3 freq
leifs (1) - 3 freq
reefs (1) - 6 freq
reif (1) - 2 freq
reins (1) - 21 freq
reis (1) - 1 freq
yeirs (2) - 45 freq
leift (2) - 1 freq
roofs (2) - 11 freq
rews (2) - 2 freq
meids (2) - 3 freq
reik (2) - 15 freq
reives (2) - 2 freq
reeds (2) - 16 freq
reive (2) - 5 freq
rigs (2) - 62 freq
deips (2) - 1 freq
reigns (2) - 6 freq
heids (2) - 465 freq
seiks (2) - 1 freq
weiys (2) - 4 freq
treis (2) - 9 freq
reifs (0) - 1 freq
reefs (1) - 6 freq
refs (1) - 6 freq
ruifs (1) - 9 freq
reis (2) - 1 freq
rufs (2) - 1 freq
reins (2) - 21 freq
roofs (2) - 11 freq
reif (2) - 2 freq
leifs (2) - 3 freq
reids (2) - 3 freq
reuls (3) - 2 freq
rins (3) - 101 freq
reads (3) - 59 freq
rids (3) - 1 freq
ruif (3) - 77 freq
cuifs (3) - 1 freq
reps (3) - 1 freq
reds (3) - 5 freq
ribs (3) - 33 freq
rife (3) - 18 freq
raips (3) - 7 freq
ris (3) - 41 freq
reels (3) - 21 freq
reuts (3) - 2 freq
SoundEx code - R120
ruifs - 9 freq
reap's - 1 freq
refuge - 6 freq
'reviews - 2 freq
rubbish - 69 freq
raips - 7 freq
roofs - 11 freq
ribs - 33 freq
robes - 7 freq
rab's - 14 freq
rubs - 10 freq
ropes - 21 freq
rubbage - 4 freq
revise - 6 freq
raves - 5 freq
refuse - 25 freq
revs - 1 freq
rabbie's - 5 freq
robbie's - 5 freq
rivvies - 1 freq
rebuke - 3 freq
rebecca - 16 freq
rubies - 4 freq
raipes - 1 freq
reifs - 1 freq
riffs - 2 freq
rbs - 1 freq
rips - 9 freq
reviews - 19 freq
ravish - 1 freq
rfc - 1 freq
rabies - 2 freq
rope's - 1 freq
robbys - 1 freq
robby's - 1 freq
rives - 4 freq
roves - 1 freq
rebekah - 3 freq
refugee - 5 freq
ravsie - 2 freq
ruives - 2 freq
rufus - 5 freq
rufus's - 1 freq
rüfs - 2 freq
reeves - 5 freq
rebigg - 1 freq
reeboks - 1 freq
reives - 2 freq
reefs - 6 freq
rps - 17 freq
'reviews' - 1 freq
rupes - 1 freq
ruffs - 1 freq
refeese - 1 freq
roups - 2 freq
rapes - 1 freq
raps - 1 freq
refaise - 1 freq
ravis - 1 freq
reiffis - 1 freq
rippek - 2 freq
rovies - 1 freq
€œrubbish - 1 freq
re-pack - 1 freq
rubik - 1 freq
rufs - 1 freq
refuise - 1 freq
rob's - 1 freq
rvhs - 1 freq
rpcy - 1 freq
reaps - 11 freq
robskeeee - 1 freq
rbjq - 1 freq
rbj - 1 freq
refs - 6 freq
rpjj - 1 freq
rvjo - 1 freq
rvus - 1 freq
reps - 1 freq
repas - 1 freq
rebs - 3 freq
ruffage - 1 freq
rfk - 1 freq
MetaPhone code - RFS
ruifs - 9 freq
'reviews - 2 freq
roofs - 11 freq
revise - 6 freq
raves - 5 freq
refuse - 25 freq
revs - 1 freq
rivvies - 1 freq
reifs - 1 freq
riffs - 2 freq
reviews - 19 freq
rives - 4 freq
roves - 1 freq
ravsie - 2 freq
ruives - 2 freq
rufus - 5 freq
rüfs - 2 freq
reeves - 5 freq
reives - 2 freq
reefs - 6 freq
'reviews' - 1 freq
ruffs - 1 freq
refeese - 1 freq
refaise - 1 freq
ravis - 1 freq
reiffis - 1 freq
wrvs - 1 freq
rovies - 1 freq
rufs - 1 freq
refuise - 1 freq
rvhs - 1 freq
refs - 6 freq
rvus - 1 freq
REIFS
Time to execute Levenshtein function - 0.209806 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.388112 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.028914 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.039186 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.001097 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.