Quick Search:

uzh logo
Browse by:

Zurich Open Repository and Archive

Maintenance: Tuesday, July the 26th 2016, 07:00-10:00

ZORA's new graphical user interface will be relaunched (For further infos watch out slideshow ZORA: Neues Look & Feel). There will be short interrupts on ZORA Service between 07:00am and 10:00 am. Please be patient.

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-24628

Schneider, Gerold (2005). A Broad-Coverage, Representationally Minimalist LFG Parser: Chunks and F-Structures Are Enough. In: LFG05, Bergen, Norway, 18 July 2005 - 20 July 2005.



A major reason why LFG employs c-structure is because it is context-free. According to Tree-Adjoining Grammar (TAG), the only context-sensitive operation that is needed to express natural language is Adjoining, from which LFG functional uncertainty has been shown to follow. Functional uncertainty, which is expressed on the level of f-structure, would then be the only extension needed to an otherwise context-free processing of natural language. We suggest that if f-structures can be derived context-freely, full-fledged c-structures are not strictly needed in LFG, and that chunks and dependencies may be sufficient for a formal grammar theory. In order to substantiate this claim, we combine a projection of f-structures from chunks
model with statistical techniques and present a parser that outputs LFG f-structure like representations. The
parser is representationally minimal, deep-linguistic, robust, and fast, and has been evaluated and applied.
The parser addresses context-sensitive constructions by treating the vast majority of long-distance dependencies by approximation with finite-state patterns, by post-processing, and by LFG functional uncertainty.



280 downloads since deposited on 23 Dec 2009
90 downloads since 12 months

Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Other), refereed, original work
Communities & Collections:06 Faculty of Arts > Institute of Computational Linguistics
06 Faculty of Arts > English Department
Dewey Decimal Classification:000 Computer science, knowledge & systems
820 English & Old English literatures
410 Linguistics
Uncontrolled Keywords:LFG, lexical-functional grammar, formal grammar, dependency grammar, TAG, tree-adjoining grammar, parsing, functional uncertainty
Event End Date:20 July 2005
Deposited On:23 Dec 2009 05:19
Last Modified:11 May 2016 07:52
Official URL:http://cslipublications.stanford.edu/LFG/10/lfg05schneider.pdf

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page