|
|
Eingang zum VolltextHome | Suche | Browsen |
||||||||||||||||||||||||||||||
|
Lizenz
Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende URN: urn:nbn:de:kobv:517-opus-27254 URL: http://opus.kobv.de/ubp/volltexte/2008/2725/ Zarrieß, Sina ; Seeker, Wolfgang
Finite-state rule deduction for parsing non-constituent coordination
Kurzfassung auf DeutschIn 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.
| |||||||||||||||||||||||||||||||
|
Home | Leitlinien | Impressum | Haftungsausschluss | Statistik | Universitätsverlag | Universitätsbibliothek
| |||||||||||||||||||||||||||||||