Tài liệu Báo cáo khoa học: "An Efficient Generation Algorith

Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt

... An Efficient Generation Algorithm for Lexicalist MT Victor Poznafiski, John L. Beaven &: Pete Whitelock * SHARP Laboratories of Europe Ltd. Oxford Science Park, Oxford OX4 4GA ... present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information can be transferred to ensure more determinism. 1 Introduction Lexicalist approach...

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

7
410
0

Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx

... an efficient parallel system for processing Typed Feature Structures (TFSs) on shared-memory parallel machines. We call the system Parallel Substrate for TFS (PSTFS}. PSTFS is designed for ... i := O; forall z E F do create uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := 0 to i do R := R U (Wait-lor-result(J~fj)); forend re...

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

7
427
0

Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

... incorrectness have been given before by Kinyon (1997). There seems to be no straightforward way to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and ... alternative LR algorithm for TAGs Mark-Jan Nederhof DFKI Stuhlsatzenhausweg 3 D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for...

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

7
413
0

Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx

... Association for Computational Linguistics, pages 19–24, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics NiuTrans: An Open Source Toolkit for Phrase-based ... of minimum error rate training that allows for various evaluation metrics for tuning the system. In addition, the toolkit provides easy-to-use APIs for the development of new fe...

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

6
530
0

Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf

... discriminative learning algorithm. During resolution, an input document is processed from the ﬁrst mention to the last. For each encountered mention m j , a test instance is formed for each preceding ... m j represents the jth mention (e.g., m 6 for the pronoun “he”). e i j represents the partial entity i before the jth mention. For example, e 1 6 denotes the part of e 1 before m 6 ,...

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

9
476
2

Tài liệu Báo cáo khoa học: "An Alternative Conception of Tree-Adjoining Derivation*" ppt

... productions. For example, Type 3 productions are of the form t[ ~/] -* b[ T/]. For fur- ther information concerning the compilation see the work of Vijay-Shanker and Weir (1990) and Schabes (1991). For ... that is used. Therefore, it can be used as a litmus test for an appropriate definition of derivation. As such, it argues for a nonstandard, independent, notion of derivatio...

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

10
338
0

Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

... fea- tures are designed to be general and, for the most part, grammar and domain independent. For each parse, the heuristic computes a penalty score for each of the fea- tures. The penalties ... tables contain entries with multiple parsing ac- tions. Tomita's algorithm uses a Graph Structured Stack (GSS) in order to efficiently pursue in parallel the different parsing opti...

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

3
346
0

Tài liệu Báo cáo khoa học: "Direct Word Sense Matching for Lexical Substitution" ppt

... Lesk algorithm (Lesk, 1986) as a reference system, since it is considered a standard simple baseline for unsupervised approaches. The Lesk algorithm is one of the ﬁrst algorithms developed for ... approach The indirect approach for sense matching fol- lows the traditional scheme of performing WSD for lexical substitution. First, the WSD classiﬁer described above was trained for...

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

8
362
0

Tài liệu Báo cáo khoa học: "A structure-sharing parser for lexicalized grammars" pptx

... precompiling additional information, parsing can be broken down into recognition followed by parse recovery; • providing a formal treatment of the algorithms for transforming and minimising ... are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automaton- based parser. We present algorithms for con-...

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

7
406
0

Tài liệu Báo cáo khoa học: "ADP based Search Algorithm for Statistical Machine Translation" docx

... additional parameter into the recursion formula for DP. In the following, we will explain this method in detail. 2.3 Recursion Formula for DP In the DP formalism, the search process is described ... words we have to force the algorithm to cover all input string positions. Different strategies to solve this problem are possible: For example, we can in- troduce a reward for...

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

8
480
0