Finite-state rule deduction for parsing non-constituent coordination

  • In this paper, we present a finite-state approach to constituency and therewith an analysis of coordination phenomena involving so-called non-constituents. We show that non-constituents can be seen as parts of fully-fledged constituents and therefore be coordinated in the same way. We have implemented an algorithm based on finite state automata that generates an LFG grammar assigning valid analyses to non-constituent coordination structures in the German language.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • Export XML

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Sina Zarrieß, Wolfgang Seeker
URN:urn:nbn:de:kobv:517-opus-27254
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