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.
| Verfasserangaben: | Sina Zarrieß, Wolfgang Seeker |
|---|---|
| URN: | urn:nbn:de:kobv:517-opus-27254 |
| Publikationstyp: | Konferenzveröffentlichung |
| Sprache: | Englisch |
| Erscheinungsjahr: | 2008 |
| Veröffentlichende Institution: | Universität Potsdam |
| Datum der Freischaltung: | 11.12.2008 |
| Organisationseinheiten: | Extern / Extern |
| DDC-Klassifikation: | 4 Sprache / 40 Sprache / 400 Sprache |
| Sammlung(en): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers |
| Lizenz (Deutsch): |  Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
| Externe Anmerkung: | 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 |
