Báo cáo khoa học: "AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS" potx

... 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 ... following forms: • NA stands for null adjoining and means that at node X no adjoining can take place, • SA(B) stands for selective adjoining and means that at X the adjoinin...

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

... construction of Chinese number names. Parsing algorithms for RCG have been intro- duced by Boullier (2000), who presents a di- rectional top-down parsing algorithm using pseu- docode, and Barth ´ elemy ... France parmenti@loria.fr Abstract We present a CYK and an Earley-style algorithm for parsing Range Concatena- tion Grammar (RCG), using the deduc- tive parsing framework. Th...

Ngày tải lên: 08/03/2014, 01: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 ... 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 can be trans...

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

... defining children(Ft) = _L, for each t E A. For the algorithm, two kinds of tree need to be distinguished: elementary trees and subtrees of elementary trees. A subtree can be identified by ... alternative LR algorithm for TAGs Mark-Jan Nederhof DFKI Stuhlsatzenhausweg 3 D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for...

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

... sentence6• 4.2 Chart-based Parallel HPSG Parsing Algorithm for ALE Grammar Next, we developed a parallel chart-based HPSG parser for an ALE-style grammar. The algorithm is based on a chart schema ... 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));...

Ngày tải lên: 20/02/2014, 18: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 ... AN ISLAND PARSING INTERPRETER FOR THE FULL AUGMENTED TRANSITION NETWORK FORMALISM John & Carroll University of Cambridge Computer Laboratory Corn Exchange Street Camb...

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

... 2005) ↓ dep to-dep. DG forest-to -tree (Liu et al., 2009a) ↓ ↑↓ tree- to -tree PCFG tree- to-string (Liu et al., 2006) ↑ tree- to-string PCFG (Quirk et al., 2005) ↑ dep to-string DG forest-to-string (Mi ... time. As such, an HPSG parse tree/ forest can be considered as a tree/ forest of signs (c.f. the HPSG forest in Fig- ure 2 in (Wu et al., 2010)). An HPSG parse tree/ forest has two...

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

... a set of trees termed as elementary trees. We take V to be the set of all nodes in all the elementary trees. For each leaf A E V, label(A) is an ele- ment from E U {e}, and for each other ... probability measures to Tree Adjoining Languages To gain some intuition about probability assign- ments to languages, let us take for example, a language well known to be a tree a...

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

... amounts to find alternating spanning trees in graphs. A sketch of an algorithm for finding such a tree is provided. Interesting properties of time-complexity for this method are expected. It ... chart- parsing. 1 Introduction In this paper, we present a method for parsing Lambek grammars based on graph-theoretic properties. We expect that it may be done efficiently by an...

Ngày tải lên: 24/03/2014, 05:21