Finite-state compilation of feature structures for two-level morphology

  • This paper describes a two-level formalism where feature structures are used in contextual rules. Whereas usual two-level grammars describe rational sets over symbol pairs, this new formalism uses tree structured regular expressions. They allow an explicit and precise definition of the scope of feature structures. A given surface form may be described using several feature structures. Feature unification is expressed in contextual rules using variables, like in a unification grammar. Grammars are compiled in finite state multi-tape transducers.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:François Barthélemy
URN:urn:nbn:de:kobv:517-opus-27120
Document Type:Conference Proceeding
Language:English
Date of Publication (online):2008/12/11
Year of Completion:2008
Publishing Institution:Universität Potsdam
Release Date:2008/12/11
Organizational units:Extern / Extern
Dewey Decimal Classification:4 Sprache / 40 Sprache / 400 Sprache
Collections:Universität Potsdam / Tagungen / Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers
Licence (German):License LogoKeine Nutzungslizenz vergeben - es gilt das deutsche Urheberrecht
Notes extern:
The complete edition of the proceedings "Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 ; Revised Papers" is available:
URN urn:nbn:de:kobv:517-opus-23812