left-corner parsing
An Improved Left Corner Parsing Algorithm
... AN IMPROVED LEFT CORNER PARSING ALGORITHM COL1NG 82, J Horecky, {e,L ) North Holland Publishing Company (~ Academia, 1982 AN IMPROVED LEFT CORNER PARSING ALGORITHM Kenneth M Ross Computer Science L a[.] ...
6
Lookahead in Deterministic Left Corner Parsing
... terministic parsing takes the extreme position that there can only be one analysis for any sen- tence ...deterministic parsing is lookahead, where information about a bounded number of subsequent words is ...
8
Using Left corner Parsing to Encode Universal Structural Constraints in Grammar Induction
... Abstract Center-embedding is difficult to process and is known as a rare syntactic construction across languages. In this paper we describe a method to incorporate this assumption into the gram- mar induction tasks by ...
11
Generalized Left Corner Parsing
... The ~esulting parsing algo- rithm for context-free grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, t[r] ...
10
Left Corner Parsing and Psychological Plausibility
... On this basis, it has been ~rgued [A J91, JL83] that by identifying processing load with space utilization, we can rule out both top-down and bottom-up parsing as viable can[r] ...
7
A Sound and Complete Left Corner Parsing for Minimalist Grammars
... As noted earlier, Hunter (2017) aims to define a parser that appropriately models certain aspects of human sentence parsing. In particular, there is some evidence that, in hearing or reading a sen- tence from ...
10
Efficient probabilistic top down and left corner parsing
... This bodes well for fu- ture research into the use of other non-local (e.g. lexical and semantic) information to guide the parser. In addition, we show that the improve[r] ...
8
Transition Based Left Corner Parsing for Identifying PTB Style Nonlocal Dependencies
... its parsing model. We adopt a left-corner strategy in order to use the syntac- tic relation c-command, which plays an important role on nonlocal dependency ...
11
A Structured Language Model Based on Context Sensitive Probabilistic Left Corner Parsing
... abilistically parsing a partial word sequence aids the prediction of the next word, leading to “struc- tured” language models that have the potential to outperform ...probabilistic left-corner ...
8
Left corner Transitions on Dependency Parsing
... argues that grammar should favor the dependency structures that reduce the sum of dependency arc lengths. They reordered English and German treebank sentences with various criteria: original, random with projectivity, ...
11
Positive Results for Parsing with a Bounded Stack using a Model Based Right Corner Transform
... Several existing incremental systems are orga- nized around a left-corner parsing strategy (Roark, 2001; Henderson, 2004). But these systems gen- erally keep large numbers of constituents open for ...
9
Finite state Approximation of Constraint based Grammars using Left corner Grammar Transforms
... In its standard form the approximation based on the left-corner parsing algorithm suffers from the com- plementary problem to the top-down approximation: it is not exact for [r] ...
5
Head Corner Parsing for Discontinuous Constituency
... If on the other hand the notion 'head' does not imply such feature per- colations, then the parser must predict the head randomly from the input string as no top-d[r] ...
8
A Left Corner Parser for Tree Adjoining Grammars
... the Left Corner parser for Context Free Gram- ...generalized left corner relation that we have established on the nodes of elementary ...TAG parsing, but preliminary ex- periments have ...
6
Left to Right Dependency Parsing with Pointer Networks
... The parsing process starts with a dummy root $ on the stack and, by applying 2n-1 transitions, a de- pendency tree is built for the input in a top-down depth-first fashion, where multiple children of a same word ...
7
Compact non left recursive grammars using the selective left corner transform and factoring
... generalized left-corner parsers, since a top-down parser using these grammars simulates a general- ized left-corner ...stochastic left-corner parser are not observed in the ...
7
A Common Parsing Scheme for Left and Right Branching Languages
... In order to process sentences listed in (4), the NP network of an ATN-based parser must be expanded by prefixing to it another state with two arcs leaving from it: [r] ...
11
Deterministic Left to Right Parsing of Tree Adjoining Languages
... We investigate the design of deterministic left to right bottom up parsers for TAGs in which a finite state control drives the moves of a Bottom-up Embedded Push Down Stack.[r] ...
8
Left To Right Parsing and Bilexical Context Free Grammars
... To com- plete the presentation, Appendix A shows that left- to-right parsing in time independent of the size of the lexicon is indeed possible when an off-line [r] ...
8
Constraint Grammar Parsing with Left and Right Sequential Finite Transducers
... equivalent left and right se- quential ones removes a large time constant from the cost of applying a ...resulting left and right sequential rule FSTs are ac- tually smaller than the original rule ...
9