Sciweavers

73 search results - page 9 / 15
» Recursion and grammars for CS2
Sort
View
SAS
2001
Springer
14 years 2 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
ECEASST
2008
88views more  ECEASST 2008»
13 years 10 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: 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...
Steffen Mazanek, Mark Minas
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 9 months ago
DTD-Directed Publishing with Attribute Translation Grammars
We present a framework for publishing relational data in XML with respect to a fixed DTD. In data exchange on the Web, XML views of relational data are typically required to confo...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Raje...
CLIN
2004
13 years 11 months ago
Trailfinder - A Case Study in Extracting Spatial Information Using Deep Language Processing
The present paper reports on an end-to-end application using a deep processing grammar to extract spatial and temporal information of prepositional and adverbial expressions from ...
Lars Hellan, Dorothee Beermann, Jon Atle Gulla, At...
COLING
1990
13 years 11 months ago
Using Lexicalized Tags for Machine Translation
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out ...
Anne Abeillé, Yves Schabes, Aravind K. Josh...