Tài liệu Báo cáo khoa học: "A Maximum Expected Utility Framework for Binary Sequence Labeling" doc
... Association for Computational Linguistics A Maximum Expected Utility Framework for Binary Sequence Labeling Martin Jansche ∗ jansche@acm.org Abstract We consider the problem of predictive infer- ence for ... Notation We formulate our approach in terms of sequence la- beling, although it has applications beyond that. This is motivated by the fact that our framework for...
Ngày tải lên: 20/02/2014, 12:20
... under the framework of convo- lution tree kernel for SRL. In this paper, we fol- low the same framework and design a novel hybrid convolution kernel for SRL. 3 Feature-based methods for SRL Usually ... con- volution kernels for a discrete structure. In the context of convolution kernels, more and more kernels for restricted syntaxes or specific do- mains, such as string kernel f...
Ngày tải lên: 20/02/2014, 12:20
... There- fore, these results clearly indicate that the electron transport system for CYP175A1 is composed of Fdx, FNR, and NADPH (Fig. 4B). All quantitative analyses were performed at 65 °C for 2 ... via OFOR and Fdx to CYP119 [13,14]. Inter- estingly, the electron transport system for CYP175A1 did not utilize OFOR, although the T. thermophilus HB27 genome contains the genes encoding OFOR...
Ngày tải lên: 18/02/2014, 08:20
Tài liệu Báo cáo khoa học: "A New Dataset and Method for Automatically Grading ESOL Texts" pdf
... overall performance is investigated. 3.1 Rank preference model SVMs have been extensively used for learning clas- sification, regression and ranking functions. In its basic form, a binary SVM ... analyses of the perfor- 180 mance of individual systems, as yet there is no pub- lically available shared dataset for training and test- ing such systems and comparing their performance. As it i...
Ngày tải lên: 20/02/2014, 04:20
Tài liệu Báo cáo khoa học: "A Syntax-Driven Bracketing Model for Phrase-Based Translation" pptx
... then 8: Update bracketing instances for index j 9: end if 10: end if 11: end for 12: for each j ∈ c do 13: := ∪ {bracketing instances from j} 14: end for 15: Output: bracketing instances ... potential brack- eting instances for each (i, j, k) ∈ c but only keep 4 bracketing instances for each index j: two min- imal and two maximal instances. This algorithm learns binary brack...
Ngày tải lên: 20/02/2014, 07:20
Tài liệu Báo cáo khoa học: "A Unified Syntactic Model for Parsing Fluent and Disfluent Speech∗" ppt
... the left-right dual of a left- corner transform. It transforms all right recursive sequences in each tree into left recursive sequences of symbols of the form A 1 /A 2 , denoting an incom- plete ... Right-corner transform Binarized trees 2 are then transformed into right- corner trees using transform rules similar to those described by Johnson(1998a). This right-corner transform is simply the...
Ngày tải lên: 20/02/2014, 09:20
Tài liệu Báo cáo khoa học: "A Fast, Accurate Deterministic Parser for Chinese" pdf
... in (Bikel, 2004). With this additional information, reduce actions are now in the form of Reduce- {Binary |Unary}-X-Direction. The “Direction” tag gives information about whether to take the head-node of ... case of binary reduc- tion. A simple transformation process as described in (Sagae and Lavie, 2005) is employed to con- vert between arbitrary branching trees and binary trees. This...
Ngày tải lên: 20/02/2014, 12:20
Tài liệu Báo cáo khoa học: "A Phrase-based Statistical Model for SMS Text Normalization" ppt
... substitution transformations, but inadequate to address the insertion transforma- tion. For example, the lingoes “duno”, “ysnite” have to be normalized using an insertion trans- formation to become ... of 2300 transforma- tions. Substitution accounts for almost 86% of all transformations. Deletion and substitution make up the rest. Table 3 shows the top 10 most com- mon transformatio...
Ngày tải lên: 20/02/2014, 12:20
Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot
... description • Assess, the likely evaluation for completion • Minassess, the possible minimum for Assess • Successors, pointers to daugther nodes • Nextprop, boolean combination for successors The tree is initialized ... referent(s). Several algorithms have been developed for this purpose, differing in terms of computational efficiency, quality and coverage. For identifying sets o...
Ngày tải lên: 22/02/2014, 02:20
Tài liệu Báo cáo khoa học: "A text-based search interface for Multimedia Dialectics" ppt
... such theoretical framework has been developed and used for annotating a corpus of audiovisual documents with the objective of us- ing such corpus for developing multimedia infor- mation processing ... use in multimodal commu- nication. In this paper, we present a sup- port tool for COSMOROE, a theoretical framework for modelling multimedia di- alectics. The tool is a text-based se...
Ngày tải lên: 22/02/2014, 02:20