Báo cáo khoa học: "An Electronic Computer Program for Translating Chinese into English" ppt
... [ Mechanical Translation , vol.3, no.1, July 1956; pp. 14-18] An Electronic Computer Program for Translating Chinese into English A. F. Parker-Rhodes General Considerations The procedure ... we arrange for the taxon to be subtracted from its predecessor; if the result is 0, the Computer Program 17 N.B. The points are entered for ease of reading only; in t...
Ngày tải lên: 30/03/2014, 17:20
... Èg tÈs uÈu aÈa lÈl To allow for richer contextual information, we expand each nonmatch substitution to incorporate up to N additional adjacent edits. For example, for the first nonmatch edit ... that assigns uniform probability to all words in the dictionary. In Table 1 we show K-best results for different maximum context window sizes, without using positional information. For insta...
Ngày tải lên: 23/03/2014, 19:20
... programming language, two practical alternatives were discussed: • Write code without operating platform dependencies and according to standards, that would allow compilers for both platforms ... Lehrstuhl für Informatik VI, Computer Science Department, RWTH Aachen - University of Technology (Germany): statistical translation, speech recognition. Instituto Tecnológico de Informát...
Ngày tải lên: 17/03/2014, 06:20
Tài liệu Báo cáo khoa học: An autoinhibitory effect of the homothorax domain of Meis2 ppt
... HTH functions could be performed by both isoforms, although for antenna development only full-length HTH was sufficient. It may therefore be that Meis2e- like proteins are functional for some activities, ... represents a naturally occurring dominant negative form of Meis2 that might be able to interfere by competing with other Meis isoforms for binding to Pbx1, for example. Our attempt...
Ngày tải lên: 16/02/2014, 15:20
Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx
... running speed for both training and decoding stages. This property is especially important when the programs are used for large scale translation. While the development of C++ program is slower ... 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 fea...
Ngày tải lên: 19/02/2014, 20:20
Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf
... consider the mentions in its previous two sentences for feature computation. 846 ILP uses logic programming as a uniform repre- sentation for examples, background knowledge and hypotheses. Given ... 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 , i.e.,...
Ngày tải lên: 20/02/2014, 09:20
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... satisfying: • CS(N) + C_ CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for each N, children(N) ... needed for construction of parse trees (or "derived trees" as they are often called for TAGs) and the computation of features are al- most identical to the correspondi...
Ngày tải lên: 20/02/2014, 18:20
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
... 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 return ... concatenate_name 2 Programmers' View From a programmers" point of view, the PSTFS mechanism is quite simple and natural, which is due to careful design for accomplishing high- pe...
Ngày tải lên: 20/02/2014, 18:20
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx
... AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION Alon Lavie School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA 15213 email : ... 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 ... di...
Ngày tải lên: 20/02/2014, 21:20
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
... it is well-formed or ill-formed. • maximal iff it is well-formed and its parent (if it has one) is ill-formed. In other words, a maxi- mal TNCB is a largest well-formed component of a TNCB. ... permutation of signs is input to a shift-reduce parser which tests them for grammatical well-formedness. If they are well-formed, the system halts indicating success. If not, another permutat...
Ngày tải lên: 20/02/2014, 22:20