Return to search

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.

Identiferoai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:2725
Date January 2008
CreatorsZarrieß, Sina, Seeker, Wolfgang
PublisherUniversität Potsdam, Extern. Extern
Source SetsPotsdam University
LanguageEnglish
Detected LanguageEnglish
TypeInProceedings
Formatapplication/pdf
Rightshttp://opus.kobv.de/ubp/doku/urheberrecht.php

Page generated in 0.0114 seconds