113 search results - page 9 / 23 » Deriving tolerant grammars from a base-line grammar |
63
Voted
WIA
1997
Springer
15 years 1 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
85
Voted
ESSLLI
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
78
Voted
ALT
1998
Springer
15 years 1 months ago
1998
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
75
Voted
NAACL
1994
14 years 11 months ago
1994
This paper presents a model for generating prosodically appropriate synthesized responses to database queries using Combinatory Categorial Grammar (CCG - cf. [22]), a formalism wh...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...