732 search results - page 50 / 147 » Using Types to Parse Natural Language |
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
AAAI
1992
13 years 9 months ago
1992
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
We show how contracts with blame fit naturally with recent work on hybrid types and gradual types. Unlike hybrid types or gradual types, we require casts in the source code, in o...
MPC
2010
Springer
14 years 1 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...