Sciweavers

57 search results - page 11 / 12
» Generalized Lr Parsing Algorithm for Boolean Grammars
Sort
View
EMNLP
2010
13 years 5 months ago
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
Tom Kwiatkowksi, Luke S. Zettlemoyer, Sharon Goldw...
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
13 years 11 months ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
POPL
2006
ACM
14 years 8 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
14 years 7 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
SIGSOFT
2008
ACM
14 years 8 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang