Connectivity in bag generation

Authors:
Arturo Trujillo;Simon Berry
Affiliations:
The Robert Gordon University, Aberdeen, Scotland;The Robert Gordon University, Aberdeen, Scotland
Venue:
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Year:
1996

Citing 7
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Program Flow Analysis: Theory and Application

Program Flow Analysis: Theory and Application
An algorithm for generation in Unification Categorial Grammar

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
On reasoning with ambiguities

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
An efficient generation algorithm for lexicalist MT

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Computing first and follow functions for feature theoretic grammars

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Letting the cat out of the bag: generation for shake-and-bake MT

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a pruning technique which can be used to reduce the number of paths searched in rule-based bag generators of the type proposed by (Poznański et al., 1995) and (Popowich, 1995). Pruning the search space in these generators is important given the computational cost of bag generation. The technique relies on a connetivity constraint between the semantic indices associated with each lexical sign in a bag. Testing the algorithm on a range of sentences shows reductions in the generation time and the number of edges constructed.