[Corpora-List] Constraint Grammar Workshop at NoDaLiDa 2013

[Eckhard Bick]

We would like to anounce a 1-day Constraint Grammar workshop, to be held 
in connection with the NoDaLiDa 2013 conference in Oslo.

While earlier NoDaLiDa CG workshops have focused on scholarly 
contributions and publishable papers, this one will be a 
laboratory-style workshop on how to write CG grammars.  After a short 
introduction to general rule-writing, participants will learn how to 
exploit special features for individual needs, how to embark on a new CG 
with minimal resources and how to add additional, task-tailored modules 
to existing black-box CGs.

We invite participants who have a general interest in CG, either 
newcomers or existing users who would like to learn more about how to 
use various CG features for solving specific annotation tasks. The 
session will assume little or no prior knowledge of CG rule writing, but 
follow a steep progression curve, which is why participants will be 
asked about their level of CG knowledge when registering for the workshop.

==========================================================

                                       CONSTRAINT GRAMMAR LABORATORY

//Date/:/ 22th May 2013, 9:00 - 17:00
            Place/:/ Seminar room 12, P.A.Munchs hus, ground floor, Oslo 
University

          Workshop web site and registration form: 
http://giellatekno.uit.no/cg/13/

                                            The workshop is free of charge

/Organizers:/ Eckhard Bick (SDU), Tino Didriksen (GS), Kristin Hagen 
(UiO), Trond Trosterud (UiT)

Main conference page: 
http://www.hf.uio.no/iln/english/research/news-and-events/events/conferences/2013/nodalida/index.html

===========================================================

Over the last decade Constraint Grammar (CG) has matured into an 
established formalism for the robust handling of not only parsing and 
corpus annotation per se, but also applicational tasks such as 
computer-aided language learning, lexicography, spell- and grammar 
checking and, not least, machine translation. Grammars can now be found 
for at least 20 languages, and methodologically, the formalism has 
responded to these challenges by integrating various new elements into 
its rule syntax, such as regular expressions, numerical expressions, 
named relations, positional token-manipulation, variable unification, 
arbitrary window spans etc.


-- 
Eckhard Bick,
cand.med., dr.phil.
University of Southern Denmark
e-mail: eckhard.bick at mail.dk
web: http://beta.visl.sdu.dk


_______________________________________________
UNSUBSCRIBE from this page: http://mailman.uib.no/options/corpora
Corpora mailing list
Corpora at uib.no
http://mailman.uib.no/listinfo/corpora