Lexicalized context-free grammars

Authors:
Yves Schabes;Richard C. Waters
Affiliations:
Mitsubishi Electric Research Laboratories, Cambridge, MA;Mitsubishi Electric Research Laboratories, Cambridge, MA
Venue:
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Year:
1993

Citing 6
Cited 10

The equivalence of four extensions of context-free grammars

Mathematical Systems Theory
A study of tree adjoining grammars

A study of tree adjoining grammars
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Parsing some constrained grammar formalisms

Computational Linguistics
An alternative conception of tree-adjoining derivation

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2

Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Computational Linguistics
An alternative conception of tree-adjoining derivation

Computational Linguistics
Parsing and empty nodes

Computational Linguistics
Restrictions on tree adjoining languages

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Capturing CFLs with Tree Adjoining Grammars

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Optimizing the computational lexicalization of large grammars

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Syntactic-head-driven generation

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
An Earley-type recognizer for dependency grammar

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Constraints on strong generative power

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Evolving stories: tree adjoining grammar guided genetic programming for complex plot generation

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that can only generate context-free languages and can be parsed in cubic time. However, LCFG supports much of the elegance of LTAG's analysis of English and shares with LTAG the ability to lexicalize CFGS without changing the trees generated.