Báo cáo khoa học: "Cross Language Dependency Parsing using a Bilingual Lexicon∗" docx

... recent years. Typical domain adaptation tasks often assume annotated data in new domain absent or insufficient and a large scale unlabeled data available. As unlabeled data are concerned, semi-supervised ... en- hance dependency parsing in a language by using a translated treebank from an- other language. A simple statistical ma- chine translation method, word-by-word decoding...

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

... grammar compatible annotations to train the statistical components. 2 Parser Domain Adaptation In recent years, two statistical dependency parsing systems, MaltParser (Nivre et al., 2007b) and MSTParser ... parsing, while the domain adaptation of the dependency parsing has not been fully explored. Taking a different approach towards parsing, grammar-based parsers appear to have m...

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

... approaches to parsing (McClosky et al., 2006; Suzuki et al., 2009; Steedman et al., 2003; Sagae and Tsujii, 2007) where a parser is first trained on a treebank and then used to parse a large raw ... the naive strategy that was used in 4.2.2. But it has an important drawback: it creates inconsistent parses. Recall that the parser we are using is based on a sec- ond order model, whic...

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

... different parsing models, in particular data-driven models that can be trained on syntactically annotated corpora (Yamada and Matsumoto, 2003; Nivre et al., 2004; McDonald et al., 200 5a; Attardi, ... based on treebank data show that the expected running time is in fact linear for the range of data attested in the corpora. Evaluation on data from five languages shows state-of-the-art accurac...

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

... MST parsing is almost as accurate as cubic-time depen- dency parsing in the case of English, and that it is more accurate with free word order languages. This paper applies MST parsing to MT, and ... practical considerations that make feature computation fast enough for MT. Most features are precomputed before actual decoding. All target -language words to appear during beam search can...

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

... training and evaluating on data from the Prague Dependency Treebank. 2 Dependency Graph Transformations We assume that the goal in dependency parsing is to construct a labeled dependency graph ... is sometimes claimed that one of the advantages of dependency grammar over approaches based on constituency is that it allows a more adequate treat- ment of languages with variable w...

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

... translate the summary from the source language to the target language by using machine translation services. However, though machine translation techniques have been advanced a lot, the machine ... monolingual document summarization, but cross -language document summarization has re- ceived little attention in the past years. A straightforward way for cross -language docu-...

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

... the Association for 2 The Realization Problem In this paper, we deal with the subtask of natural language generation known as surface realization: given a grammar and a semantic representation, ... Generation as Dependency Parsing Alexander Koller and Kristina Striegnitz Dept. of Computational Linguistics, Saarland University {koller|kris}@coli.uni-sb.de Abstract Natural -Language...

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

... English as source language and German, French, and Japanese as target languages. Special emphasis is put on corpus construction, determination of upper bounds and baselines, and a sensitivity analysis ... classification knowledge between two languages. Stated precisely: We are given a text classification task γ in a target lan- guage T for which no labeled documents are avail- able. γ m...

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

... state of the art. An open source release of our parser is freely available. 1 Introduction Transition-based dependency parsing (Yamada and Matsumoto, 2003; Nivre et al., 2006b; Zhang and Clark, ... Transition-based Parsing Algorithm In a typical transition-based parsing process, the in- put words are put into a queue and partially built structures are organized by a stack. A s...

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