Báo cáo khoa học: "An Ontology-based Semantic Tagger for IE system" pot
... 7.3% Semantic tagger using sense tagging output 93.5% 72.6% 11.3% Average performance of the semantic tagger 89.4% 83.7% 8.3% Table 2: Precision and Recall scores for each com- ponents of the semantic ... An Ontology-based Semantic Tagger for IE system Narj ` es Boufaden Department of Computer Science Universit ´ e de Montr ´ eal Quebec, H3C 3J7 ... the Brill trans- form...
Ngày tải lên: 23/03/2014, 19:20
... methods for estimating the 4 Term MSD refers to the three orientations (reordering types), including Monotone (M), Swap (S), and Discontinuous (D). 20 probabilities of the three orientations ... regarded as a parsing problem. Therefore, the above chart-based decoder is directly applicable to 21 the hierarchical phrase-based and syntax- based models. For efficient integration of n...
Ngày tải lên: 19/02/2014, 20:20
... al. (2001); Ng and Cardie (2002)). Although having achieved reasonable success, the mention-pair model has a limitation that informa- tion beyond mention pairs is ignored for training and testing. ... entities are coreferential or not. The features describing the relationships between two entities are obtained based on the information of every possible pair of mentions from the two en- titi...
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
... difficulties, the algorithm as it was published is also incorrect. Brief indications of the nature of the incorrectness have been given before by Kinyon (1997). There seems to be no straightforward ... 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 eac...
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
... Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines NINOMIYA Takashi t, TORISAWA Kentaro t and TSUJII Jun'ichi t$ tDepartment of Information Science ... ule for solving constraints on TFSs and send- ing/receiving TFSs to/from other agents in an efficient manner. From a programmers' point of view, PSTFS provides a simple and unified...
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
... INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION Alon Lavie School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA 15213 email : lavie@cs.cmu.edu Abstract ... 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...
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
... 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 United ... shift-reduce parser which tests them for grammatical well-formedness. If they are well-formed, the system halts indicating success. If not, another permutation is tried and the process repeate...
Ngày tải lên: 20/02/2014, 22:20
Tài liệu Báo cáo khoa học: "Syntactic and Semantic Kernels for Short Text Pair Categorization" docx
... properties. 3.1 Shallow Semantic Structures Shallow approaches to semantic processing are making large strides in the direction of efficiently and effectively deriving tacit semantic informa- tion ... the repre- sentation of shallow semantic information along with a comprehensive study on ker- nel methods for the exploitation of syntac- tic /semantic structures for short text pair...
Ngày tải lên: 22/02/2014, 02:20
Báo cáo khoa học: "An exponential translation model for target language morphology" pptx
... number. • For verbs, generated forms had to match the original form for tense and negation. • For adjectives, generated forms had to match the original form for degree of comparison and negation. • For ... be straightforwardly trained for all of them. For the ex- periments described below we trained an exponen- tial model for the p(Y |X) lexical model. For greater speed we e...
Ngày tải lên: 07/03/2014, 22:20
Báo cáo khoa học: " An NLP Tool Suite for Processing Word Lattices" docx
... efficient data structures. Other libraries macaon lex, macaon code and macaon tagger lib represent the lexicon, the morphological data base and the tagger models in memory. MACAON only relies ... the use of MACAON for the LUNA project is the ability to perform the linguistic analyses on the mul- tiple hypotheses produced by the ASR system. It is therefore possible, for a given syntacti...
Ngày tải lên: 07/03/2014, 22:20