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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
raivelt (0) - 20 freq
traivelt (1) - 22 freq
raivel (1) - 3 freq
ravelt (1) - 1 freq
raivel't (1) - 1 freq
raivellt (1) - 1 freq
graivelt (1) - 1 freq
raivern (2) - 1 freq
daivert (2) - 2 freq
raiment (2) - 2 freq
draigelt (2) - 2 freq
raicent (2) - 34 freq
daibelt (2) - 1 freq
traivel (2) - 66 freq
railt (2) - 1 freq
taivert (2) - 2 freq
haimelt (2) - 5 freq
taiselt (2) - 1 freq
raivens (2) - 1 freq
rivet (2) - 3 freq
raiven (2) - 1 freq
unraivelt (2) - 2 freq
traivel't (2) - 1 freq
traivilt (2) - 1 freq
taigelt (2) - 12 freq
raivelt (0) - 20 freq
ravelt (1) - 1 freq
graivelt (2) - 1 freq
raivel't (2) - 1 freq
raivellt (2) - 1 freq
traivelt (2) - 22 freq
raivel (2) - 3 freq
rivet (3) - 3 freq
railt (3) - 1 freq
traivilt (3) - 1 freq
unraivelt (3) - 2 freq
revealt (3) - 1 freq
ravel (3) - 2 freq
raivelin (3) - 2 freq
travelt (3) - 1 freq
revolt (3) - 3 freq
revell (4) - 1 freq
rebelt (4) - 1 freq
risult (4) - 1 freq
mervelt (4) - 1 freq
reivit (4) - 5 freq
rivals (4) - 3 freq
raivlin (4) - 1 freq
trevelt (4) - 7 freq
raiveletti (4) - 1 freq
SoundEx code - R143
raivelt - 20 freq
replied - 240 freq
ravelt - 1 freq
revelation - 27 freq
revolution - 30 freq
'replied - 1 freq
raivelled - 7 freq
rebelt - 1 freq
raivellt - 1 freq
revealed - 13 freq
reveal't - 1 freq
rebelled - 1 freq
rifled - 1 freq
revolution' - 1 freq
rippled - 1 freq
ruffled - 4 freq
ripplit - 1 freq
replyed - 9 freq
riplyed - 1 freq
rivulets - 1 freq
revolutionarie - 2 freq
revolutionist - 2 freq
revolt - 3 freq
reply't - 1 freq
ribaldry - 1 freq
revolutions - 4 freq
revolutionary - 6 freq
rehabilitate - 1 freq
revealt - 1 freq
reviled - 2 freq
rebuild' - 1 freq
revolutionize - 1 freq
reffled - 2 freq
rebeild - 1 freq
raffled - 2 freq
revelaetion - 1 freq
rebuilt - 5 freq
reivolution - 1 freq
re-build - 1 freq
rehabilitait - 1 freq
reffelled - 1 freq
raivel't - 1 freq
revolutionar - 1 freq
revealit - 2 freq
revelations - 1 freq
revolts - 1 freq
reibald - 1 freq
rebuildin - 1 freq
rebuild - 1 freq
revoltin - 1 freq
revelatory - 1 freq
replete - 1 freq
reffelation - 1 freq
€˜raiveletti - 1 freq
raiveletti - 1 freq
raphaelite - 1 freq
revoltit - 1 freq
replayed - 1 freq
ravell't - 1 freq
rubbled - 1 freq
revolutionise - 1 freq
rippuld - 1 freq
rebeldread - 1 freq
‘rebuilt’ - 1 freq
rebeltongue - 9 freq
rebuilding - 1 freq
repealed - 1 freq
refollowed - 1 freq
'rebuilding - 1 freq
robflett - 1 freq
reevaluate - 1 freq
MetaPhone code - RFLT
raivelt - 20 freq
ravelt - 1 freq
raivelled - 7 freq
raivellt - 1 freq
revealed - 13 freq
reveal't - 1 freq
rifled - 1 freq
ruffled - 4 freq
revolt - 3 freq
revealt - 1 freq
reviled - 2 freq
reffled - 2 freq
raffled - 2 freq
reffelled - 1 freq
raivel't - 1 freq
revealit - 2 freq
€˜raiveletti - 1 freq
raiveletti - 1 freq
raphaelite - 1 freq
ravell't - 1 freq
reevaluate - 1 freq
RAIVELT
Time to execute Levenshtein function - 0.186710 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.347068 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.027506 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.039322 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.000913 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.