Báo cáo khoa học: "Global Learning of Typed Entailment Rules" ppt

... structure termed typed entailment graph, which will be the learning goal of our algo- rithm. A typed entailment graph is a directed graph where the nodes are typed predicates. A typed pred- icate ... helps disambiguate them and so the problem of ambiguity is greatly reduced. 4 Learning Typed Entailment Graphs Our learning algorithm is composed of two steps: (1) Giv...

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

... acquisition of entailment relations. In Proceedings of EMNLP. Jason Van Hulse, Taghi Khoshgoftaar, and Amri Napolitano. 2007. Experimental perspectives on learning from imbalanced data. In Proceedings of ICML. Frank ... now on the term entailment graph will stand for focused entailment graph. 5 Learning Entailment Graph Edges In this section we present an algorithm for learn...

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

... Implicational The existence of x implies the existence of y op. - 11: Weakly Implicational The existence of x sometimes implies the existence of y op. - Table 1: List of semantic primitives. In ... (1988) combines a set of nine fairly specific relations (e.g., FOCUS -OF, PRODUCT -OF, SETTING -OF) . The key to determine plausibility is the transitivity charac- teristic of the aspe...

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

... thus a tuple of the event and the typed dependency of the protagonist: (event, depen- dency). A narrative chain is a set of narrative events {e 1 , e 2 , , e n }, where n is the size of the chain, ... candidates. Of the 740 cloze tests, 714 of the removed events were present in their respective list of guesses. This is encouraging as only 3.5% of the events are unseen (or do...

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

... trivial set of entailment cases. The experiments with the data sets of the RTE 2005 challenge show an improvement of 4.4% over the state -of- the-art methods. 1 Introduction Recently, textual entailment ... Linguistics Automatic learning of textual entailments with cross-pair similarities Fabio Massimo Zanzotto DISCo University of Milano-Bicocca Milan, Italy zanzotto@disco.uni...

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

... Online Learning of Approximate Dependency Parsing Algorithms Ryan McDonald Fernando Pereira Department of Computer and Information Science University of Pennsylvania Philadelphia, ... parsing algorithm. of dependents have been gathered. T his allows for the collection of pairs of adjacent dependents in a single stage, which allows for the incorporation of second-order scores,...

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

... France emmanuel.dupoux@gmail.com Abstract Accurate unsupervised learning of phonemes of a language directly from speech is demon- strated via an algorithm for joint unsupervised learning of the topology and parameters of a hidden Markov ... im- provement in the efficacy of the SSS algorithm as described in Section 2. It is based on observing that the improvement in the goodness...

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

... indicates an improvement of 22-38% in average pre- cision over unstemmed text, and 96% of the performance of the proprietary stem- mer above. 1 Introduction Stemming is the process of normalizing word ... two examples use the joint probability of the prefix and suffix, with a smoothing back-off (the product of the individual probabilities). Scor- ing models of this form proved to...

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

... Department University of Rochester Rochester, NY 14627 zhanghao@cs.rochester.edu Chris Quirk Microsoft Research One Microsoft Way Redmond, WA 98052 USA chrisq@microsoft.com Robert C. Moore Microsoft Research One ... regimen of 5 it- erations of Model 1, 5 iterations of HMM, and 5 iterations of Model 4. We computed Chinese-to- English and English-to-Chinese word translation ta- bles...

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

... the performance of that grammar to that of a heuristically pruned “minimal subset” of it. The latter’s performance was quite good, achiev- ing 90.8% F 1 score 1 on section 23 of the WSJ. This ... Grammar Matt Post and Daniel Gildea Department of Computer Science University of Rochester Rochester, NY 14627 Abstract Tree substitution grammars (TSGs) of- fer many advantages over co...

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