“Deep-syntactic” dependency structures bridge the gap between the surface-syntactic structures as produced by state-of-the-art dependency parsers and semantic logical forms in that they abstract away from surfacesyntactic idiosyncrasies, but still keep the linguistic structure of a sentence. They have thus a great potential for such downstream applications as machine translation and summarizati...

● We propose fully delexicalized contexts derived from syntactic trees to train word embeddings ● We demonstrate and evaluate our embeddings compared to vanilla word2vec ○ Nearest neighbours ○ Correlation to human judgement ○ Dependency parsing

We propose the Recursive Non-autoregressive Graph-to-Graph Transformer architecture (RNGTr) for iterative refinement of arbitrary graphs through recursive application a non-autoregressive and apply it to syntactic dependency parsing. demonstrate power effectiveness RNGTr on several corpora, using model pre-trained with BERT. also introduce Syntactic (SynTr), non-recursive parser similar our mod...

1 Introduction We are concerned with surface-syntactic parsing of running text. Our main goal is to describe a syntactic analysis of sentences using dependency links that show the head-dependent relations between words. The new dependency parser 1 (Tapanainen and J~ir-vinen, 1997; J~rvinen and Tapanainen, 1997) belongs to a continuous effort to apply rule-based methods to natural languages. It ...

This paper describes a system for unsupervised dependency parsing based on Gibbs sampling algorithm. The novel approach introduces a fertility model and reducibility model, which assumes that dependent words can be removed from a sentence without violating its syntactic correctness.

Multilingual dependency parsing is gaining popularity in recent years for several reasons. Dependency structures are more adequate for languages with freer word order than the traditional constituency notion. There is a growing availability of dependency treebanks for new languages. Broad coverage statistical dependency parsers are available and easily portable to new languages. Dependency pars...

A problem frequently encountered in the automatic parsing of Russian texts is the correct structuring of prepositional phrases in sentences. Studies of text samples indicate that, when other criteria are absent, the syntactic governors of prepositions can be determined with a high degree of accuracy by reference to the relative position and part-of-speech of elements in the clausal environment....

We describe the process of creating NUDAR, a Universal Dependency treebank for Arabic. We present the conversion from the Penn Arabic Treebank to the Universal Dependency syntactic representation through an intermediate dependency representation. We discuss the challenges faced in the conversion of the trees, the decisions we made to solve them, and the validation of our conversion. We also pre...