A bottom-up generation for principle-based grammars using constraint propagation

Authors:
Masato Ishizaki
Affiliations:
NTT Communications and Information Processing Laboratories, Kanagawa-ken, Japan
Venue:
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Year:
1990

Citing 6
Cited 0

JPSG parser on constraint logic programming

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
An algorithm for generation in Unification Categorial Grammar

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Ontological promiscuity

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A uniform architecture for parsing and generation

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Generation as structure driven derivation

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bottom-up generation algorithm for principle-based grammars is proposed. Bottom-up generation has (1) an inefficiency because of a high degree of nondeterminism, (2) a limitation caused by inability to process logical forms produced by grammar rules, and (3) an identity semantic problem. This paper describes a solution to these problems and implementation issues for the algorithm using a constraint logic programming language.