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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
girds (0) - 5 freq
girns (1) - 19 freq
girls (1) - 58 freq
airds (1) - 15 freq
giros (1) - 1 freq
birds (1) - 198 freq
gird (1) - 48 freq
mirds (1) - 1 freq
hirds (1) - 8 freq
wirds (1) - 868 freq
gairds (1) - 16 freq
girs (1) - 4 freq
girss (1) - 16 freq
gills (2) - 8 freq
'birds (2) - 2 freq
aircs (2) - 1 freq
germs (2) - 4 freq
godds (2) - 1 freq
gis (2) - 1 freq
gowds (2) - 1 freq
giggs (2) - 2 freq
rinds (2) - 1 freq
guilds (2) - 4 freq
gros (2) - 8 freq
curds (2) - 3 freq
girds (0) - 5 freq
gairds (1) - 16 freq
girs (2) - 4 freq
girss (2) - 16 freq
grids (2) - 1 freq
gyurds (2) - 1 freq
wirds (2) - 868 freq
guairds (2) - 21 freq
guards (2) - 13 freq
girns (2) - 19 freq
girls (2) - 58 freq
giros (2) - 1 freq
airds (2) - 15 freq
hirds (2) - 8 freq
mirds (2) - 1 freq
gird (2) - 48 freq
birds (2) - 198 freq
kerds (3) - 1 freq
gar's (3) - 2 freq
buirds (3) - 6 freq
guds (3) - 1 freq
rids (3) - 1 freq
gorms (3) - 2 freq
words (3) - 802 freq
garde (3) - 1 freq
SoundEx code - G632
greets - 25 freq
geordie's - 31 freq
gore-tex - 1 freq
geordies - 4 freq
greits - 3 freq
gairds - 16 freq
grudge - 10 freq
gartcosh - 1 freq
groats - 5 freq
girth-strap - 1 freq
greatest - 41 freq
grates - 5 freq
girths - 2 freq
great-great-uncle - 1 freq
guairds - 21 freq
guards - 13 freq
grotesque - 3 freq
grotesque-macabre - 1 freq
great-grandfaither - 1 freq
grades - 9 freq
girds - 5 freq
gertie's - 2 freq
grate's - 1 freq
gretest - 2 freq
'geordie's - 1 freq
grats - 1 freq
grudges - 2 freq
grettest - 1 freq
greats - 4 freq
great-granda - 4 freq
great-granda's - 1 freq
grudged - 1 freq
great-great-great-granda - 1 freq
great-greatgranda - 1 freq
great-granny's - 1 freq
graiths - 2 freq
grotesques - 1 freq
groaties - 2 freq
great-granfaither - 3 freq
great-granbairns - 2 freq
graith-sapplet - 1 freq
greit-grandfaither - 1 freq
grit-grit-graand-faider - 1 freq
grit-grand-faider - 1 freq
gardies - 1 freq
gyurds - 1 freq
guardsmen - 1 freq
grytest - 4 freq
graith's - 1 freq
greedy's - 1 freq
grudginly - 1 freq
grudgin - 2 freq
groat's - 1 freq
grutchin-lik - 1 freq
great-grandson - 2 freq
gratis - 3 freq
gairdies - 1 freq
great-grandad - 1 freq
gretcoat - 1 freq
gordson - 1 freq
greedius - 1 freq
gritest - 1 freq
geordic - 1 freq
grids - 1 freq
great-great-great-great-great-great - 1 freq
great-great - 1 freq
grits - 1 freq
greatguy - 1 freq
garethsoye - 1 freq
grudgingly - 1 freq
grudging - 1 freq
garrydclarke - 2 freq
gerdastevenson - 8 freq
gortex - 2 freq
grethy-cloot - 1 freq
gearttigchelaar - 1 freq
MetaPhone code - JRTS
geordie's - 31 freq
geordies - 4 freq
jurado's - 1 freq
girds - 5 freq
gertie's - 2 freq
'geordie's - 1 freq
jordi's - 2 freq
GIRDS
Time to execute Levenshtein function - 0.202612 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.391086 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.027270 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.037231 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.000764 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.