Báo cáo khoa học: "Model-Based Aligner Combination Using Dual Decomposition" doc

... - 27 2012. c 2012 Association for Computational Linguistics Coordination Structure Analysis using Dual Decomposition Atsushi Hanamoto 1 Takuya Matsuzaki 1 1. Department of Computer Science, University ... search algorithm. Thus, we can regard the parser as a decoder for a weighted CFG. 3.3 Dual decomposition Dual decomposition is a classical method to solve complex optimization probl...

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

... Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Model-Based Aligner Combination Using Dual Decomposition John DeNero Google Research denero@google.com Klaus Macherey Google ... technique of dual decomposition has recently been shown to yield state-of-the-art perfor- mance in dependency parsing (Koo et al., 2010). 3.2 Dual Problem Formulation To describe...

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

... )|( )( teP E ε with MLE using ε L as data; estimate )|( )( teP C ε with EM Algorithm using γ L for each ε γ C∈ as data; calculate )|( teP ε as a linear combination of )|( )( teP E ε ... Bilingual Bootstrapping 3.1 Overview Instead of using Monolingual Bootstrapping, we propose a new method for word translation disambiguation using Bilingual Bootstrapping. In tr...

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

... possible combinations of dependency relations. The bunsetsu combinations and corresponding sets of particles are listed in Ta- ble 1. In the analytical process, we calculate for all the combinations ... to rerank the results obtained using an existing machine learning based parsing method showed that our method can im- prove the accuracy of the results obtained using the existing method....

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

... four combinations of training corpora and method. • TRG: The models were trained using only the real-error corpus (baseline). • SRC: Trained using only the pseudo-error corpus. • ALL: Trained using ... task is hindered by the difficulty of collecting large error cor- pora. We tackle this problem by using pseudo- error sentences generated automatically. Fur- thermore, we apply domain ad...

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

... achieves better performance by only using WordNet synonym, hypernym and similar to rela- tions. Adding co-occurrence statistics slightly im- proved performance, while using glosses did not help at ... handful of seeds is used to define the two polarity classes. The method is exper- imentally tested using a manually labeled set of positive and negative words. It out- performs the state of...

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

... observation of a document and the step of generat- ing a title from the estimated information source, but it was for English documents. 1.1 Headline Length One of the tasks of the Document Understanding ... contains almost two million documents with nearly 600 million words. For this work, 260 documents were selected from the cor- pus based on the following steps: • 3170 documents were...

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

... diffcult because individual web pages are organised differently, since standard- ised stylesheets are often considered inappropriate for diverse organisations. Research summary pages using stylesheets ... page. http://www.cl.cam.ac.uk/research/nl/webpage-demo/DTG.html 2.1 Individual researcher summaries To create a web page for an individual researcher, the key-phrases extracted from all th...

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

... result, we achieved signifi- cant performance, an F1-score of 88.54%, in our experiments using various web documents. 1 Introduction Comparing one entity with other entities is one of the most ... Abstract This paper proposes how to automatically identify Korean comparative sentences from text documents. This paper first investigates many comparative sentences referring to pre-...

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

... The clustering result using K-means; (c) Three elongated clusters in the 2D clustering space using Spectral clustering: two dominant eigenvectors; (d) The clustering result using Spectral-based ... main stages: 1) Transformation of Clustering Space (Step 1-4); 2) Clustering in the transformed space using Elongated K-means algorithm (Step 5-6). 2.3 Transformation of Clustering Space We...

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