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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
restoration (0) - 7 freq
restorative (2) - 3 freq
relocation (3) - 2 freq
desecration (3) - 2 freq
frustration (3) - 18 freq
restorin (3) - 3 freq
resortin (3) - 3 freq
reformation (3) - 20 freq
castration (3) - 1 freq
resignation (3) - 12 freq
desolation (3) - 2 freq
resonatin (3) - 1 freq
distortion (3) - 1 freq
destination (3) - 19 freq
gestation (3) - 1 freq
registration (3) - 6 freq
reservation (3) - 4 freq
desperation (3) - 20 freq
prostration (3) - 1 freq
restrain (3) - 2 freq
decoration (3) - 4 freq
resolution (3) - 19 freq
estimation (3) - 1 freq
dislocation (4) - 1 freq
frustratin (4) - 2 freq
restoration (0) - 7 freq
restorative (3) - 3 freq
castration (4) - 1 freq
distortion (4) - 1 freq
restaurautioun (4) - 2 freq
registration (4) - 6 freq
resortin (4) - 3 freq
restrain (4) - 2 freq
prostration (4) - 1 freq
frustration (4) - 18 freq
restorin (4) - 3 freq
restoret (5) - 1 freq
frustratin (5) - 2 freq
arbitration (5) - 4 freq
retreatin (5) - 1 freq
saturation (5) - 1 freq
estimation (5) - 1 freq
distortin (5) - 2 freq
restrictin (5) - 2 freq
furstration (5) - 1 freq
resolution (5) - 19 freq
desecration (5) - 2 freq
resignation (5) - 12 freq
resonatin (5) - 1 freq
gestation (5) - 1 freq
SoundEx code - R236
rose-tree - 18 freq
ragged-trousered - 2 freq
restaurant - 28 freq
re-stringin - 1 freq
restorative - 3 freq
rasther - 1 freq
rostert - 2 freq
roasters - 8 freq
restored - 11 freq
restoration - 7 freq
restaurants - 16 freq
rooster - 18 freq
rachters - 1 freq
restore - 9 freq
restraint - 5 freq
restores - 2 freq
rostrum - 1 freq
rector - 4 freq
restorin - 3 freq
restrictions - 19 freq
restrained - 3 freq
restrain - 2 freq
restaurant's - 1 freq
roostèr - 3 freq
'restrictive - 1 freq
rosetree - 1 freq
roosters - 3 freq
restaurit - 1 freq
resteraunt - 1 freq
Þrastardóttir - 2 freq
restorin' - 1 freq
re-stairtet - 1 freq
restairt - 2 freq
'restored' - 1 freq
roisterous - 1 freq
restrick - 1 freq
raughters - 3 freq
restoring - 1 freq
restrictit - 4 freq
reciters - 1 freq
restrickit - 5 freq
restaurautioun - 2 freq
rauchters - 1 freq
rocketry - 1 freq
ressettaris - 1 freq
reactor - 2 freq
richter - 3 freq
restricted - 1 freq
roisterin - 1 freq
restricks - 1 freq
€˜restrict - 1 freq
raughter - 1 freq
ragstore - 1 freq
restrict - 1 freq
rosewatter - 1 freq
restoret - 1 freq
restrictin - 2 freq
restraints - 1 freq
righttreat - 1 freq
richters - 1 freq
rickedwards - 2 freq
rockster - 1 freq
restreections - 2 freq
restraunts - 1 freq
rustier - 1 freq
roketronnie - 1 freq
restrictive - 1 freq
roaster - 17 freq
rctrajn - 1 freq
restarted - 1 freq
MetaPhone code - RSTRXN
restoration - 7 freq
restaurautioun - 2 freq
RESTORATION
Time to execute Levenshtein function - 0.235601 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.422843 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.027908 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.038398 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.000975 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.