Báo cáo khoa học: "Coupling Label Propagation and Constraints for Temporal Fact Extraction" pdf

... of x f,b or x f,e to t b or t e , respectively. For each during t -fact candidate with x r = 1 , Eq. (4) and Eq. (5) enforce x f,b ≤ t b and t e ≤ x f,e . Inter -Fact Constraints. Since we can refer to a fact f ’s time interval by x f,b and x f,e and ... threshold become fact candidates and are fed into the next stage of label propagation. 4 T -Fact Extraction Buildin...

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

... travel information system at LIMSI The ARISE (Automatic Railway Information Systems for Europe) projects aims developing prototype telephone information services for train travel information ... company and with the SNCF (the French Railways), LIMSI has developed a prototype telephone service providing timetables, simulated fares and reservations, and information on reductio...

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

... analysis; for an overview, see (Al-Sughaiyer and Al-Kharashi, 2004). We summarize some of the most relevant work here. Kataja and Koskenniemi (1988) present a sys- tem for handling Akkadian root -and- pattern ... Kornai (1995), Bird and Ellison (1994), Pulman and Hep- ple (1993), whose formalism Kiraz adopts, and others. 4 Design Goals for MAGEAD This work is aimed at a unified...

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

... more generic approach to the task and one which exploits the labelling information in the training data efficiently and directly. Techniques such as LSA (Landauer and Foltz, 1998) measure, in addition ... a ceiling for the perfor- mance of our system, we calculate the average corre- lation between the CLC and the examiners’ scores, and find an upper bound of 0.796 and 0.792 Pear-...

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

... detec- tion and tracking, and one segment of the text. In order to annotate unambiguously, we need to detect and track both landmarks and actions. A landmark is a hallway or a door, and an action is ... PATH(x, n, start, go) for each label y 1 node[0][y 1 ].cost ← s(y 1 , 0) node[0][y 1 ].end ← start; for j ← 1 to n − 1 for each label y j+1 bestc ← −∞; end ← null; for...

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

... isolation and growth of the virus in cell cultures in vitro or (b) serological tests. The former, while able to provide a more definitive diagnosis, is time consuming and ill-suited for use in Keywords dengue; ... as the PCR [4–14] and nucleic acid sequence-based amplification (NASBA) assays [15,16], and microarrays of cDNA [17] and oligonucleotides [18]. These methods are both quic...

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

... generally: Lemma 2 (Koller and Thater (2006)). Let G be a hnc graph, F 1 and F 2 be R-permutable fragments with root labels f 1 and f 2 , and C 1 any config- uration of G of the form C( f 1 ( , f 2 ( ... deletion, the splits for G with root fragments 2 and 3 are still eliminable; so we can e.g. delete the split for 3. At this point, only one split is left for G. The last split...

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

... are the forbidden k-factors. For example, bb and ⋊b are forbidden 2-factors for L = aa ∗ (b + c). More generally, any SL language L excludes ex- actly those words with any forbidden factors; ... k then u is a k- factor of w. For example, ab is a 2-factor of aaabbb. The function F k maps words to the set of k-factors within them. F k (w) = {u : u is a k-factor of w} For example, F 2...

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

... the curve a-c-estPred. For comparison, the curves r, a, and a-truePred are also plotted. The results show that a-estPred performs consistently better than a, and a-c-estPred in turn performs better than ... the annotation effort and did not deal with the porting of a WSD system to a new domain. Domain adaptation is necessary when the train- ing and target domains are different. In t...

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

... are used for training, section 23 for testing and sections 1 and 22 as devel- oping set. We considered all PropBank argu- ments 6 from Arg0 to Arg9, ArgA and ArgM for a total of 122,774 and 7,359 ... word itself, e.g. gives for all arguments; and (2) the lemma which represents the verb normalized to lower case and infinitive form, e.g. give for all argu- ments. Table 1: S...

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