5 search results - page 1 / 1 » Enforcing Transitivity in Coreference Resolution |
ACL
2008
13 years 6 months ago
2008
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
EACL
2009
ACL Anthology
13 years 2 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
VLDB
1991
ACM
13 years 8 months ago
1991
ACM
We propose a new method for integrity checking in deductive databases.The methodaugmentsadatabasewith asetof transition and internal eventsrules,which explicitly definetheinsertio...
VEE
2012
ACM
12 years 11 days ago
2012
ACM
Time Of Check To Time Of Use (TOCTTOU) race conditions for file accesses in user-space applications are a common problem in Unix-like systems. The mapping between filename and i...
JAIR
2007
13 years 4 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...