Báo cáo khoa học: "Graph-based Semi-Supervised Learning Algorithms for NLP" potx

... be informative for many documents. The intuition for also including the maximum relatedness is that for longer docu- ments that may cover many different subtopics, the maximum may be more informative ... the Association for Computational Linguistics, pages 1375–1384, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Local and Global Algorithms...

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

... Association for Computational Linguistics Towards Developing Generation Algorithms for Text-to-Text Applications Radu Soricut and Daniel Marcu Information Sciences Institute University of Southern California 4676 ... expect to be the case for most practical problems, our algorithms perform in poly- nomial time in the number of words available for generation. 4 Evaluation of IDL-NG...

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

... final score computed for each vertex, using the PR formula, applied on an undi- rected graph. The sentences with the highest rank are selected for inclusion in the abstract. For this sample article, ... Page, 1998) is perhaps one of the most popular ranking algorithms, and was designed as a method for Web link analysis. Unlike other ranking algorithms, PageRank integrates the impact...

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

... pages 13–16, Athens, Greece, 3 April 2009. c 2009 Association for Computational Linguistics GOSSIP GALORE A Self -Learning Agent for Exchanging Pop Trivia Xiwen Cheng, Peter Adolphs, Feiyu Xu, ... of two technologies: a) infor- mation wrapping for exaction of personal profiles from structured and semi-structured web content, and b) a minimally supervised machine learning method provi...

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

... decision 4 . T he inference stage exploits the relationships for the propagation of the informa- tion and the BN operates by information reinforce- ment to label a pronoun. We applied all precedent rules ... HC rules method are marked in grey, white is for the LC rules method and black for the Clement’s method 3 . The Pronoun node estimates the de- cision probability for a given it oc...

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

... approaches for inte- grating the results of fully automatic annotation tools into an annotation workflow: bulk anno- tation imports can be performed by format con- version tools distributed with BRAT for ... an intuitive web-based tool for text annotation supported by Natural Language Processing (NLP) technology. BRAT has been developed for rich structured annota- tion for a variety...

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

... ,stem,' for connection to the semantic net- work and for holding the lexical information required for generation. Every lexical feature list used for generating must contain the proper natural language ... its stem as well as any irregularly in- flected forms. Lexical entries for irregularly in- flected forms will only be used during parsing. For the purposes of this pap...

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

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

... indirect methods for leveraging prior knowledge can be cumbersome and unintuitive for a non-machine -learning expert. This paper proposes a method for directly guid- ing the learning of dependency ... Massachusetts Amherst, MA 01003 mccallum@cs.umass.edu Abstract In this paper, we propose a novel method for semi-supervised learning of non- projective log-linear dependency parse...

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

... sentences, for each partial cognate, and then test their per- formance on the testing set. Results for this method are presented later, in Table 5. 5.2 Semi-Supervised Method For the semi-supervised ... senses (one for cognate, one for false friend), but sometimes it has more than two senses: one for cognate and several for false friends (nonetheless, we treat them tog...

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