A dependency parser analyzes syntactic structure by identifying dependency relations between words. In this lecture, I will introduce dependency-based syntactic representations (§1), arcfactored models for dependency parsing (§2), and online learning algorithms for such models (§3). I will then discuss two important parsing algorithms for these models: Eisner’s algorithm for projective dependen...

Many categories of Part-whole relationships have been analyzed earlier. Existing Part-Whole Taxonomies include some form of dependency classifier to account for dependency of whole on the parts. It is shown that the existing notions of dependency partially overlap and are also inadequate. The notion of logical dependency is introduced and it is unified with existing dependency classifier to obt...

Some dependency treebanks use special sequences of dependencies where main arguments are mixed with separators. Classical Categorial Dependency Grammars (CDG) do not allow this construction because iterative dependency types only introduce the iterations of the same dependency. An extension of CDG is defined here that introduces a new construction for repeatable sequences of one or several depe...

In this paper, we propose a new language model, namely, a dependency structure language model, for information retrieval to compensate for the weakness of bigram and trigram language models. The dependency structure language model is based on the Chow Expansion theory and the dependency parse tree generated by a dependency parser. So, long-distance dependencies can be handled by the dependency ...

We define a general form of termination, α-termination, for term rewrite systems with an annotation α. Standard termination and top-termination are particular instances. We present a variation on the dependency pair criterion of Arts and Giesl and prove that an α-annotated term rewrite system is α-terminating if and only there are no chains of α-dependency pairs. The α-dependency graphs can be ...

– In this paper, we propose a new language model, namely, a dependency structure language model, for information retrieval to compensate for the weakness of bigram and trigram language models. The dependency structure language model is based on the Chow Expansion theory and the dependency parse tree generated by a dependency parser. So, longdistance dependencies can be handled by the dependency...