Sciweavers

1445 search results - page 189 / 289
» Uniformly Hard Languages
Sort
View
INLG
2004
Springer
15 years 9 months ago
Resolving Structural Ambiguity in Generated Speech
Ambiguity in the output is a concern for NLG in general. This paper considers the case of structural ambiguity in spoken language generation. We present an algorithm which inserts ...
Chris Mellish
PLDI
2003
ACM
15 years 9 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 9 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
AOSD
2008
ACM
15 years 6 months ago
Modularity first: a case for mixing AOP and attribute grammars
We have reimplemented the frontend of the extensible AspectBench Compiler for AspectJ, using the aspect-oriented meta-compiler JastAdd. The original frontend was purely object-ori...
Pavel Avgustinov, Torbjörn Ekman, Julian Tibb...
CIKM
2008
Springer
15 years 6 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...