Seminaire: Centre for Computational Linguistics (CCL), K.U.Leuven

[Alexis Nasr]

           Centre for Computational Linguistics (CCL), K.U.Leuven
                                and
              Computational Linguistics in Flanders (CLIF)

                  invite you to attend the lecture by

                           Philippe Blache
                     Laboratoire Parole et Langage
                        Université de Provence

"Constraints in linguistics and natural language processing : why and how?"

	    Tuesday, march 19, 2002, at 16 h
              Mgr. Sencie Instituut, Erasmusplein, Leuven
                           room MSI 02.15


Abstract

The notion of constraints is broadly used both in formal linguistics (the
constraint-based theories) and in natural language processing (typically
constraint grammars techniques). However, classical approaches don't
really take advantage of the formal and computational properties of this
notion.

I present in this talk a formalism, called Property Grammars, that
represents all linguistic information by means of constraints. I will
show in what sense constraints can constitute an efficient approach for
natural language processing, that offers solutions to difficult problems
such as partial information or interaction between different domains of
linguistic analysis (e.g. prosody/syntax interaction). I illustrate these
aspects with several examples and propose a general solution both in terms
of representation and implementation.


Contact: Piet.Mertens at arts.kuleuven.ac.be
-------------------------------------------------------------------------
Message diffusé par la liste Langage Naturel <LN at cines.fr>
Informations, abonnement : http://www.biomath.jussieu.fr/LN/LN-F/
English version          : http://www.biomath.jussieu.fr/LN/LN/
Archives                 : http://listserv.linguistlist.org/archives/ln.html

La liste LN est parrainée par l'ATALA (Association pour le Traitement
Automatique des Langues)
Information et adhésion  : http://www.atala.org/
-------------------------------------------------------------------------