instruction:
In this task, you will be presented with a context from an academic paper and a question based on the context. You have to classify the questions into "Extractive", "Abstractive", or "Yes-no" questions. Extractive questions can be answered by concatenating extracts taken from a context into a summary while answering abstractive questions involves paraphrasing the context using novel sentences. Yes-no question is a question whose expected answer is one of two choices, one that affirms the question and one that denies the question. Typically, the choices are either yes or no.
question:
For example, the original sentence 'We went shop on Saturday' and the corrected version 'We went shopping on Saturday' would produce the following pattern:

(VVD shop_VV0 II, VVD shopping_VVG II)

After collecting statistics from the background corpus, errors can be inserted into error-free text. The learned patterns are now reversed, looking for the correct side of the tuple in the input sentence. We only use patterns with frequency INLINEFORM0 , which yields a total of 35,625 patterns from our training data.
Question: What textual patterns are extracted?
answer:
Extractive

question:
Our user study compares the correctness of three scenarios:

Parser correctness - our baseline is the percentage of examples where the top query returned by the semantic parser was correct.

User correctness - the percentage of examples where the user selected a correct query from the top-7 generated by the parser.

Hybrid correctness - correctness of queries returned by a combination of the previous two scenarios. The system returns the query marked by the user as correct; if the user marks all queries as incorrect it will return the parser's top candidate.
Question: Do they conduct a user study where they show an NL interface with and without their explanation?
answer:
Yes-no

question:
On the other hand, Go-Explore Seq2Seq shows promising results by solving almost half of the unseen games. Figure FIGREF62 (in Appendix SECREF60) shows that most of the lost games are in the hardest set, where a very long sequence of actions is required for winning the game. These results demonstrate both the relative effectiveness of training a Seq2Seq model on Go-Explore trajectories, but they also indicate that additional effort needed for designing reinforcement learning algorithms that effectively generalize to unseen games.
Question: How do the authors show that their learned policy generalize better than existing solutions to unseen games?
answer:
Extractive