1999 search results - page 59 / 400 » Dependently Typed Grammars |
144
click to vote
ACL
2003
15 years 7 months ago
2003
In this paper, we elucidate how Korean temporal markers, OE and DONGAN contribute to specifying the event time and formalize it in terms of typed lambda calculus. We also present ...
141
click to vote
JOLLI
2010
15 years 4 months ago
2010
One way of coping with agreement of features in French is to perform two parallel computations, one in the free pregroup of syntactic types, the other in that of feature types. Tec...
138
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
168
click to vote
JUCS
2007
15 years 6 months ago
2007
: Ontologies have been recognized as a fundamental infrastructure for advanced approaches to Knowledge Management (KM) automation in SOA. Building services communicate with each ot...
193
click to vote
JMLR
2010
15 years 28 days ago
2010
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...