Abstract:
LFG (Kaplan and Bresnan, 1982) is based on the now fairly standard assumption that there are several interrelated but independent levels of representation. LFG's c-structure is a representation of phrase structure, and is derived by the underlying
Citations
|
408
|
Lexical-Functional Grammar: A formal system for grammatical representation
– Kaplan, Bresnan
- 1982
|
|
95
|
D-Tree Grammars
– RAMBOW, VIJAY-SHANKER, et al.
- 1995
|
|
93
|
Characterizing Mildly Context-Sensitive Grammar Formalisms
– Weir
- 1988
|
|
79
|
The interface between phrasal and functional constraints
– Maxwell, Kaplan
- 1993
|
|
72
|
Using descriptions of trees in a tree adjoining grammar
– Vijay-Shanker
- 1992
|
|
66
|
Tree adjoining grammars and lexicalized grammars
– Joshi, Schabes
- 1991
|
|
50
|
On multiple context-free grammars
– Seki, Matsumura, et al.
- 1991
|
|
32
|
Long distance scrambling and tree adjoining grammars
– Becker, Joshi, et al.
- 1991
|
|
14
|
Multiset-valued linear index grammars
– Rambow
- 1994
|
|
12
|
Synchronous models of language
– Rambow, Satta
- 1996
|
|
9
|
The derivational generative power, or, scrambling is beyond LCFRS
– Becker, Rambow, et al.
- 1992
|
|
7
|
Long distance dependencies, constituent structure, and functional uncertainity
– Kaplan, Zaenen
- 1989
|
|
5
|
Parsing non-immediate dominance relations
– Becker, Rambow
- 1995
|
|
2
|
Parallel multiple context-free grammars, finite state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammar
– Seki, Nakanishi, et al.
- 1993
|
|
1
|
Aspects of merging lexical-functional grammar with lexicalized tree-adjoining grammar. Unpublished abstract
– Burheim
- 1996
|
|
1
|
Characterising Lexical Functional Grammar (LFG) in terms of Tree Adjoining Grammar
– Kameyama
- 1986
|
|
1
|
Long distance dependencies
– Vijay-Shanker, Joshi
- 1989
|
|
