... included.The algorithm then loops over each context(CONTEXTS is the set of all contexts): for r, w′ in CONTEXTS:WLIST = set of all w where w, r, w′ exists for w1in WLIST: for w2in ... from1B corpora in under 2 hours.1.1 Algorithm We prepare the corpus by lemmatizing and thenshallow parsing to identify grammatical relation in-stances with the form w1, r, w′, where r is ... Poster Sessions, pages 41–44,Prague, June 2007.c2007 Association for Computational LinguisticsAn efficient algorithm for building a distributional thesaurus (and otherSketch Engine developments)Pavel...