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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
reformin (0) - 3 freq
reformer (2) - 2 freq
reforms (2) - 2 freq
reform (2) - 42 freq
resortin (2) - 3 freq
refrain (2) - 13 freq
referrin (2) - 11 freq
reportin (2) - 15 freq
reformist (2) - 1 freq
refarin (2) - 1 freq
reformt (2) - 1 freq
referin (2) - 1 freq
reformed (2) - 5 freq
reframin (2) - 1 freq
remorsin (2) - 1 freq
formin (2) - 16 freq
recordin (2) - 21 freq
informin (2) - 4 freq
performin (2) - 12 freq
reborn (3) - 7 freq
conformin (3) - 3 freq
hermin (3) - 2 freq
refrains (3) - 1 freq
forman (3) - 13 freq
€˜fermin (3) - 1 freq
reformin (0) - 3 freq
reframin (2) - 1 freq
reformed (3) - 5 freq
reformt (3) - 1 freq
formin (3) - 16 freq
reformer (3) - 2 freq
performin (3) - 12 freq
informin (3) - 4 freq
refarin (3) - 1 freq
referin (3) - 1 freq
reform (3) - 42 freq
reforms (3) - 2 freq
referrin (3) - 11 freq
refrain (3) - 13 freq
farmin (4) - 1 freq
refoarm (4) - 1 freq
reformation (4) - 20 freq
forman (4) - 13 freq
affirmin (4) - 2 freq
perfoarmin (4) - 3 freq
infoarmin (4) - 1 freq
furmin (4) - 1 freq
fermin (4) - 32 freq
reformist (4) - 1 freq
reportin (4) - 15 freq
SoundEx code - R165
refrences - 2 freq
reborn - 7 freq
repairin - 3 freq
reformation - 20 freq
reformer - 2 freq
reformers - 7 freq
reference - 52 freq
referring - 7 freq
referrin - 11 freq
rayburn - 1 freq
reverently - 4 freq
reverend - 40 freq
reverence - 10 freq
refrain - 13 freq
raivern - 1 freq
reformatioun - 3 freq
reformed - 5 freq
reverent - 4 freq
reprehensible - 3 freq
reaffirms - 1 freq
reprimandin - 1 freq
refrains - 1 freq
referendum - 151 freq
reform - 42 freq
reformin - 3 freq
references - 41 freq
raiferendum - 2 freq
raeburn - 1 freq
referent - 3 freq
referenced - 1 freq
referencin - 2 freq
referencing - 1 freq
refarin - 1 freq
raference - 1 freq
rebrand - 2 freq
refoarm - 1 freq
repreein-like - 1 freq
refoarmation - 1 freq
reprentit - 1 freq
reforms - 2 freq
reprent - 2 freq
rfairnie - 12 freq
reparein - 2 freq
reverant - 3 freq
referin - 1 freq
referential - 2 freq
referendums - 16 freq
reformt - 1 freq
refraint - 1 freq
€œreferendum - 1 freq
referenfum - 1 freq
reformist - 1 freq
reframe - 1 freq
reframin - 1 freq
refrained - 1 freq
re-born - 1 freq
re-appearance - 1 freq
reverrons - 1 freq
robreiner - 1 freq
repbrendanboyle - 1 freq
reprimanded - 1 freq
reprimandit - 1 freq
MetaPhone code - RFRMN
reformin - 3 freq
reframin - 1 freq
REFORMIN
Time to execute Levenshtein function - 0.224008 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.363714 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.035406 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.039054 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.000935 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.