Tài liệu Báo cáo khoa học: "A Fast, Accurate Deterministic Parser for Chinese" pdf

... the ACL, pages 425–432, Sydney, July 2006. c 2006 Association for Computational Linguistics A Fast, Accurate Deterministic Parser for Chinese Mengqiu Wang Kenji Sagae Teruko Mitamura Language ... SVM parser is 2-13 times faster than state-of-the-art parsers, while produc- ing more accurate results. Our Maxent and DTree parsers run at speeds 40-270 times faster than state-of-t...

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

... of the Association for Computational Linguistics, pages 180–189, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics A New Dataset and Method for Automatically ... 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...

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

... 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 ... Setup In order to obtain syntactic trees for SDB models and XP+, we parsed source sentences using a lex- icalized PCFG parser (Xiong et al., 2005). The parser was trained on the Penn Chi...

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

... Feature-based approaches transform the context of two entities into a liner vector of carefully selected linguistic features, varying from entity semantic information to lexical and syntactic ... relation hierarchy and co-reference information. Experiments on the ACE 2005 data set show that the positional structure feature can provide stronger support for Chinese relation extraction....

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

... 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 ... repair above, the well-formedness rule says that the repair is well formed if the frag- ment a flight to Boston and to Denver is gram- matical. In this case the repair is well formed since the co...

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

... 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

... Association for Computational Linguistics A Hybrid Convolution Tree Kernel for Semantic Role Labeling Wanxiang Che Harbin Inst. of Tech. Harbin, China, 150001 car@ir.hit.edu.cn Min Zhang Inst. for Infocomm ... 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 kerne...

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

... aliasing forms, we transform all different forms into a standard form for the later ranking and identification. The standard form follows the following rules: • All letters are transformed ... NEs. 83 finer candidate list for verification. First, there might be many different forms for a same NE. For example, “Mr. & Mrs. Smith” may also ap- pear in the form of “Mr. and Mrs....

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

... 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 ... al., 2006; Jansche, 2005). More specialized methods also exist, for ex- ample for support vector machines (Musicant et al., 2003) and for conditional random fields (Gross et al...

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