Sciweavers

60 search results - page 9 / 12
» Incremental Parser Generation for Tree Adjoining Grammars
Sort
View
WCRE
2002
IEEE
14 years 8 days ago
Program Annotation in XML: A Parse-Tree Based Approach
In this paper we describe a technique that can be used to annotate source code with syntactic tags in XML format. This is achieved by modifying the parser generator bison to emit ...
James F. Power, Brian A. Malloy
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
WCRE
2003
IEEE
14 years 19 days ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
ACL
2011
12 years 11 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
ICDAR
2003
IEEE
14 years 20 days ago
Parsing N-Best Lists of Handwritten Sentences
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
Matthias Zimmermann, Jean-Cédric Chappelier...