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.
Author details: | Sina Zarrieß, Wolfgang Seeker |
---|---|
URN: | urn:nbn:de:kobv:517-opus-27254 |
Publication type: | Conference Proceeding |
Language: | English |
Publication year: | 2008 |
Publishing institution: | Universität Potsdam |
Release date: | 2008/12/11 |
Organizational units: | Extern / Extern |
DDC classification: | 4 Sprache / 40 Sprache / 400 Sprache |
Collection(s): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers |
License (German): | Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
External remark: | 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 |