Báo cáo khoa học: "Learning Efficient Parsing" docx

... 817–825, Athens, Greece, 30 March – 3 April 2009. c 2009 Association for Computational Linguistics Learning Efficient Parsing Gertjan van Noord University of Groningen G.J.M.van.noord@rug.nl Abstract A corpus-based ... can easily be misunderstood to suggest that the parser does a good job for more than 50%. 4 Learning Efficient Parsing In this section a method is defined for filtering deriva...

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

... 752–759, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Computationally Efficient M-Estimation of Log-Linear Structure Models ∗ Noah A. Smith and Douglas L. Vail and John ... (and decoding under them) is tractable only when the model’s indepen- dence assumptions permit efficient inference proce- dures. For example, in the original conditional ran- dom fi...

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

... hence efficient ac- cessing of the N-gram frequencies becomes an is- sue. Trivial methods such as linear or binary search over the entire dataset in order to access a single N-gram prove inefficient, ... Texas Denton, TX 76203 rada@cs.unt.edu Abstract We introduce a new publicly available tool that implements efficient indexing and re- trieval of large N-gram datasets, such as the Web1T 5-gr...

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

... Sessions, pages 41–44, Prague, June 2007. c 2007 Association for Computational Linguistics An efficient algorithm for building a distributional thesaurus (and other Sketch Engine developments) Pavel

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

... pages 1134–1138, Prague, Czech Republic. Takuya Matsuzaki, Yusuke Miyao, and Jun ichi Tsu- jii. 2007. Efficient HPSG parsing with supertagging and CFG-filtering. In Proceedings of IJCAI-07, pages 1671–1676, ... of shift-reduce parsers is that the scoring model can be defined over actions, al- lowing highly efficient parsing by using a greedy algorithm in which the highest scoring action (or a...

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

... Berkeley {adpauls,klein}@cs.berkeley.edu Abstract A ∗ parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing k- best extraction methods can efficiently search for top derivations, but only after ... and Johnson, 2005), and discriminative train- ing (Och, 2003; McClosky et al., 2006). The most efficient known algorithm for k-best parsing (Jim ´ enez and Marzal, 2...

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

... and more effi- cient voted-perceptron algorithm (Collins, 2002). The linear-chain layout enables efficient interence using the dynamic programming-based Viterbi al- gorithm (Lafferty et al., 2001). We ... #lexicons − 1} to be the union of prases on the #similarlists i/#lexicons most similar lists. 2 4.2.3 Efficiently Creating Lexicons We create lexicons from lists that are similar to our seed...

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

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

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

... Pareto Frontier for potentially large sets of points, so we first describe how this can be done efficiently. Given a set of N vectors {M(h)} from an N-best list L, our goal is extract the subset ... lists each iteration. We use SVMRank (Joachims, 2006) as opti- mization subroutine for PRO, which efficiently handle all pairwise samples without the need for sampling. 4.2 Results Figures 2 and

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