We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
Benjamin Van Durme, Phillip Michalak, Lenhart Schu...
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-bas...