Sciweavers

284 search results - page 24 / 57
» On Reversible Combinatory Logic
Sort
View
ACL
2008
13 years 11 months ago
A Logical Basis for the D Combinator and Normal Form in CCG
The standard set of rules defined in Combinatory Categorial Grammar (CCG) fails to provide satisfactory analyses for a number of syntactic structures found in natural languages. T...
Frederick Hoyt, Jason Baldridge
EMNLP
2007
13 years 11 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
IUI
2004
ACM
14 years 3 months ago
Flexible re-engineering of web sites
Re-engineering transforms a final user interface into a logical representation that is manipulable enough to allow forward engineering to port a UI from one computing platform to ...
Laurent Bouillon, Jean Vanderdonckt, Kwok Chieu Ch...
WCRE
1995
IEEE
14 years 1 months ago
Observed Idiosyncracies of Relational Database Designs
Several processes have been advanced in the literature for reverse engineering of relational databases. The inputs to these processes are relational tables and available contextua...
Michael R. Blaha, William J. Premerlani
MCU
1998
170views Hardware» more  MCU 1998»
13 years 11 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose