Challenge: Existing models for syntactic dependency parsing assume words are elementary units that enter into dependency relations.
Approach: They propose to use composition functions to make a transition-based dependency parser aware of the notion of nucleus.
Outcome: The proposed concept of nucleus gives small but significant improvements in parsing accuracy on 12 languages.

Similar Papers

A Survey of Unsupervised Dependency Parsing (2020.coling-main)

Copied to clipboard

Challenge: Syntactic dependency parsing is an important task in natural language processing . unsupervised learning of dependency parses requires training sentences to be manually annotated with their correct parse trees.
Approach: They propose to survey existing approaches to unsupervised dependency parsing . they identify two major classes of approaches and discuss recent trends .
Outcome: The proposed methods can be used in semantic parsing, machine translation, relation extraction, and many other tasks.
Multilingual Dependency Parsing for Low-Resource Languages: Case Studies on North Saami and Komi-Zyrian (L18-1)

Copied to clipboard

Challenge: Developing systems for low-resource languages is a crucial issue for Natural Language Processing (NLP).
Approach: They propose a method for parsing low-resource languages with very small training corpora using multilingual word embeddings and annotated corporata of larger languages.
Outcome: The proposed method improves dependency parsing for low-resource languages with very small training corpora compared to previous work . it also explores whether contemporary contact languages or genetically related languages would be the most fruitful starting point for multilingual parsers.
Typological Features for Multilingual Delexicalised Dependency Parsing (N19-1)

Copied to clipboard

Challenge: Existing universal models to describe the syntax of languages are debated for decades . a new study examines the plausibility of universal grammars in dependency parsing .
Approach: They propose to use typological features to describe the syntax of languages to train a multilingual dependency parser.
Outcome: The proposed model can be trained on 40 languages with the help of typological features.
Viable Dependency Parsing as Sequence Labeling (N19-1)

Copied to clipboard

Challenge: Existing work on dependency parsing by sequence labeling suggested that it was impractical.
Approach: They propose to use dependency trees as sequence labels to obtain fast and accurate parsers using a conventional BILSTM-based model.
Outcome: The proposed models are conceptually simple, not needing traditional parsing algorithms or auxiliary structures, and provide a good speed-accuracy tradeoff, with results competitive with more complex approaches.
Parsing as Tagging (2020.lrec-1)

Copied to clipboard

Challenge: Existing methods for dependency parsing treat parse as tagging, but they are not perfect.
Approach: They propose a simple yet accurate method that treats parsing as tagging . they use a sequence model with a bidirectional LSTM over BERT embeddings .
Outcome: The proposed method outperforms the state-of-the-art method on universal dependency (UD) by 1.76% unlabeled attachment score (UAS) for English, 1.98% UAS for French, and 1.16% UAS in German.
Parsing All: Syntax and Semantics, Dependencies and Spans (2020.findings-emnlp)

Copied to clipboard

Challenge: Syntactic and semantic structures are key linguistic contextual clues, but few studies have explored how they can be used to improve syntactical parsing.
Approach: They propose a syntactic and semantic parsing model which integrates syntaktic information in the encoder of neural network and benefits from two representation formalisms in a uniform way.
Outcome: The proposed model achieves state-of-the-art or competitive results on both span and dependency representations and on Penn Treebank.
Quantifying training challenges of dependency parsers (C18-1)

Copied to clipboard

Challenge: a new metric is introduced to evaluate the difficulty to learn a given class of dependencies . a series of systematic computations using that metric have revealed interesting properties of the 3 considered parsing algorithms .
Approach: They introduce a new metric to evaluate the difficulty to learn a given class of dependencies . they use it to characterize the information conveyed by cross-lingual parsers .
Outcome: The proposed metric reveals the kind of dependencies that require high effort during training . it also shows that cross-lingual parsers can provide better quality information .
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)

Copied to clipboard

Challenge: Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems.
Approach: They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions.
Outcome: The proposed approach significantly reduces label space while preserving structural information.
A Framework for Understanding the Role of Morphology in Universal Dependency Parsing (D18-1)

Copied to clipboard

Challenge: a measure of morphological complexity is used to characterize syntactic information in word embeddings.
Approach: They propose a measure of morphological complexity in terms of governor-dependent preferential attachment that explains parsing performance.
Outcome: The proposed framework improves parsing performance on morphologically rich languages using morphology as a syntactic marker.
CoNLL-UL: Universal Morphological Lattices for Universal Dependency Parsing (L18-1)

Copied to clipboard

Challenge: Using the universal dependencies framework, we address the need for a universal representation of morphological analysis that can capture alternative morphology of surface tokens and is compatible with the segmentation and morphologic annotation guidelines prescribed for UD treebanks.
Approach: They propose a new annotation format for word lattices that represent morphological analyses and a resource that obeys this format for a range of typologically different languages.
Outcome: The proposed model can capture alternative morphological analyses of surface tokens and is compatible with the segmentation and morphology guidelines prescribed for UD treebanks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations