Extracting Headless MWEs from Dependency Parse Trees: Parsing, Tagging, and Joint Modeling Approaches (2020.acl-main)
Copied to clipboard
| Challenge: | Headless multi-word expressions are frequent in natural language but lack internal syntactic dominance relations. |
| Approach: | They propose an efficient joint decoding algorithm that combines scores from both strategies. |
| Outcome: | The proposed algorithm combines scores from parsing and tagging for predicting flat MWEs . the proposed algorithm is more accurate than parse and more efficient for non-BERT features . |
Similar Papers
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. |
Head-Driven Phrase Structure Grammar Parsing on Penn Treebank (P19-1)
Copied to clipboard
| Challenge: | Head-driven phrase structure grammars have a uniform formalism representing rich contextual syntactic and even semantic meanings. |
| Approach: | They propose to integrate constituent and dependency formal representations into head-driven phrase structure. |
| Outcome: | The proposed parser achieves state-of-the-art performance on Penn Treebank and Chinese Penn TreeBank. |
Valency-Augmented Dependency Parsing (D18-1)
Copied to clipboard
| Challenge: | valency analysis is a complex task that requires a large number of subcategorizations, such as the number and types of syntactic dependents. |
| Approach: | They propose a parsing approach that explicitly models the number and types of syntactic dependents as valency patterns and a probabilistic model for tagging them. |
| Outcome: | The proposed approach outperforms the state-of-the-art labeled attachment score on 53 treebanks representing 41 languages and outperformed the previous state- of-the art labeles by 0.7. |
Dependency Parsing-Based Syntactic Enhancement of Relation Extraction in Scientific Texts (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a pipeline approach to extract entities and relations from scientific text is challenging due to long sentences with densely packed entities. |
| Approach: | They propose a syntactic filtering method that prunes unlikely entity pairs before relation prediction. |
| Outcome: | The proposed method improves Rel+ F1 scores on SciERC, SciER, and ACE05 datasets. |
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. |
TAGPRIME: A Unified Framework for Relational Structure Extraction (2023.acl-long)
Copied to clipboard
| Challenge: | Existing models for natural language processing (NLP) do not address common tasks. |
| Approach: | They propose to take a unified view of all the tasks and introduce a model that appends priming words about the condition to the input text. |
| Outcome: | The proposed model is based on ten datasets across five different languages and covers ten tasks that cover ten languages. |
Simpler but More Accurate Semantic Dependency Parsing (P18-2)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence. |
| Approach: | They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence. |
| Outcome: | The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher. |
High-order Joint Constituency and Dependency Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Syntactic parsing aims to reveal how sentences are syntactically structured. |
| Approach: | They propose to produce compatible constituency and dependency trees simultaneously for input sentences . they adopt a much more efficient decoding algorithm and explore joint modeling at training phase . |
| Outcome: | The proposed model significantly improves matching ratio of whole trees compared to separate models . the proposed model adopts a much more efficient decoding algorithm . |
Universal Dependencies According to BERT: Both More Specific and More General (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that individual BERT heads encode particular dependency relation types, but they do not match one-to-one. |
| Approach: | They propose a method for relation identification and syntactic tree construction that can be applied with minimal supervision and generalizes well across languages. |
| Outcome: | The proposed method produces significantly more consistent dependency trees than previous work and can be applied with only a minimal amount of supervision and generalizes well across languages. |
BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent results show that pretrained language models can be used for many tasks with high accuracy and high performance. |
| Approach: | They propose two methods for automatically analysing discontinuous parsers' errors. |
| Outcome: | The proposed methods characterize errors of a state-of-the-art transition-based discontinuous parser and provide an overview of the contribution of BERT to this task. |