TCS
1998
13 years 4 months ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
COLING
1999
13 years 4 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
ENTCS
2000
13 years 4 months ago
2000
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
COLING
2002
13 years 4 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
ENTCS
2007
13 years 4 months ago
2007
We describe the design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family. Parsers written using our library are remarkably simi...
ECEASST
2008
13 years 4 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
BMCBI
2007
13 years 4 months ago
2007
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
AAAI
1996
13 years 5 months ago
1996
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
NAACL
2003
13 years 5 months ago
2003
This paper investigates bootstrapping for statistical parsers to reduce their reliance on manually annotated training data. We consider both a mostly-unsupervised approach, co-tra...
DLT
2006
13 years 5 months ago
2006
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...