103 search results - page 14 / 21 » High-Probability Syntactic Links |
102
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
LREC
2010
14 years 11 months ago
2010
tions arise for standoff annotation when the annotation is not on the source text itself, but on a more abstract representation. This is particularly the case in a language such a...
BMCBI
2005
14 years 9 months ago
2005
Background: Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflo...
ACL
2011
14 years 1 months ago
2011
Standard algorithms for template-based information extraction (IE) require predefined template schemas, and often labeled data, to learn to extract their slot fillers (e.g., an ...
88
Voted
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
We study inference rules for multivalued dependencies in relational databases with null values (NMVDs). The definition of NMVDs is dependent on the underlying relation schema and ...