Challenge: Existing approaches build universal paraphrasing or ranking models for whole questions . current approaches build a universal ranking model for the whole questions, which fails for complex, long-tail questions.
Approach: They propose a new query generation approach based on frequent query substructures which helps rank existing query structures or build new query structures.
Outcome: The proposed approach significantly outperforms existing models on two benchmark datasets.

Similar Papers

Meta-CQG: A Meta-Learning Framework for Complex Question Generation over Knowledge Bases (2022.coling-1)

Copied to clipboard

Challenge: Existing methods train one encoder-decoder-based model to fit all questions . however, such a one-size-fits-all strategy may not perform well for complex questions involving multiple KB relations or functional constraints.
Approach: They propose a meta-learning framework for complex question generation over knowledge bases . they propose he meta-trained generator can acquire universal meta-knowledge .
Outcome: The proposed framework can acquire universal and transferable meta-knowledge and quickly adapt to long-tailed samples under different dimensions.
ParaQG: A System for Generating Questions and Answers from Paragraphs (D19-3)

Copied to clipboard

Challenge: Automated question generation systems generate questions from sentences and paragraphs . manual generation of questions is labour-intensive as it requires reading, parsing and understanding of long passages of text.
Approach: They propose a web-based system for generating questions from sentences and paragraphs . paraQG provides an interactive interface for a user to select answers with visual insights .
Outcome: The proposed system generates questions from sentences and paragraphs on a web-based platform.
Generating Questions from Wikidata Triples (2022.lrec-1)

Copied to clipboard

Challenge: Existing methods for question generation from knowledge bases rely on extensive pre- and post-processing of the input triple.
Approach: They revisit KBQG using pre training, a new (triple, question) dataset and taking question type into account and provide a more extended KBqg dataset.
Outcome: The proposed approach outperforms existing methods in a standard and in 'zero-shot' setting.
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)

Copied to clipboard

Challenge: Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base .
Approach: They propose to encode query structure into a uniform vector representation of a question and its semantic components into .
Outcome: The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions.
Syn-QG: Syntactic and Shallow Semantic Rules for Question Generation (2020.acl-main)

Copied to clipboard

Challenge: Question Generation is a simple syntactic transformation but many aspects of semantics influence what questions are good to form.
Approach: They propose a set of syntactic rules which transform declarative sentences into question-answer pairs.
Outcome: The proposed system generates a larger number of highly grammatical and relevant questions than existing QG systems.
Consecutive Question Generation via Dynamic Multitask Learning (2022.findings-emnlp)

Copied to clipboard

Challenge: , . ; ) ()((); ()) .())((2): ""().
Approach: They propose a sequential sequential question-answer generation task with auxiliary tasks generating other elements to generate logically related question-anchor pairs to understand a passage.
Outcome: The proposed framework improves question generation significantly and benefit multiple related tasks.
Query Graph Generation for Answering Multi-hop Complex Questions from Knowledge Bases (2020.acl-main)

Copied to clipboard

Challenge: Existing work on complex knowledge base question answering addresses two types of complexity at the same time.
Approach: They propose a modified staged query graph generation method that handles both types of complexity at the same time.
Outcome: The proposed method achieves state-of-the-art on three benchmark KBQA datasets.
Automatic Question Generation using Relative Pronouns and Adverbs (P18-3)

Copied to clipboard

Challenge: Automatic Question Generation is a system that generates multiple, natural language questions using relative pronouns and relative adverbs from complex English sentences.
Approach: They propose a system that automatically generates multiple, natural language questions using relative pronouns and relative adverbs from complex English sentences.
Outcome: The proposed system generates multiple, natural language questions using relative pronouns and relative adverbs from complex English sentences.
Unseen Entity Handling in Complex Question Answering over Knowledge Base via Language Generation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for complex question answering are limited in the search space of all possible relation paths.
Approach: They propose a method that directly generates an executable SPARQL query without simplification.
Outcome: The proposed method significantly outperforms the previous methods and has higher interpretability and computational efficiency than the previous ones.
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 .

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