Sentences with Gapping: Parsing and Reconstructing Elided Predicates (N18-1)

Copied to clipboard

Challenge: Sentences with gapping lack an overt predicate to indicate the relation between two or more arguments.
Approach: They propose two methods for parsing to a Universal Dependencies graph representation that explicitly encodes the elided material with additional nodes and edges.
Outcome: The proposed methods reconstruct elided material from dependency trees with high accuracy when the parser correctly predicts the existence of a gap.

Similar Papers

Parsing Gapping Constructions Based on Grammatical and Semantic Roles (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for parsing sentences with gapping recover elided elements from redundant elements . grammatical and semantic tags are used to identify gaps in a coordinated structure .
Approach: They propose a method of parsing sentences with gapping to recover elided elements . they use constituent trees annotated with grammatical and semantic roles .
Outcome: The proposed method outperforms the previous method in terms of F-measure and recall.
Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs-13) (D19-53)

Copied to clipboard

Challenge: TextGraphs is a workshop on graph-based methods for natural language processing . the workshop is being organized in conjunction with the 9th International Joint Conference on Natural Language Processing .
Approach: TextGraphs is the 13th edition of the Workshop on Graph-Based Methods for Natural Language Processing . the workshop promotes synergy between GT and natural language processing .
Outcome: the 2013 edition of TextGraphs is being held in conjunction with the 9th International Joint Conference on Natural Language Processing in Hong Kong.
Some Languages Seem Easier to Parse Because Their Treebanks Leak (2020.emnlp-main)

Copied to clipboard

Challenge: Cross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences.
Approach: They compute graph isomorphisms and find that treebank size is a factor that influences parsing performance.
Outcome: The results show that the overlap between training and test graphs explain more of the observed variation than standard explanations such as the above.
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP): System Demonstrations (D19-3)

Copied to clipboard

Challenge: Proceedings of the system demonstrations session were presented at the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) EMNMP-IjCNLP 2019 has a Best Demo Award for the first time .
Approach: Proceedings of the system demonstrations session are available online . they were presented at the conference on empirical methods in natural language processing .
Outcome: The system demonstrations session received 110 submissions, 22 of which were either invalid or withdrawn by the authors.
Paraphrase to Explicate: Revealing Implicit Noun-Compound Relations (P18-1)

Copied to clipboard

Challenge: Existing methods for paraphrasing nouncompounds lack the ability to generalize and have a hard time interpreting infrequent or new noun-compound.
Approach: They propose a neural model that generalizes better by representing paraphrases in a continuous space, generalizing for both unseen noun-compounds and rare paraphrase.
Outcome: The proposed model generalizes better by representing paraphrases in a continuous space, generalizing for unseen noun-compounds and rare paraphrase.
On Parsing as Tagging (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to reduce constituency parsing to tagging are based on linearization, learning, and decoding . linearization of the derivation tree is the most critical factor in achieving accurate parsers as taggers .
Approach: They propose a pipeline with three steps for reducing constituency parsing to tagging . they find that linearization and learning are critical factors for accurate parsers .
Outcome: The proposed pipelines are linearized, learning, and decoded, and have three steps to achieve accurate parsing as taggers.
An Empirical Study of Building a Strong Baseline for Constituency Parsing (P18-2)

Copied to clipboard

Challenge: Sequence-to-sequence models have been used for natural language generation tasks such as machine translation and summarization.
Approach: They propose to build a strong baseline based on general purpose sequence-to-sequence models for constituency parsing.
Outcome: The proposed model outperforms existing models in natural language generation tasks without any explicit task-specific knowledge or architecture of constituent parsing.
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 .
Improving Unsupervised Relation Extraction by Augmenting Diverse Sentence Pairs (2023.emnlp-main)

Copied to clipboard

Challenge: Recent studies on relation representation learning focus on contrastive learning strategies, but these studies overlook important aspects.
Approach: They propose to use within-sentence pairs augmentation and cross-sentent pairs extraction to increase diversity of positive pairs and strengthen the discriminative power of contrastive learning.
Outcome: The proposed task increases diversity of positive pairs and strengthens discriminative power . it overcomes limitations of traditional Relation Extraction tasks, which require manual annotations .

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