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

Saved in:
Bibliographic Details
Main Authors: Lu, W., Ng, H.T.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Online Access:http://scholarbank.nus.edu.sg/handle/10635/41239
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-41239
record_format dspace
spelling sg-nus-scholar.10635-412392015-01-09T13:06:53Z A probabilistic forest-to-string model for language generation from typed lambda calculus expressions Lu, W. Ng, H.T. COMPUTER SCIENCE EMNLP 2011 - Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference 1611-1622 2013-07-04T08:22:50Z 2013-07-04T08:22:50Z 2011 Conference Paper 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. 1937284115 http://scholarbank.nus.edu.sg/handle/10635/41239 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
country Singapore
collection ScholarBank@NUS
description EMNLP 2011 - Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Lu, W.
Ng, H.T.
format Conference or Workshop Item
author Lu, W.
Ng, H.T.
spellingShingle Lu, W.
Ng, H.T.
A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
author_sort Lu, W.
title A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
title_short A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
title_full A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
title_fullStr A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
title_full_unstemmed A probabilistic forest-to-string model for language generation from typed lambda calculus expressions
title_sort probabilistic forest-to-string model for language generation from typed lambda calculus expressions
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/41239
_version_ 1681082406138806272