Báo cáo khoa học: "Query-Focused Summaries or Query-Biased Summaries ?" potx

... Association for Computational Linguistics:shortpapers, pages 71–76, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Insertion, Deletion, or Substitution? Normalizing ... letters or more in either the dictionary word or the variant. For the chunk alignments in the remain- ing pairs, we sequentially align the letters (e.g., “ph” aligned to “f-”). Note...

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

... is formed by concatenating the partial translation results of each split unit. The proposed method can be incorporated into frameworks that utilize left-to-right parsing and a score for a ... sir for how many people please" Figure 3: Structure for (1) 3.2 Splitting input into well-formed parts and ill-formed parts Item (C) splits input into well-formed parts and ill-formed ... w...

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

... p(word 1 & word 2 ) PMI(word 1 , word 2 ) = log 2 p(word 1 ) p(word 2 ) (1) Here, p(word 1 & word 2 ) is the probability that word 1 and word 2 co-occur. If the words are ... for extracting two-word phrases from reviews. First Word Second Word Third Word (Not Extracted) 1. JJ NN or NNS anything 2. RB, RBR, or RBS JJ not NN nor NNS 3. JJ JJ not NN nor...

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

... translaters (or humans tn general) have many 267 such preference rules based on vartous sorts of cue such as morphological forms of words, collocations of words, text styles, word semantics, ... description format. 12.000 lextcal entrtes have already been prepared according to the formats. In thts classification. Japanese nouns are categorized |nto 8 sub-classes according to thetr mo...

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

... standard stop word list we use, gives us sentences clustered into A as- pects, where each word is labeled as either a stop word, a background word, a document word or an aspect word. 3.3 Comparison ... prize in physics in ? ENT was ? director 3 ENT was the head of ? ENT worked for ? ENT made contributions to ? 4 ENT is best known for work on ? ENT is noted for ? Table 1: Examples of some go...

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

... binds to both its unphosphorylated and its phoshorylated forms. The amount of phosphorylated GSK-3, how- ever, is much lower than the unphosphorylated form and therefore is not detected on the ... phosphorylated [13–16]. Phosphorylation may alter RCAN1’s ability to inhibit calcineurin, as well as RCAN1 degradation rate [14–16]. Therefore, phosphorylation may represent a major mechanism for .....

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

... Torasso Dipartimento di Informatica - Universita' di Torino Via Valperga Caluso 37 - 10125 Torino (ITALY) ABSTRACT The aim of the present paper is to show how a rule-based parser for ... allows for both interpretations. 182 Currently, the syntactic categories of an ambiguous word are ordered manually in the lexicon; since the "first" rule is deten~ined by that order,...

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

... describe parsing algorithms using Parsing Schemata, a framework for high-level description of parsing algorithms (Sikkel, 1997). An interest- ing application of this framework is the analysis ... relations between different parsing algorithms by studying the formal relations between their un- derlying parsing schemata. Originally, this frame- work was created for context-free grammars b...

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

... argument R stands either for "bare" propositions (without any temporal com- ponent) or for propositions with some temporal components. In the latter case the corresponding expression ... once (or twice for certain quanti- fications as e. g. (tuesday) and (da~ in (8)). In order to handle durations, one needs another phase-operator EXT that is quite similar to KAR and ORD....

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

... share also the same parse forest for a, we can represent the context of A * a~ itself and the common parse forest for a only once and fit the set of parse forests for fl into that. Again this ... algorithm [9] that stores items A * a./~ in parse matrix entry Ti i if/~ ,* xi+l xi, instead of storing it if a *° x~+l xj. The space required for a parser that also calculates a parse fores...

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