Báo cáo khoa học: "AN ISLAND PARSING INTERPRETER FOR THE FULL AUGMENTED TRANSITION NETWORK FORMALISM" potx
... AN ISLAND PARSING INTERPRETER FOR THE FULL AUGMENTED TRANSITION NETWORK FORMALISM John & Carroll University of Cambridge Computer ... observations about island parsing, based on the use of the parser described, and some suggestions for future directions for island parsing research. I INTRODUCTION A. Island Parsing In an ordinary ... the more u...
Ngày tải lên: 09/03/2014, 01:20
... depending on whether the item is predicted or completed, i.e., they ei- ther have the form [A, ρ, C, p] where ρ, C is a range constraint vector of dimension dim (A), or the form [A, φ, c] ... rules The deduction rules are shown in Fig. 1. The first rule scans the yields of terminating clauses. Initialize introduces clauses with the dot on the left of the righthand side. C...
Ngày tải lên: 08/03/2014, 01:20
... well. As for the context-free anal- ysis with CKY, the grammar is required in nor- mal form as a precondition for the TAG parser. Therefore, first the two form is defined and the idea of the constructive ... efficient parsing algorithm. This form is more restricted than the two form, and is closely related to the Chomsky normal form for CFGs. The main emphasis...
Ngày tải lên: 31/03/2014, 18: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
... 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 features. The toolkit has been used ... Then decoding can proceed on the hypergraph as usual. That is, we visit in bottom-up order each node in the parse tree, and calculate the model score for each edge rooti...
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
... an entity, for example, “whether the entity has any men- tion that is a name alias of the active mention?” or “whether most of the mentions in the entity have the same head word as the active ... Specifically, 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...
Ngày tải lên: 20/02/2014, 09:20
Tài liệu Báo cáo khoa học: "An Implemented Description of Japanese: The Lexeed Dictionary and the Hinoki Treebank" ppt
... currently tagging other genres with the same information. We will then use this infor- mation and the thesaurus to build a parsing model that combines syntactic and semantic information. We will ... we base the first growth of our treebank on the dic- tionary definition sentences themselves. We then train a statistical model on the treebank and parse the entire lexicon. From this...
Ngày tải lên: 20/02/2014, 12:20
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... tree. Formally, items are completed if they are of the form [t,T ~ Rt •] or of the form [(t,N),N -+ a •]. The main concept needed for the construction of the LR table is that of LR states. These ... recognizing the (ill-formed) tree in Figure 2: it correctly matches the part to the "south" of the adjunc- tion to the part to the "north-east"....
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
... way. Then, the name-concatenator waits for the name-concatenator-sub to return concatenated names, and puts the return val- ues into the variable R. The CA name-concatenator controls the over- ... described in the previous section. The IDs are realized as pointers on the shared heap. 1. Copy TFSs pointed at by the IDs in the message from the shared heap to the...
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
... Parser The GLR Parsing Algorithm The Generalized LR Parser, developed by Tomita [Tomita, 1986], extended the original Lit parsing al- gorithm to the case of non-LR languages, where the parsing ... using the following formula: penalty = (0.1 * (-loglo(pscore))) The penalty scores of the features are then combined by a linear combination. The weights assigned to th...
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
... 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 repeated. The complexity ... necessary for correctness or even tractability. 4 The Complexity of the Generator The theoretical complexity of the generator is O (n4), where n is the size of the input. We...
Ngày tải lên: 20/02/2014, 22:20