UZH-Logo

Maintenance Infos

A Broad-Coverage, Representationally Minimalist LFG Parser: Chunks and F-Structures Are Enough


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.

Abstract

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.

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.

Downloads

345 downloads since deposited on 23 Dec 2009
130 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
ISSN:1098-6782
Official URL:http://cslipublications.stanford.edu/LFG/10/lfg05schneider.pdf
Permanent URL: https://doi.org/10.5167/uzh-24628

Download

[img]
Preview
Filetype: PDF
Size: 1MB

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations