Báo cáo khoa học: "Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications" docx

... Ohio, USA, June 2008. c 2008 Association for Computational Linguistics splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications Yoav Goldberg and Michael ... popularity as they constantly outper- form other learning algorithms for many NLP tasks. Unfortunately, once a model is trained, the de- cision function for kernel- based c...

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

... describe a technique for estimat- ing the parameters for this model using decision trees. The history-based grammar model provides a mechanism for taking advantage of contextual information from ... with information from dominat- ing constituents. All of these aspects of context are necessary for disambiguation, yet none is suf- ficient. We propose a probabilistic model of con...

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

... 67–72, Columbus, June 2008. c 2008 Association for Computational Linguistics A Hierarchical Approach to Encoding Medical Concepts for Clinical Notes Yitao Zhang School of Information Technologies The University ... to free text has attracted researchers in the Natural Lan- guage Processing (NLP) and Information Retrieval (IR) field for more than 10 years. However, it has only recently e...

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

... of the Association for Computational Linguistics (ACL-10). Luke S. Zettlemoyer and Michael Collins. 2007. Online learning of relaxed CCG grammars for parsing to logi- cal form. In Proceedings ... Process- ing and Computational Natural Language Learning (EMNLP-CoNLL-07), pages 678–687, Prague, Czech Republic, June. 439 Proceedings of the 50th Annual Meeting of the Association for Computa...

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

... the 50th Annual Meeting of the Association for Computational Linguistics, pages 363–367, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Fast and Robust ... be tested for its speed. POS tagging is often performed as a pre-processing step to other tasks (e.g., pars- ing, chunking) and it should not be a bottleneck for those tasks. Moreover, re...

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

... of Computational Linguistics, pages 384–391, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Fast Unsupervised Incremental Parsing Yoav Seginer Institute for ... unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structure similar to dependency links which is well-suited for in...

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

... Annual Meeting of the Association of Computational Linguistics, pages 752–759, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Computationally Efficient M-Estimation ... straightforward (we omit it for space), but of course using such features (while interesting) would complicate inference in decoding. 4 It may be helpful to think of i as forward probab...

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

... Computer Science University of Southern California Stanford University 4676 Admiralty Way, Suite 1001 Stanford, CA 94305 Marina del Rey, CA 90292 jahr@cs.stanford.edu germann,knight,marcu,kyamada @isi.edu Abstract A ... before returning to the start. how to express MT decoding (Model 4 plus En- glish bigrams) in IP format. We first create a salesman graph like the one in Figure 3. To do this,...

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

... (N-grams) are equal. 4.3 Searching for a Record We construct a B + -tree for each N-gram file in the dataset for N = 2, 3, 4, 5, and keep the key of the first N-gram for each file in memory. When a ... second. 5 A rotational latency should also be taken into account be- fore the sequential reading can be done. 2, and so forth. For example, for a given query Our Honorable , the record...

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

... 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 Information ... that, in NLP, the poly- nomial kernel outperforms the simple linear kernel (Kudo and Matsumoto, 2000; Isozaki and Kazawa, 2002). Here, we will give an explicit form of the Polyn...

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