Results 101 to 110 of about 163,637 (234)

Optimizing directly executable LR parsers [PDF]

open access: yes, 1991
Traditionally, LR parsers are implemented as table interpreters. A parser generator creates tables whose entries are interpreted by the parser driver. Recent research shows that much faster LR parsers can be obtained by converting the table entries into directly executed code.
openaire   +2 more sources

LR-algebras [PDF]

open access: yesarXiv, 2008
In the study of NIL-affine actions on nilpotent Lie groups we introduced so called LR-structures on Lie algebras. The aim of this paper is to consider the existence question of LR-structures, and to start a structure theory of LR-algebras. We show that any Lie algebra admitting an LR-structure is 2-step solvable. Conversely we find several classes of 2-
arxiv  

Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers [PDF]

open access: yesProceedings of the 3rd Language & Technology Conference: Human Language Technologies as a Challenge for Computer Science and Linguistics. Poznan, Poland, 2007, 2008
Robustness in a parser refers to an ability to deal with exceptional phenomena. A parser is robust if it deals with phenomena outside its normal range of inputs. This paper reports on a series of robustness evaluations of state-of-the-art parsers in which we concentrated on one aspect of robustness: its ability to parse sentences containing misspelled ...
arxiv  

An Efficient Distribution of Labor in a Two Stage Robust Interpretation Process

open access: yes, 1997
Although Minimum Distance Parsing (MDP) offers a theoretically attractive solution to the problem of extragrammaticality, it is often computationally infeasible in large scale practical applications. In this paper we present an alternative approach where
Lavie, Alon, Rose', Carolyn Penstien
core   +1 more source

Home - About - Disclaimer - Privacy