300 search results - page 20 / 60 » Syntactic Monoids in a Category |
98
Voted
ACL
1994
15 years 2 months ago
1994
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
87
Voted
ICFP
2005
ACM
16 years 19 days ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
105
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
We present a weakly supervised approach to automatic Ontology Population from text and compare it with other two unsupervised approaches. In our experiments we populate a part of ...
102
click to vote
ACS
2004
15 years 17 days ago
2004
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...