A strong baseline for question relevancy ranking (D18-1)

Copied to clipboard

Challenge: SemEval-16 and Semeval-17 community question answering shared tasks require complex pipelines and manual feature engineering to beat the IR baseline.
Approach: They train a multi-task feed forward network on a bag of 14 distance measures for the input question pair and train it using language-independent features.
Outcome: The proposed model outperforms the best shared task systems on the task of retrieving relevant previously asked questions.

Similar Papers

Pre-Training Methods for Question Reranking (2024.eacl-short)

Copied to clipboard

Challenge: Existing methods for Question Answering to search for semantically similar questions are not suitable for new questions.
Approach: They propose an unsupervised method for retrieving and ranking questions . they use a question retrieval model and a selection model to rerank questions based on their relevance .
Outcome: The proposed method achieves state-of-the-art performance on QRC and Quora-match datasets . it provides better and cheaper access to answers than the system generated them .
Neural Ranking with Weak Supervision for Open-Domain Question Answering : A Survey (2023.findings-eacl)

Copied to clipboard

Challenge: Neural ranking models require substantial amounts of relevance annotations, which is costly to scale.
Approach: They propose to train a NR model with weak supervision instead of annotations . they use a structured overview of standard WS signals used for training a model .
Outcome: The proposed approach reduces the cost of annotations by using weak supervision instead of a parametric model.
Strong Baselines for Simple Question Answering over Knowledge Graphs with and without Neural Networks (N18-2)

Copied to clipboard

Challenge: Existing work on simple question answering over knowledge graphs involves increasingly complex NN architectures.
Approach: They propose to decompose the problem into entity detection, entity linking, relation prediction, evidence combination and heuristics.
Outcome: The proposed approach outperforms existing models and benchmarks on a simple QA task.
Strong and Efficient Baselines for Open Domain Conversational Question Answering (2023.findings-emnlp)

Copied to clipboard

Challenge: Current Open Domain Question Answering (ODQA) approaches to reevaluating baselines for efficiency and effectiveness have been limited due to various limitations.
Approach: They propose and evaluate strong yet simple and efficient baselines by introducing a fast reranking component between the retriever and the reader and performing targeted finetuning steps.
Outcome: The proposed method improves the SotA results while reducing the reader’s latency by 60%.
How to Find Strong Summary Coherence Measures? A Toolbox and a Comparative Study for Summary Coherence Measure Evaluation (2022.coling-1)

Copied to clipboard

Challenge: Existing methods to evaluate summary coherence are often evaluated using disparate datasets and metrics.
Approach: They propose to use automatic evaluation to evaluate coherence of summaries by selecting high-scoring candidates.
Outcome: The proposed methods show that they can perform better on an even playing field.
Retrieving Support to Rank Answers in Open-Domain Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: a novel question answering architecture retrieves content relevant to the combined pair . previous work on automatic claim verification has shown hallucinations .
Approach: They propose a question-answer architecture that prioritizes supporting evidence . it retrieves paragraphs that directly substantiate the correctness of a with respect to q .
Outcome: The proposed approach can be used by large language models to retrieve explanatory paragraphs that ground their reasoning.
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.
Deep Relevance Ranking Using Enhanced Document-Query Interactions (D18-1)

Copied to clipboard

Challenge: Document relevance ranking is the task of ranking documents from a large collection using the query and the text of each document only.
Approach: They propose to use convolutional n-gram matching to inject rich context-sensitive encodings into their models, inspired by PACRR's convolution-based ngram matching features.
Outcome: The proposed models outperform baselines, DRMM, and PACRR on the BIOASQ and TREC ROBUST questions and document inputs.
Towards a Better Metric for Evaluating Question Generation Systems (D18-1)

Copied to clipboard

Challenge: Existing evaluation metrics based on n-gram similarity do not correlate well with human judgments . large datasets for document Question Answering (QA) have enabled the development of end-to-end supervised models .
Approach: They propose a scoring function to capture answerability of questions . they also integrate existing similarity metrics into the scoring function .
Outcome: The proposed scoring function improves human judgments on question answerability . the proposed scoring functions are made publicly available .
A Simple Baseline for Knowledge-Based Visual Question Answering (2023.emnlp-main)

Copied to clipboard

Challenge: Recent studies emphasize the importance of incorporating both explicit and implicit knowledge to answer questions requiring external knowledge.
Approach: They propose a pipeline that incorporates both explicit and implicit knowledge . their method is training-free and does not require access to external databases or APIs .
Outcome: The proposed method achieves state-of-the-art accuracy on OK-VQA and A-OK-VQ datasets.

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