Sciweavers

113 search results - page 2 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
AIR
2004
97views more  AIR 2004»
13 years 4 months ago
Parsing Ill-Formed Text Using an Error Grammar
This paper presents a robust parsing approach which is designed to address the issue of syntactic errors in text. The approach is based on the concept of an error grammar which is ...
Jennifer Foster, Carl Vogel
ENTCS
2006
145views more  ENTCS 2006»
13 years 4 months ago
Automated Derivation of Translators From Annotated Grammars
In this paper we propose a technique to automate the process of building translators between operations languages, a family of DSLs used to program satellite operations procedures...
Diego Ordóñez Camacho, Kim Mens, Mar...
SPAA
1993
ACM
13 years 8 months ago
Scan Grammars: Parallel Attribute Evaluation via Data-Parallelism
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the pro...
Thomas W. Reps
ISIM
2007
13 years 6 months ago
k-Limited Erasing Performed by Scattered Context Grammars
A scattered context grammar, G, erases nonterminals in a k-limited way, where k ≥ 1, if in every sentential form of any derivation, between every two symbols from which G derive...
Jirí Techet
ACL
2010
13 years 2 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom