Báo cáo khoa học: "Automated planning for situated natural language generation" pptx

... Association for Computational Linguistics, pages 1573–1582, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Automated planning for situated natural language generation Konstantina ... finding that it performs well even under the constraints of real- time generation. 1 Introduction The problem of situated natural language gen- eration (NLG...

Ngày tải lên: 17/03/2014, 00:20

... developed for French to English translation. However, in NLU there is a fun- damental asymmetry between the natural language and the unambiguous formal language. Most no- tably, one formal language ... then generated from a sin- gle formal language word using a translation model. The notion of what constitutes a natural clumping depends on the formal language. For examp...

Ngày tải lên: 08/03/2014, 21:20

... 139–144, Portland, Oregon, USA, 21 June 2011. c 2011 Association for Computational Linguistics An Interface for Rapid Natural Language Processing Development in UIMA Balaji R. Soundrarajan, ... anno- tations within natural language processing (NLP) projects built using the open source Apache Un- structured Information Management Architecture (UIMA) 1 . Many NLP tasks are...

Ngày tải lên: 17/03/2014, 00:20

... July 2006. c 2006 Association for Computational Linguistics A Flexible Approach to Natural Language Generation for Disabled Children Pradipta Biswas School of Information Technology Indian ... Mandarin Chinese. The NLG part of this system uses trigram language model for selecting appropriate inflectional form for target language generation. When NLG (or NLP) technolog...

Ngày tải lên: 17/03/2014, 04:20

... A Framework for Unsupervised Natural Language Morphology Induction Christian Monson Language Technologies Institute Carnegie Mellon University 5000 Forbes Ave. Pittsburgh, PA, ... discover the morpho- logical structure of a natural language through the analysis of corpora. This paper presents a framework for automatic natural language morphology induction inspired by ....

Ngày tải lên: 17/03/2014, 06:20

... Active Learning for Statistical Natural Language Parsing Min Tang Spoken Language Systems Group MIT Laboratory for Computer Science Cambridge, Massachusetts 02139, ... to achieve a satisfactory performance using active learning. Active learning has been studied in the context of many natural language processing (NLP) applications such as information extraction(Thompson ... avoid...

Ngày tải lên: 17/03/2014, 08:20

... 2005. c 2005 Association for Computational Linguistics Empirically-based Control of Natural Language Generation Daniel S. Paiva Roger Evans Department of Informatics Information Technology Research ... during the generation of short medical in- formation texts. 1 Introduction This paper 1 is concerned with the problem of con- trolling the output of natural language generati...

Ngày tải lên: 31/03/2014, 03:20

... unseen for a given domain s, we are already performing an implicit form of smoothing (when computing the expected counts), since each docu- ment has a distribution over all topics, and therefore we ... translation table for the source it came from, many word pairs will be unobserved for a given table. This sparsity requires smoothing. Sec- ond, we may not know the (sub)corpora our train...

Ngày tải lên: 19/02/2014, 19:20

... known method for estimating N-gram language models. Kneser-Ney smoothing, however, requires nonstandard N-gram counts for the lower- order models used to smooth the highest- order model. For some ... methods. 1 Introduction Statistical language models are potentially useful for any language technology task that produces natural- language text as a final (or intermediate) outpu...

Ngày tải lên: 20/02/2014, 09:20

... finding all for a given is . Therefore, the total cost is . For all non-empty , we create a new state and for all we set . We create a transition , and for all such that , we set . For all such ... to state such that for all , , is the destination state of some -transition. Lemma 2 For an -gram language model, the number of paths in is less than the -gram order: . Proof. For...

Ngày tải lên: 08/03/2014, 04:22