earley and tomita parsing

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

... w.r.t. the training epoch (x-axis) and parsing feature weights (in legend). tagging (Zhang and Clark, 2008; Zhang and Clark, 2010) and dependency parsing (Huang and Sagae, 2010). Therefore, we can ... q −1 and q −2 respectively denote the last-shifted word and the word shifted before q −1 . q.w and q.t respectively denote the (root) word form and POS tag of a subtree (word) q, and q.b and q.e ... (Hatori et al., 2011) and richer parsing features (Zhang and Nivre, 2011). Acknowledgement We are grateful to the anony- mous reviewers for their comments and suggestions, and to Xianchao Wu, Kun...

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

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

Ngày tải lên: 17/03/2014, 00:20

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

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

Ngày tải lên: 23/03/2014, 14:20

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

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

... repair sym- bols 3 , and interruption point information. While an integrated system for processing and parsing speech may use both acoustic and syntactic information to find repairs, and thus may have ... terminal symbols indi- cating e.g. the start and end of the reparandum. between reparanda and alterations. A hybrid system using the right corner transform and keeping infor- mation about how a repair ... system achieves high accuracy in both parsing and detecting reparanda in text, by making use of transformations that create incomplete categories, which model the reparanda of speech repair well. References Elizabeth...

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

... proba- bilities, and is fixed to the best value by consider- ing development data (different from the training data) 1 . Reranking Candidate 1 Candidate 2 Candidate 3 Candidate 4 : Case element : Verb Candidate Candidate Figure ... data. The best parse which uses this data set is (Kudo and Matsumoto, 2005), and their parsing accuracy is 91.37%. The features and the parsing method used by their model are almost equal to ... Verb Candidate Candidate Figure 2: Selection of possible parses for reranking Many methods for reranking the parsing of En- glish sentences have been proposed (Charniak and Johnson, 2005; Collins and Koo,...

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

... Buchholz and Erwin Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proceedings of the CoNLL-X. Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and ... Machine Intelligence, 27(6). John Lafferty, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic mod- els for segmenting and labeling sequence data. In Pro- ceedings ... al., 2001; Taskar et al., 2006), constituent and depen- dency parsing (Collins and Duffy, 2002; McDon- ald et al., 2005), and logical form extraction (Zettle- moyer and Collins, 2005). Machine learning...

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

... with good coverage, accuracy, and efficiency 4. Next we considered the left-corner parsing strategy. 3.2 Left-corner parsing Left-corner (LC) parsing (Rosenkrantz and Lewis II, 1970) is a well-known ... panded, as well as a history, probability, and FOM. The highest ranked analysis is popped from the pending heap, and the category at the top of its stack is expanded. A category is ex- panded ... referential ambiguity and argument structure. Journal o/ Memory and Language, 33:251-283. E. Charniak, S. Goldwater, and M. Johnson. 1998. Edge-based best-first chart parsing. In Proceedings...

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

... Lamdas and Dynamic Lo- gic. Studies in Logic and the Foundations of Mathematics, vol 130, North-Holland, Ams- terdam. Hepple, M. 1992. ' Chart Parsing Lambek Grammars: Modal Extensions and ... of Mor- rill (1995), and with the first-order compilation method for categorial parsing of Hepple (1996). The resulting 'grammar' is then parsed using an Earley- style predictive ... BIll, and so the indexing system allows the encoding of dominance relations. 4 A New Chart Parsing Method for Lambek Grammars 4.1 Lambek to SLMG Conversion The first task of the parsing...

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

... of the Labelled Tree Algorithm and stochastic versions of Earley& apos;s Algorithm (Stolcke, 1993), and variations such as those used in Picky parsing (Magerman and Weir, 1992). Even in prob- ... between 1 and n the triple (s,s, ws) E T. • The tree is binary branching and consistent. Formally, for every (s,t, X) in T, s ¢ t, there is exactly one r, Y, and Z such that s < r < t and ... 01024, and a National Science Foundation Gradu- ate Student Fellowship. I would also like to thank Stanley Chen, Andrew Kehler, Lillian Lee, and Stu- art Shieber for helpful discussions, and...

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

... functions and design of the executive routine and sub- routines. In this type of parsing program, the function of the executive routine will be to determine what units to look for and where ... contains the grammar as the actual parsing algorithm and to view the remaining portions as forms of input data. 5. Leaving aside the matters of rule format and input data, two further questions ... separation of grammar and algorithm is considered far from convincing. It does raise a related question, how- ever: If the major separation is not to be that between grammar and algorithm, what...

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

... stared and in an- other that it was all the old men who stared; and the writer can resort to italics. But it seems reasonable to COCKE PARSING LOGIC 7 [Mechanical Translation and Computational ... 1966] Endocentric Constructions and the Cocke Parsing Logic* by Jane Robinson,† RAND Corporation, Santa Monica, California Methods are presented within the parsing logic formulated by Cocke ... interaction between a parsing logic and a routine for testing the connectability of two items is described in somewhat greater detail in Hays. 2 In the RAND program for parsing English, the...

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

... Semantic Representations and Lexical Semantic Resources: Towards Accurate Deep Semantic Parsing Sergio Roa†‡, Valia Kordoni† and Yi Zhang† Dept. of Computational Linguistics, Saarland University, Germany† German ... semantic parsers (e.g., modality and negation, quantifiers and scopes, etc.). To this effect, var- ious semantic representations have been proposed and used in different parsing systems. Generally speaking, ... (Model) 1: for all Verbs do 2: for all Sentences and Parsings which include the current verb do 3: Initialize vertices of the network with SEM-I labels and fea- tures. 4: Initialize optionally vertices...

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

... Springer. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1& 2):3–36. Anders Søgaard. 2008. Range ... V r (ρ) and k ∈ N. We say that a range vector φ satisfies a range constraint vector ρ, C iff φ and ρ are of the same dimension k and there is a function f : V r → N that maps ρ(i).l to φ(i).l and ... A is a pred- icate and φ a range vector of dimension dim (A) and active items. In the latter, while traversing the righthand side of the clause, we keep a record of the left and right boundaries...

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

... process we used for developing and testing the accuracy of this algorithm, and Section 5 discusses our results and a variety of features, as well as limitations and weaknesses, that we have found ... commas, and brackets repre- sent optional parameters. Orientations include HORIZONTAL, DIAGONAL, VERTICAL, GERUND, BENT, DASHED, and CLAUSE as defined in (Kolln and Funk, 2002) . Table 1: Terms and ... dependency graph, as well as exposing potential weak- nesses and limitations in parsing models. Our system performs automated analysis of dependency relations and uses them to populate a data structure we designed...

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