Please use this identifier to cite or link to this item:
|Title:||A probabilistic forest-to-string model for language generation from typed lambda calculus expressions|
|Authors:||Lu, W. |
|Source:||Lu, W.,Ng, H.T. (2011). A probabilistic forest-to-string model for language generation from typed lambda calculus expressions. EMNLP 2011 - Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference : 1611-1622. ScholarBank@NUS Repository.|
|Abstract:||This paper describes a novel probabilistic approach for generating natural language sentences from their underlying semantics in the form of typed lambda calculus. The approach is built on top of a novel reduction-based weighted synchronous context free grammar formalism, which facilitates the transformation process from typed lambda calculus into natural language sentences. Sentences can then be generated based on such grammar rules with a log-linear model. To acquire such grammar rules automatically in an unsuper-vised manner, we also propose a novel approach with a generative model, which maps from sub-expressions of logical forms to word sequences in natural language sentences. Experiments on benchmark datasets for both English and Chinese generation tasks yield significant improvements over results obtained by two state-of-the-art machine translation models, in terms of both automatic metrics and human evaluation. © 2011 Association for Computational Linguistics.|
|Source Title:||EMNLP 2011 - Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.