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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fairmers (0) - 38 freq
fairmer' (1) - 1 freq
farmers (1) - 5 freq
fairmer's (1) - 6 freq
fairmer (1) - 65 freq
fairmers' (1) - 3 freq
faithers (2) - 85 freq
farmer's (2) - 3 freq
faitters (2) - 1 freq
faiders (2) - 1 freq
sairvers (2) - 1 freq
cairters (2) - 1 freq
wairmer (2) - 1 freq
gairters (2) - 1 freq
fermers (2) - 90 freq
faichers (2) - 1 freq
fairness (2) - 11 freq
fairmen (2) - 1 freq
fairms (2) - 17 freq
fairmed (2) - 2 freq
lairners (2) - 72 freq
firmer (2) - 4 freq
haimmers (2) - 1 freq
fairer (2) - 12 freq
fairies (2) - 39 freq
fairmers (0) - 38 freq
farmers (1) - 5 freq
fermers (2) - 90 freq
fairmers' (2) - 3 freq
fairmer (2) - 65 freq
fairmer' (2) - 1 freq
fairmer's (2) - 6 freq
fairms (3) - 17 freq
firmer (3) - 4 freq
farmer's (3) - 3 freq
farmer (3) - 9 freq
fermers' (4) - 3 freq
former (4) - 40 freq
ferriers (4) - 1 freq
furders (4) - 1 freq
farms (4) - 2 freq
firms (4) - 11 freq
fermer's (4) - 21 freq
fermer (4) - 194 freq
faerms (4) - 1 freq
fryers (4) - 1 freq
mairkers (4) - 1 freq
rimers (4) - 1 freq
feirms (4) - 2 freq
firm's (4) - 4 freq
SoundEx code - F656
fermer's - 21 freq
fermer - 194 freq
framework - 7 freq
fairmer - 65 freq
former - 40 freq
ferm-yerd-while - 1 freq
farmers - 5 freq
formerly - 3 freq
fermyaird-while - 1 freq
fairmers - 38 freq
fermers - 90 freq
fermers' - 3 freq
firmer - 4 freq
forwunnert - 3 freq
ferm-worker's - 1 freq
free-mairket - 1 freq
ferm-yard-while - 1 freq
fairm-yerd - 1 freq
fairmers' - 3 freq
fairmer's - 6 freq
forin'er - 1 freq
forriners - 1 freq
fermyaird - 5 freq
fairm-yard-while - 1 freq
framewark - 10 freq
fernyears - 10 freq
fairmer' - 1 freq
forwaunert - 1 freq
farmer - 9 freq
framewaark - 29 freq
framewaark'' - 1 freq
framewaark' - 1 freq
fairmyaird-while - 1 freq
forwannert - 1 freq
fernyeir - 1 freq
fernyear - 5 freq
farmer's - 3 freq
fairmyaird - 4 freq
farmyaird - 1 freq
furriners - 2 freq
foirhaimmer - 1 freq
framewirk - 3 freq
farmyard - 1 freq
furriner - 1 freq
formartine - 1 freq
fermerdavie - 2 freq
furrener - 1 freq
furreners - 1 freq
furraners - 1 freq
fernyear- - 1 freq
fermwarker - 1 freq
farmersweekly - 9 freq
farnorthscot - 2 freq
formartineutd - 1 freq
freenorthnow - 3 freq
MetaPhone code - FRMRS
fermer's - 21 freq
farmers - 5 freq
fairmers - 38 freq
fermers - 90 freq
fermers' - 3 freq
fairmers' - 3 freq
fairmer's - 6 freq
farmer's - 3 freq
FAIRMERS
Time to execute Levenshtein function - 0.199405 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.398165 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.027450 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.037801 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.000891 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.