Towards convenient bi-directional grammar formalisms

Authors:
P. Newman
Affiliations:
IBM Palo Alto Scientific Center, Palo Alto, CA
Venue:
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Year:
1990

Citing 8
Cited 0

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Reversing a lexically based parser for generation

Applied Artificial Intelligence
Slot grammars

Computational Linguistics
Combinatorial disambiguation

ANLC '88 Proceedings of the second conference on Applied natural language processing
French order without order

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A constructive view of GPSG or how to make it work

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
An experimental parser for systemic grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
SAGE: a sentence parsing and generation system

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the advantages for practical bi-directional grammars of combining a lexical focus with the GPSG-originated principle of immediate-dominance/linear-precedence (ID/LP) rule partitioning. It also outlines an implementation approach following these guidelines. The approach is inspired by Slot Grammar, with additions including more explicit mappings between surface and internal representations, and preferential constituent ordering rules.