Sciweavers

116 search results - page 22 / 24
» An Efficient Parsing Algorithm for Tree Adjoining Grammars
Sort
View
ACL
1998
13 years 9 months ago
Integrated Control of Chart Items for Error Repair
This paper describes a system that performs hierarchical error repair for illformed sentences, with heterarchical control of chart items produced at the lexical, syntactic, and se...
Kyongho Min, William H. Wilson
ASE
2010
129views more  ASE 2010»
13 years 7 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
ICFP
2006
ACM
14 years 7 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
DLT
2008
13 years 9 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 1 months ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...