Projecting LFG F-Structures from Chunks
نویسندگان
چکیده
In this paper we pursue two related goals: First, we establish a conceptual link between chunkbased syntactic structures as typically assumed in shallow parsing approaches, as opposed to principle-based syntactic structures as assumed in theoretical linguistics research. This conceptual link emerges from the study of configurational vs. non-configurational languages, their analysis within the LFG framework, and the observation of diverse strategies for ambiguity resolution across this spectrum of (non-)configurational language types. Second, we show how shallow analyses as usually employed in practical NLP applications can be refined to deliver full-fledged syntactic representations, by designing an architecture for LFG f-structure projection from chunk-based syntactic analyses. In line with our two-fold goal we will demonstrate that principles for f-structure projection from chunks are similar – modulo specific attachment constraints – to the LFG analysis of non-configurational languages. In essence, then, besides the design of a new style of robust LFG processing from chunk-based analyses, our investigation offers theoretical insight into the kind of abstraction (i.e. underspecification) employed in shallow analysis, and how it can be formalised within the LFG framework. In particular, we will show how to adapt the LFG analysis of non-configurational case-stacking languages in terms of inside-out functionality to the projection of full-fledged f-structures from chunk-based analyses of configurational languages.
منابع مشابه
A Broad-coverage, Representationally Minimal Lfg Parser: Chunks and F-structures Are Sufficient
Amajor 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 other...
متن کاملA Broad-Coverage, Representationally Minimalist LFG-like Parser: Chunks and F-Structures Are Enough
Tesnière’s concept of Functional Dependency Grammar can be seen as a monostratal LFG that only knows F-structure. Combining Frank’s projection of F-structures from chunks model with statistical techniques we build a parser that outputs LFG F-structure like structures, is representationally minimalist, combines shallow and deep analysis, is deep-linguistic, robust, fast, psycholinguistically pla...
متن کاملTreebank-Based Acquisition of Chinese LFG Resources for Parsing and Generation
This thesis describes a treebank-based approach to automatically acquire robust, wide-coverage Lexical-Functional Grammar (LFG) resources for Chinese parsing and generation, which is part of a larger project on the rapid construction of deep, large-scale, constraint-based, multilingual grammatical resources. I present an application-oriented LFG analysis for Chinese core linguistic phenomena an...
متن کاملData-Driven Compilation of LFG Semantic Forms
In a recent paper (van Genabith et al., 1999) describe a semi-automatic method for annotating tree banks with high level Lexical Functional Grammar (LFG) f-structure representations. First, a CF-PSG is automatically induced from the tree bank using the method described in (Charniak, 1996). The CF-PSG is then manually annotated with functional schemata. The resulting LFG is then used to determin...
متن کاملDirect and Underspecified Interpretations of LFG f-structures
We describe an approach to interpreting LFG f-structures (Kaplan & Bresnan, 1982) truth-conditionally as underspeci-fled quasi-logical forms. F-structures are either interpreted indirectly in terms of a homomorphic embedding into Quasi al., 1994a) representations or directly in terms of adapting QLF interpretation clauses to f-structure representations. We provide a reverse mapping from QLFs to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003