This workshop is possibly of interest to Apertium developers.
Fran
--- Begin Message ---
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: [email protected]
web: http://beta.visl.sdu.dk
--
Eckhard Bick,
cand.med., dr.phil.
University of Southern Denmark
e-mail: [email protected]
web: http://beta.visl.sdu.dk
--
You received this message because you are subscribed to the Google Groups
"Constraint Grammar" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
--- End Message ---
------------------------------------------------------------------------------
Minimize network downtime and maximize team effectiveness.
Reduce network management and security costs.Learn how to hire
the most talented Cisco Certified professionals. Visit the
Employer Resources Portal
http://www.cisco.com/web/learning/employer_resources/index.html
_______________________________________________
Apertium-stuff mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/apertium-stuff
