Báo cáo khoa học: "Learning Non-Isomorphic Tree Mappings for Machine Translation" pptx

Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf

Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf

... Parsing for Machine Translation Michel Galley Computer Science Department Stanford University Stanford, CA 94305-9020 mgalley@cs.stanford.edu Christopher D. Manning Computer Science Department Stanford ... significant (p ≤ .01). 2 Dependency parsing for machine translation In this section, we review dependency parsing for- mulated as a maximum spanning tree problem (McDonald et al....

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

9 514 0
Tài liệu Báo cáo khoa học: "Phrase-Based Backoff Models for Machine Translation of Highly Inflected Languages" docx

Tài liệu Báo cáo khoa học: "Phrase-Based Backoff Models for Machine Translation of Highly Inflected Languages" docx

... existing tools. For stemming we use the TreeTagger (Schmid, 1994) for German and the Snowball stemmer 1 for Finnish. A vari- ety of ways for compound splitting have been in- vestigated in machine translation ... applied before training and after gener- ating the output in the target language. Normaliza- tion of English/German inflectional morphology to base forms for the purpose of...

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

8 379 0
Báo cáo khoa học: "Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text" ppt

Báo cáo khoa học: "Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text" ppt

... more information than the corre- sponding bag of lexical items before parsing. Its elements get enriched with additional informa- tion instantiated during the parsing process. In- formation ... lexicon was used for content words. Only a bilingual lexi- con for closed class words and a set of bilingual templates were used. Therefore, new bilingual entries were obtained for all th...

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

8 375 0
Tài liệu Báo cáo khoa học: "Learning Word-Class Lattices for Definition and Hypernym Extraction" doc

Tài liệu Báo cáo khoa học: "Learning Word-Class Lattices for Definition and Hypernym Extraction" doc

... that is they provide a formal explanation for the term of interest. While it is not feasible to manually search texts for definitions, this task can be automatized by means of Machine Learning (ML) ... systems. Similar performance is ob- served when we also account for negative sen- tences – that is we calculate accuracy (with WCL- 3 performing better). All the systems perform sig- nifi...

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

10 567 0
Tài liệu Báo cáo khoa học: "Learning Sub-Word Units for Open Vocabulary Speech Recognition" doc

Tài liệu Báo cáo khoa học: "Learning Sub-Word Units for Open Vocabulary Speech Recognition" doc

... backward computations are carried out explicitly, and the for- ward pass is done through sampling, i.e. we traverse the machine only computing forward probabilities for arcs leaving the sampled state. 4 Once ... likely pronunciation for each word. It is straightforward to extend to multiple pronunciations by first sampling a pronunciation for each word and then sampling a segmentatio...

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

10 443 0
Tài liệu Báo cáo khoa học: "Learning with Unlabeled Data for Text Categorization Using Bootstrapping and Feature Projection Techniques" doc

Tài liệu Báo cáo khoa học: "Learning with Unlabeled Data for Text Categorization Using Bootstrapping and Feature Projection Techniques" doc

... documents (machine- labeled data) from only title words and how we can handle incorrectly labeled documents in the machine- labeled data. This paper provides solutions for these problems. For the ... Technique for Handling Noisy Data of Machine- labeled Data We finally obtained labeled data of a documents unit, machine- labeled data. Now we can learn text classifiers using t...

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

8 444 0
Tài liệu Báo cáo khoa học: "Learning to Recognize Tables in Free Text" pptx

Tài liệu Báo cáo khoa học: "Learning to Recognize Tables in Free Text" pptx

... the text. As tables contain important data and information, it is critical for an information extraction system to be able to extract the information embodied in ta- bles. This can be accomplished ... before the word 3For the purpose of generating the feature values for the first and last hline in a text, we assume that the text is padded with a line of blank space charact...

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

8 495 0
Tài liệu Báo cáo khoa học: "Statistical Decision-Tree Models for Parsing*" ppt

Tài liệu Báo cáo khoa học: "Statistical Decision-Tree Models for Parsing*" ppt

... training example for the decision- tree growing process for the appropriate feature's tree (e.g. each tagging event is used for growing the tagging tree, etc.). After the decision trees are ... training corpus is divided into two sets, approx- imately 90% for tree growing and 10% for tree smoothing. For each parsed sentence in the tree growing corpus, the corr...

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

8 389 0
Báo cáo khoa học: "A Statistical Tree Annotator and Its Applications" pptx

Báo cáo khoa học: "A Statistical Tree Annotator and Its Applications" pptx

... tree structure. For example, the English Penn treebank (Marcus et al., 1993) contains function tags and many carry seman- tic information. To add semantic information to the basic syntactic trees, ... the “Form/function” row carry semantic in- formation, e.g., LOC is for locative expressions, and TMP for temporal expressions. Type Function Tags Grammatical (52.2%) DTV LGS PRD PUT SBJ...

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

9 421 0
Báo cáo khoa học: "Learning Surface Text Patterns for a Question Answering System" doc

Báo cáo khoa học: "Learning Surface Text Patterns for a Question Answering System" doc

... phrases. We use suffix trees for extracting substrings of optimal length. We borrow the idea of suffix trees from computational biology (Gusfield, 97) where it is primarily used for detecting DNA ... searches for repeated word orderings as evidence for Computational Linguistics (ACL), Philadelphia, July 2002, pp. 41-47. Proceedings of the 40th Annual Meeting of the Association...

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

7 251 0
Từ khóa:
w