Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx

... present a CYK and an Earley- style algorithm for parsing Range Concatena- tion Grammar (RCG), using the deduc- tive parsing framework. The characteris- tic property of the Earley parser is that ... Papers, pages 9–12, Suntec, Singapore, 4 August 2009. c 2009 ACL and AFNLP An Earley Parsing Algorithm for Range Concatenation Grammars Laura Kallmeyer SFB 441 Universit ¨...

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

... normal-form is defined as a precondition for a new and more efficient parsing algorithm. This form is more restricted than the two form, and is closely related to the Chomsky normal form for ... TRANSFOR- MATION The parsing algorithm of Vijay.Shanker and Joshi uses a special CKY algorithm for CFGs which requires fewer restrictive constraints than the Chomsky normal f...

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

... 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 to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much sim- pler, being very close to traditional LR parsing for context-free g...

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

... 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 Kingdom ... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information...

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

... 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 ... Scoping Algorithm The algorithm does not produce totally optimal scope specifications in all circumstances: that is, actions may sometimes be scoped so they are saved for...

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

... included. The algorithm then loops over each context (CONTEXTS is the set of all contexts): for r, w ′  in CONTEXTS: WLIST = set of all w where w, r, w ′  exists for w 1 in WLIST: for w 2 in ... from 1B corpora in under 2 hours. 1.1 Algorithm We prepare the corpus by lemmatizing and then shallow parsing to identify grammatical relation in- stances with the form w 1 , r, w ′ ...

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

... parse forest are nodes labeled by couples (A, p) where A is a nonterminal symbol and p is a range, while for an RCG, the labels have the form (A, p-') where # is a vector (list) of ranges. ... phenomena. 2 Range Concatenation Grammars This section introduces the notion of RCG and presents some of its properties, more details ap- pear in [Boullier 98a]. Definition 1 A posi...

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

... chart parsing method for Lambek grammars, inspired by a method for D- Tree grammar parsing. The formulae of a Lam- bek sequent are firstly converted into rules of an indexed grammar formalism, ... which are used in an Earley- style predictive chart algorithm. The method is non-polynomial, but performs well for practical purposes much better than previous chart methods for...

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

... 37.41 35.35 parsing 36.48 34.71 tree -parsing 35.54 33.99 t2s forest-based 36.14 34.25 parsing 35.99 34.01 tree -parsing 35.04 33.21 t2t forest-based 35.56 33.45 NiuTrans s2t parsing 37.63 ... CKY parsing. This algorithm is actually the same as that used in parsing with bracketing transduction grammars. z Decoding as parsing (or string-based decoding). This mo...

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

... discriminative learning algorithm. During resolution, an input document is processed from the first 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