Challenge: Existing models for online decoding on active input are not trained to handle an online decode environment.
Approach: They propose a new direction of coreference resolution for online decoding on actively generated input such as dialogue . they propose to use models that accept utterances and their past context and find mentions upon each dialogue turn .
Outcome: The proposed model outperforms the baseline model by 10% on three datasets: Friends, OntoNotes, and BOLT.

Similar Papers

Realistic Evaluation Principles for Cross-document Coreference Resolution (2021.starsem-1)

Copied to clipboard

Challenge: Using permissive evaluation protocols, cross-document coreference resolution models produce inflated results.
Approach: They propose to decouple evaluation of mention detection from coreference linking . they argue that models should not exploit the synthetic topic structure of the standard ECB+ dataset .
Outcome: The proposed evaluation principles yield lower results than previous lenient evaluation methods.
A Simple Unsupervised Approach for Coreference Resolution using Rule-based Weak Supervision (2022.starsem-1)

Copied to clipboard

Challenge: state-of-the-art coreference models rely on labeled data, but an end-to-end model is needed to solve this problem.
Approach: They propose an approach that leverages an end-to-end neural model in settings where labeled data is unavailable.
Outcome: The proposed approach outperforms the previous best unsupervised model and outperformed the rule-based model on English OntoNotes corpus.
Pairwise Representation Learning for Event Coreference (2022.starsem-1)

Copied to clipboard

Challenge: Existing work induces mention representations independently by extracting features from the sentence that contains the mention, without using the context of the other mention.
Approach: They propose a Pairwise Representation Learning scheme for the event mention pairs that jointly encodes a pair of text snippets so that the representation of each mention in the pair is induced in the context of the other one.
Outcome: The proposed scheme outperforms state-of-the-art representations on cross-document and within-document benchmarks.
Disentangling Online Chats with DAG-structured LSTMs (2021.starsem-1)

Copied to clipboard

Challenge: a number of messaging systems allow fast and synchronous textual communication but they often have a more complicated structure in which independent sub-conversations are interwoven with one another.
Approach: They propose a model that can handle directed acyclic dependencies and integrates structured information into the conversation.
Outcome: The proposed model achieves state-of-the-art status on the task of recovering reply-to relations and is competitive on other disentanglement metrics.
Fine-tuning BERT with Focus Words for Explanation Regeneration (2020.starsem-1)

Copied to clipboard

Challenge: Existing approaches to explain the correct answer in multiple-choice QA are low in F-scores and lack of performance.
Approach: They introduce a lightweight focus feature in a transformer-based NLP model and examine performance improvements.
Outcome: The proposed model achieves the highest scores, second only to a computationally intensive system.
Find or Classify? Dual Strategy for Slot-Value Predictions on Multi-Domain Dialog State Tracking (2020.starsem-1)

Copied to clipboard

Challenge: Existing methods for dialog state tracking are ontology-based and ontologie-free . however, it is not clear enough which slots are better handled by either of the two methods .
Approach: They propose a dual-strategy model that integrates both ontology-based and ontological-free methods.
Outcome: The proposed model outperforms the existing model on noisy and cleaner datasets.
Comparison and Combination of Sentence Embeddings Derived from Different Supervision Signals (2022.starsem-1)

Copied to clipboard

Challenge: Existing methods to derive sentence embeddings have not been well understood what properties are captured in the resulting sentences depending on the supervision signals.
Approach: They propose to combine two types of sentence embedding methods with similar architectures and tasks to investigate their properties.
Outcome: The proposed methods perform better on unsupervised and downstream tasks than the proposed methods on untrained STS tasks and probing tasks.
Script Parsing with Hierarchical Sequence Modelling (2021.starsem-1)

Copied to clipboard

Challenge: Script knowledge is a category of commonsense knowledge that describes how people conduct everyday activities sequentially.
Approach: They propose a hierarchical sequence model and transfer learning to do script parsing with a sequence model that accurately tags script participants.
Outcome: The proposed model improves state of the art of event parsing by over 16 points F-score and, for the first time, accurately tags script participants.
Paraphrase Identification via Textual Inference (2024.starsem-1)

Copied to clipboard

Challenge: Paraphrase identification (PI) and natural language inference (NLI) are important tasks in natural language processing.
Approach: They propose a method for paraphrase identification and natural language inference using an NLI system to solve these tasks.
Outcome: The proposed method outperforms dedicated PI models on PI datasets and provides insights into limitations of current benchmarks.
MASSIVE Multilingual Abstract Meaning Representation: A Dataset and Baselines for Hallucination Detection (2024.starsem-1)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) is a semantic formalism that captures the core meaning of an utterance.
Approach: They propose to use AMR to map meanings of 1,685 utterances to 50+ languages to build a dataset 20 times larger than existing resources.
Outcome: The proposed dataset covers more languages, has more utterances, and has localized or translated entities for each language.

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