Verbmobil: A Translation System for Face-to-Face Dialog
Verbmobil: A Translation System for Face-to-Face Dialog
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Ambiguity management in natural language generation
Ambiguity management in natural language generation
The interface between phrasal and functional constraints
Computational Linguistics
Efficient construction of underspecified semantics under massive ambiguity
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Ambiguity preserving machine translation using packed representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
On using a parallel graph rewriting formalism in generation
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Syntactic mismatches in machine translation
Machine Translation
| Hi-index | 0.00 |
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as a word over a vocabulary of description elements (nodes, arcs, labels), and a collection of graphs as a set of such words, that is, as a language over description elements. A packed representation for the collection of graphs is then viewed as a context-free grammar which generates such a language. We present an algorithm that uses a conventional set of transfer rules but is capable of rewriting the CFG representing the source packed structure into a CFG representing the target packed structure that preserves the compaction properties of the source CFG.