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 sonsie

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to furraners in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
furraners (0) - 1 freq
furriners (1) - 2 freq
furreners (1) - 1 freq
furriner (2) - 1 freq
forriners (2) - 1 freq
furrener (2) - 1 freq
furnaces (3) - 1 freq
furras (3) - 1 freq
furders (3) - 1 freq
furraed (3) - 2 freq
furiants (3) - 1 freq
ferriers (3) - 1 freq
furneis (3) - 1 freq
murners (3) - 1 freq
frasers (3) - 2 freq
furrier (3) - 1 freq
currants (3) - 7 freq
burners (3) - 7 freq
arrangers (3) - 1 freq
currans (3) - 1 freq
burrabears (3) - 1 freq
furran (3) - 1 freq
rinners (4) - 7 freq
fritters (4) - 4 freq
funner (4) - 1 freq
furraners (0) - 1 freq
furreners (1) - 1 freq
furriners (1) - 2 freq
forriners (2) - 1 freq
furriner (3) - 1 freq
furrener (3) - 1 freq
ferriers (4) - 1 freq
arrangers (5) - 1 freq
currants (5) - 7 freq
currans (5) - 1 freq
foreigners (5) - 7 freq
furrier (5) - 1 freq
furran (5) - 1 freq
burrabears (5) - 1 freq
burners (5) - 7 freq
furnaces (5) - 1 freq
frasers (5) - 2 freq
furras (5) - 1 freq
furiants (5) - 1 freq
furders (5) - 1 freq
murners (5) - 1 freq
furneis (5) - 1 freq
forrart (6) - 3 freq
furlongs (6) - 2 freq
ferrer (6) - 8 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 - FRNRS
forriners - 1 freq
furriners - 2 freq
furreners - 1 freq
furraners - 1 freq
FURRANERS
Time to execute Levenshtein function - 0.355765 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.544250 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.067277 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.069233 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.000936 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.