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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
giggles (0) - 6 freq
goggles (1) - 10 freq
giggled (1) - 7 freq
jiggles (1) - 2 freq
giggle (1) - 21 freq
wiggles (1) - 2 freq
goggle (2) - 1 freq
ingles (2) - 1 freq
giggs (2) - 2 freq
aigles (2) - 1 freq
giglets (2) - 1 freq
piggies (2) - 5 freq
wriggles (2) - 1 freq
singles (2) - 5 freq
shiggles (2) - 1 freq
geggle (2) - 1 freq
waggles (2) - 1 freq
gargles (2) - 1 freq
giggsys (2) - 1 freq
giles (2) - 9 freq
gigglin (2) - 13 freq
geggies (2) - 1 freq
riggies (2) - 1 freq
gigglan (2) - 1 freq
ciggies (2) - 2 freq
giggles (0) - 6 freq
goggles (1) - 10 freq
wiggles (2) - 2 freq
giggle (2) - 21 freq
giggled (2) - 7 freq
jiggles (2) - 2 freq
geggies (3) - 1 freq
giggsys (3) - 1 freq
gigglan (3) - 1 freq
gigglin (3) - 13 freq
muggles (3) - 3 freq
toggles (3) - 1 freq
gargles (3) - 1 freq
weggles (3) - 1 freq
gurggles (3) - 1 freq
juggles (3) - 1 freq
geggle (3) - 1 freq
waggles (3) - 1 freq
giggs (3) - 2 freq
boggles (3) - 3 freq
goggle (3) - 1 freq
gaggle (3) - 5 freq
gingies (4) - 1 freq
ginnles (4) - 1 freq
geggy's (4) - 1 freq
SoundEx code - G242
giggles - 6 freq
googlies - 1 freq
goggles - 10 freq
ghazals - 1 freq
gazelles - 3 freq
gaslight - 1 freq
gochle-green - 2 freq
gisliss - 1 freq
gissliss - 1 freq
gesellschaft' - 1 freq
gisless - 1 freq
gaslicht - 1 freq
gaclochken - 1 freq
MetaPhone code - JKLS
giggles - 6 freq
jagless - 3 freq
juggles - 1 freq
jiggles - 2 freq
jackals - 1 freq
jakelees - 1 freq
GIGGLES
Time to execute Levenshtein function - 0.171956 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.322222 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.027383 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.038160 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.000926 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.