Báo cáo khoa học: "Beam-Width Prediction for Efficient Context-Free Parsing" pot

... Association for Computational Linguistics:shortpapers, pages 676–681, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Unary Constraints for Efficient Context-Free ... term these sin- gle word constituents (SWCs) (see Section 2 for a formal definition). Disallowing SWCs alters span-1 cell population from potentially containing all non- terminals...

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

... avoid the unwanted bias toward small clusters. For cluster , the weight for sample is proportional to . Weight by Performance: The idea of weight by performance is to focus the model on its weakness when ... result shows that for about the same pars- ing accuracy, we only need to annotate a third of the samples as compared to the usual random selection method. 1 Introduction A prerequis...

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

... and the potential of siDNA to induce silencing. Although dsDNA cleav- age induced by Dicer is slightly less efficient than in the case of dsRNA, and a higher dose of siDNA is required for efficient ... effect. Silencing of viral RNA was observed to be most efficient in cases of long dsRNA (89%), long dsDNA (84%), and siRNA (89%), and less efficient for siDNA (70%), whereas long scramb...

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

... Pointwise Prediction for Robust, Adaptable Japanese Morphological Analysis Graham Neubig, Yosuke Nakata, Shinsuke Mori Graduate School of Informatics, Kyoto University Yoshida ... that ignores structure information during learning and tag- ging. Despite the lack of structure, it is able to outperform the current state-of-the-art struc- tured approach for Japanese MA, and achieves accura...

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

... of the Association for Computational Linguistics, pages 497–505, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Dependency Hashing for n-best CCG Parsing Dominick ... Introduction Reranking techniques are commonly used for im- proving the accuracy of parsing (Charniak and John- son, 2005). Efficient decoding of a parse forest is infeasible...

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

... descriptions for the novice tend to include more detail about functional reformation than descriptions for the expert. We have shown how formalization of the strategies allows for the development ... depending on whether the description was for an adult or for a junior. For an adult, an object is described with its sub-parts and their properties; for a junior, the descrip...

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

... calcu- lated in an explicit form as: function PKI classify (X) r = 0 # an array, initialized as 0 foreach i ∈ X foreach j ∈ h(i) r j = r j + 1 end end r esult = 0 foreach j ∈ SV r esult = result ... performance of tasks in NLP. Second, we introduce two fast clas- sification algorithms for this kernel. One is PKI (Polynomial Kernel Inverted), which is an exten- sion of Inverted Index in Infor...

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

... and Giorgio Satta. 1999. Efficient pars- ing for bilexical context-free grammars and head- automaton grammars. In Proceedings of the 37th Annual Meeting of the Association for Computa- tional Linguistics ... learning methods for non-deterministic split head- automata grammars, a powerful hidden- state formalism for dependency parsing. We present a learning algorithm that, like othe...

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

... 02-21 for training, 22 for development, and 23 for testing. Both DP and non-DP parsers use the same feature templates in Table 1. For Secs. 4.1-4.2, we use a baseline model trained with non-DP for ... bits of information from only the last (d + 1) trees on stack instead of the whole stack, because they provide all the relevant information for the features, and thus determine the c...

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

... is performed in a way similar to CKY (Cocke-Kasami-Younger) parser. Initialization: W i, i = Sig i, i ; W i, j = 0, (i≠j); 1: for d = 2 … n do 2: for all i, j s.t. j-i=d-1 do 3: for k ... Baseline Performance Our baseline system feeds word into PB-SMT pipeline. We use GIZA++ model 4 for word alignment, use Moses for phrase-based decoding. The setting of language model...

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