287 search results - page 13 / 58 » Data-Driven Constructive Induction |
FLAIRS
2008
13 years 10 months ago
2008
This paper describes the implementation of a system that automatically learns selectional restrictions for individual senses of polysemous verbs from subject-object relationships....
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Many applications dealing with textual information require classification of words into semantic classes (or concepts). However, manually constructing semantic classes is a tediou...
ICFP
1996
ACM
13 years 11 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...