Sciweavers

21 search results - page 1 / 5
» Testing Grammars For Top-Down Parsers
Sort
View
CISSE
2008
Springer
13 years 6 months ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and ...
A. M. Paracha, F. Franek
AAAI
1992
13 years 5 months ago
A Probabilistic Parser Applied to Software Testing Documents
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English speci cations i...
Mark A. Jones, Jason Eisner
EACL
1993
ACL Anthology
13 years 5 months ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
Josée S. Heemskerk
ANLP
1992
117views more  ANLP 1992»
13 years 5 months ago
Detecting and Correcting Morpho-syntactic Errors in Real Texts
This paper presents a system which detects and corrects morpho-syntactic errors in Dutch texts. It includes a spelling corrector and a shift-reduce parser for Augmented Context-fr...
Theo Vosse
AAAI
2007
13 years 6 months ago
Learning and Inference for Hierarchically Split PCFGs
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
Slav Petrov, Dan Klein