107 search results - page 11 / 22 » Generation of Paraphrases from Ambiguous Logical Forms |
116
click to vote
FPGA
2003
ACM
15 years 4 months ago
2003
ACM
One of the most difficult and time-consuming steps in the creation of an FPGA is its transistor-level design and physical layout. Modern commercial FPGAs typically consume anywher...
AIS
2010
Springer
14 years 11 months ago
2010
Springer
If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipa...
191
click to vote
POPL
2007
ACM
15 years 12 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
COLING
1996
15 years 1 months ago
1996
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
179
Voted
ICFP
2009
ACM
16 years 9 days ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...