LR талдаушы

MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing …...

A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the time-complexity …...

We describe and experimentally evalu- ate a system, FeasPar, that learns pars- ing spontaneous speech. To train and run FeasPar (Feature Structure Parser), only limited handmodeled knowledge is required. The …...

We describe an LR parser of parts-of- speech (and punctuation labels) for Tree Adjoining Grammars (TAGs), that solves table conflicts in a greedy way, with lim- ited amount of backtracking. …...

We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are non- optimal, in the sense that a collection of …...

Target meaning representations for semantic parsing tasks are often based on programming or query languages, such as SQL, and can be formalized by a context-free grammar. As- suming a priori …...