Nucleus Composition in Transition-based Dependency Parsing
نویسندگان
چکیده
Abstract Dependency-based approaches to syntactic analysis assume that structure can be analyzed in terms of binary asymmetric dependency relations holding between elementary units. Computational models for parsing almost universally an unit is a word, while the influential theory Lucien Tesnière instead posits more abstract notion nucleus, which may realized as one or words. In this article, we investigate effect enriching computational with concept nucleus inspired by Tesnière. We begin reviewing how defined framework Universal Dependencies, has become de facto standard training and evaluating supervised parsers, explaining composition functions used make neural transition-based parsers aware nuclei thus defined. then perform extensive experimental study, using data from 20 languages assess impact across different typological characteristics, utilizing variety analytical tools including ablation, linear mixed-effects models, diagnostic classifiers, dimensionality reduction. The reveals gives small but consistent improvements accuracy most languages, improvement mainly concerns main predicates, nominal dependents, clausal coordination structures. Significant factors rate include entropy structures frequency certain function words, particular determiners. Analysis reduction classifiers suggests increases similarity vectors representing same type.
منابع مشابه
Transition-Based Parsing for Deep Dependency Structures
Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived from linguistic analysis grounded by CCG, LFG, and HPSG. Traditionally, these dependency structures are obtained as a by-product of grammar-guided parsers. In this article, we study the alternative ...
متن کاملTransition-Based Chinese Semantic Dependency Graph Parsing
Chinese semantic dependency graph is extended from semantic dependency tree, which uses directed acyclic graphs to capture richer latent semantics of sentences. In this paper, we propose two approaches for Chinese semantic dependency graph parsing. In the first approach, we build a non-projective transition-based dependency parser with the Swap-based algorithm. Then we use a classifier to add a...
متن کاملTransition-Based Dependency Parsing with Heuristic Backtracking
We introduce a novel approach to the decoding problem in transition-based parsing: heuristic backtracking. This algorithm uses a series of partial parses on the sentence to locate the best candidate parse, using confidence estimates of transition decisions as a heuristic to guide the starting points of the search. This allows us to achieve a parse accuracy comparable to beam search, despite usi...
متن کاملTransition-based Dependency Parsing with Selectional Branching
We present a novel approach, called selectional branching, which uses confidence estimates to decide when to employ a beam, providing the accuracy of beam search at speeds close to a greedy transition-based dependency parsing approach. Selectional branching is guaranteed to perform a fewer number of transitions than beam search yet performs as accurately. We also present a new transition-based ...
متن کاملTransition-Based Dependency Parsing With Pluggable Classifiers
In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose classifier without other changes to the parsing algorithm. In practice, however, it often takes substantial software engineering to bridge between the different representations used by two software packages. Here we present extensions to MaltParser that allow the drop-in use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Linguistics
سال: 2022
ISSN: ['1530-9312', '0891-2017']
DOI: https://doi.org/10.1162/coli_a_00450