Sciweavers

681 search results - page 37 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
ICFP
2010
ACM
14 years 10 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
EMNLP
2009
14 years 7 months ago
Language Models Based on Semantic Composition
In this paper we propose a novel statistical language model to capture long-range semantic dependencies. Specifically, we apply the concept of semantic composition to the problem ...
Jeff Mitchell, Mirella Lapata
UML
2005
Springer
15 years 3 months ago
Composing Domain-Specific Languages for Wide-Scope Software Engineering Applications
Abstract. Domain-Specific Languages (DSL) offer many advantages over general languages, but their narrow scope makes them really effective only in very focused domains, for example...
Jacky Estublier, Germán Vega, Anca Daniela ...
EMNLP
2009
14 years 7 months ago
Less is More: Significance-Based N-gram Selection for Smaller, Better Language Models
The recent availability of large corpora for training N-gram language models has shown the utility of models of higher order than just trigrams. In this paper, we investigate meth...
Robert C. Moore, Chris Quirk
ICGI
2010
Springer
14 years 10 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik