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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
biggar (0) - 7 freq
piggar (1) - 1 freq
buggar (1) - 1 freq
biggan (1) - 7 freq
biggars (1) - 2 freq
bigger (1) - 229 freq
beggar (1) - 16 freq
biggers (2) - 9 freq
baggan (2) - 2 freq
biggit (2) - 244 freq
bigget (2) - 1 freq
bigg't (2) - 1 freq
biggid (2) - 4 freq
rigger (2) - 2 freq
bigder (2) - 7 freq
biggs (2) - 4 freq
bugger (2) - 141 freq
figger (2) - 6 freq
bigg (2) - 110 freq
beggars (2) - 7 freq
bigged (2) - 30 freq
biggans (2) - 6 freq
cigar (2) - 19 freq
diggan (2) - 6 freq
bigsam (2) - 1 freq
biggar (0) - 7 freq
beggar (1) - 16 freq
buggar (1) - 1 freq
bigger (1) - 229 freq
bugger (2) - 141 freq
beigger (2) - 1 freq
biggan (2) - 7 freq
biggars (2) - 2 freq
piggar (2) - 1 freq
biggin (3) - 208 freq
beggery (3) - 1 freq
bigged (3) - 30 freq
bigger' (3) - 1 freq
biggy (3) - 1 freq
buggery (3) - 10 freq
beggars (3) - 7 freq
jigger (3) - 1 freq
ligger (3) - 1 freq
digger (3) - 12 freq
bulgar (3) - 1 freq
baggan (3) - 2 freq
biggid (3) - 4 freq
biggit (3) - 244 freq
biggers (3) - 9 freq
bigg (3) - 110 freq
SoundEx code - B260
bigger - 229 freq
bugger - 141 freq
boozer - 36 freq
bucer - 1 freq
bicker' - 1 freq
beggar - 16 freq
busier - 3 freq
bakery - 16 freq
boys're - 1 freq
buzzer - 8 freq
boxer - 28 freq
biggar - 7 freq
beaker - 6 freq
buggeraa - 1 freq
buggar - 1 freq
bowser - 4 freq
boaxer - 2 freq
beezer - 11 freq
bak-raa - 1 freq
baker - 26 freq
busker - 2 freq
bucher - 1 freq
bicker - 12 freq
bïgger - 1 freq
buggery - 10 freq
bigger' - 1 freq
beigger - 1 freq
basker - 1 freq
bizarre - 10 freq
boksir - 1 freq
bosker - 6 freq
baager - 15 freq
beshrew - 1 freq
beeger - 6 freq
bow-cheir - 3 freq
bowsier - 1 freq
bazaar' - 1 freq
'bugger - 2 freq
buccar - 1 freq
beggerey - 23 freq
beggery - 1 freq
baiker - 1 freq
biker - 3 freq
€œbugger - 1 freq
bshara - 1 freq
€œbizarre - 1 freq
bfhskr - 1 freq
bbcr - 1 freq
byker - 1 freq
bizzare - 1 freq
MetaPhone code - BKR
bigger - 229 freq
bugger - 141 freq
bicker' - 1 freq
beggar - 16 freq
bakery - 16 freq
biggar - 7 freq
beaker - 6 freq
buggeraa - 1 freq
buggar - 1 freq
bak-raa - 1 freq
baker - 26 freq
bicker - 12 freq
bïgger - 1 freq
buggery - 10 freq
bigger' - 1 freq
beigger - 1 freq
'bugger - 2 freq
beggerey - 23 freq
beggery - 1 freq
baiker - 1 freq
biker - 3 freq
€œbugger - 1 freq
bbcr - 1 freq
byker - 1 freq
BIGGAR
Time to execute Levenshtein function - 0.204412 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.339733 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.027164 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.036566 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.000822 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.