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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
parafin (0) - 1 freq
parrafin (1) - 1 freq
paradin (1) - 2 freq
paraffin (1) - 28 freq
paawin (2) - 1 freq
phrasin (2) - 2 freq
parami (2) - 4 freq
parfit (2) - 2 freq
paraffins (2) - 1 freq
parin (2) - 4 freq
paraadin (2) - 1 freq
prayin (2) - 64 freq
parkin (2) - 16 freq
partyin (2) - 1 freq
strafin (2) - 1 freq
warasin (2) - 1 freq
barfin (2) - 1 freq
partin (2) - 5 freq
haanin (3) - 1 freq
margin (3) - 3 freq
paaken (3) - 1 freq
barin (3) - 4 freq
fardin (3) - 1 freq
parten (3) - 3 freq
draain (3) - 15 freq
parafin (0) - 1 freq
parrafin (2) - 1 freq
paraffin (2) - 28 freq
paradin (2) - 2 freq
parkin (3) - 16 freq
partyin (3) - 1 freq
prayin (3) - 64 freq
partin (3) - 5 freq
barfin (3) - 1 freq
paraadin (3) - 1 freq
pruifin (3) - 3 freq
parfit (3) - 2 freq
parin (3) - 4 freq
profoun (4) - 2 freq
purlin (4) - 1 freq
prunin (4) - 2 freq
partan (4) - 17 freq
prein (4) - 1 freq
pairtyin (4) - 2 freq
parken (4) - 1 freq
pirlin (4) - 8 freq
probin (4) - 3 freq
proafit (4) - 15 freq
pursin (4) - 1 freq
preein (4) - 11 freq
SoundEx code - P615
profundity - 2 freq
perfume - 32 freq
provan - 2 freq
probin - 3 freq
prevented - 2 freq
prevention - 1 freq
ppropone - 1 freq
profoundly - 2 freq
perfumin - 3 freq
propone - 14 freq
parfume - 5 freq
profanity - 2 freq
prippin - 1 freq
provenance - 4 freq
province - 13 freq
profondo - 2 freq
parfumed - 2 freq
parfumes - 1 freq
paraffin - 28 freq
parrifen - 1 freq
perfume's - 1 freq
prevent - 14 freq
provin - 3 freq
pervin - 1 freq
preppin - 1 freq
profound - 6 freq
prooven - 1 freq
paraffins - 1 freq
perfumed - 1 freq
pruifin - 3 freq
proponed - 31 freq
pruivin - 5 freq
previntative - 1 freq
proven - 12 freq
propones - 14 freq
purpones - 3 freq
preponderence - 2 freq
purpone - 2 freq
propont - 1 freq
provençal - 3 freq
proponin - 3 freq
profoond - 2 freq
poreapene - 1 freq
propping - 1 freq
perfumit - 3 freq
perfumes - 1 freq
proponit - 5 freq
profoun - 2 freq
provianter - 1 freq
'provincial - 1 freq
parrafin - 1 freq
provinces - 1 freq
prevene - 1 freq
pruiven - 4 freq
preventin - 4 freq
parafin - 1 freq
proving - 3 freq
€œprophaine - 1 freq
proponing - 1 freq
proppin - 2 freq
peruvian - 1 freq
purifýin - 1 freq
provence - 1 freq
powerpoint - 2 freq
pre-opened - 1 freq
propensity - 2 freq
provonance - 1 freq
perfunctory - 1 freq
preventit - 2 freq
prepone - 1 freq
perfomed - 1 freq
prevents - 1 freq
propine - 1 freq
powerpynt - 1 freq
pravince - 1 freq
'propone' - 1 freq
pre-pandemic - 1 freq
previewin - 1 freq
prepping - 1 freq
MetaPhone code - PRFN
provan - 2 freq
paraffin - 28 freq
parrifen - 1 freq
provin - 3 freq
pervin - 1 freq
prooven - 1 freq
pruifin - 3 freq
pruivin - 5 freq
proven - 12 freq
profoun - 2 freq
parrafin - 1 freq
prevene - 1 freq
pruiven - 4 freq
parafin - 1 freq
€œprophaine - 1 freq
peruvian - 1 freq
purifýin - 1 freq
PARAFIN
Time to execute Levenshtein function - 0.212139 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.362181 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.027550 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.039823 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.001046 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.