Báo cáo khoa học: "Building Semantic Perceptron Net for Topic Spotting" pptx

... precompiling additional information, parsing can be broken down into recognition followed by parse recovery; • providing a formal treatment of the algo- rithms for transforming and minimising ... annotations are unioned; • the parser maintains for each item in the table the set of trees that are valid for the item: initially this is all the valid trees for the automaton, but...

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

... because the transition information is crucial for the two tasks, and the assumption behind C ARPEDIEM is violated. In contrast, the proposed algorithms per- formed reasonably well for all three tasks, ... strongly correlated. This assumption is appropriate for 486 some NLP tasks. For example, as suggested in (Liang et al., 2008), adjacent labels do not provide strong information in PO...

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

... achieves an f-score of for EDU identification, for identifying hierarchical spans, for nuclearity identification and for relation tagging. Parser Discourse Syntax Parser Forest Generator Decoder Chooser Length Output ... . For instance, if is “The mayor is now looking for re-election.”, is “The mayor is now looking for re-election. He has to secure the vote of the democrats.” and...

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

... Association for Computational Linguistics, pages 120–124, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Detecting Semantic Equivalence and Information ... clas- sified if both pairs originated from it are correctly judged (“YES-YES” for bidirectional, “YES-NO” for forward, and “NO-YES” for backward entail- ment). Two-way classification re...

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

... syntactic and semantic features could provide clues to the semantic role label of a constituent, non- local features such as predicate voice could provide information about the expected semantic role ... Dirichlet(α order ) for all interval I do draw θ SR p,I ∼ Dirichlet(α SR ) for all adjacency adj ∈ {0, 1} do draw θ ST OP p,I,adj ∼ Beta(α ST OP ) for all role r ∈ P R ∪ SR do fo...

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

... and the τ 1 parameter for AN to 0.02. 4.3 Discussion For both relations, CL and AN outperform the baseline in overall F-score. For part-of, Table 1 shows that CL outperforms BL by 13.6% in ... one for which the re- lation holds for all possible subsumed senses. For example, the conceptual instance [group#1, PART -OF, multitude#3] is correct, as the relation holds for ev...

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

... related semantic classes • Demonstration that dependency parser paths are inadequate for semantic classification into 7 WordNet classes on TREC news corpora • A benchmark of 10-class semantic ... such as web documents, for example “mp3 player” or “ipod”. We can use WordNet as training data for such classification to the extent that the training on pairs found in Word- Net and test...

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

... as being connected by a link of weight 0. We call this net- work the gloss network (G). We construct another network, the gloss- thesaurus network (GT), by linking synonyms, antonyms and hypernyms, ... (ferromagnetic phase, m = 0). It is known that at some intermediate temperature, ferro- magnetic phase suddenly changes to paramagnetic phase. This phenomenon is called phase transition. Sli...

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

... semantics. Also, the hand- crafting of resources covering the huge amounts of content which are required for deep semantic processing is highly inefficient and expensive. Co-occurrence-based semantic ... serious lim- itations, however: While semantic information is typically encoded in phrases and sentences, distri- butional semantics, in sharp contrast to logic-based semantics, does n...

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

... non-contradictory semantics represent a valuable source of information for learning semantic repre- sentations. A simple and efficient infer- ence method recursively induces joint se- mantic representations for ... (Harris, 1968) to decide on semantic relatedness of terms, but this information may be sparse and not reliable (Weeds and Weir, 2005). For example, when analyzing weather...

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