Hard Time Parsing Questions: Building a QuestionBank for French
We present the French Question Bank, a treebank of 2600 questions. We show that classical parsing model performance drop while the inclusion of this data set is highly beneficial without harming the parsing of non-question data. when facing out-of- domain data with strong structural diver- gences. Two thirds being aligned with the QB (Judge et al., 2006) and being freely available, this treebank will prove useful to build robust NLP systems.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Decoupling SQL Query Hardness Parsing for Text-to-SQL
The fundamental goal of the Text-to-SQL task is to translate natural language question into SQL query. Current research primarily emphasizes the information coupling between natural language questions and schemas, and si…
Language ModelingLanguage ModellingText to SQLText-To-SQLTowards Knowledge-Intensive Text-to-SQL Semantic Parsing with Formulaic Knowledge
In this paper, we study the problem of knowledge-intensive text-to-SQL, in which domain knowledge is necessary to parse expert questions into SQL queries over domain-specific tables. We formalize this scenario by buildin…
Semantic ParsingText to SQLText-To-SQLSPaR.txt, a cheap Shallow Parsing approach for Regulatory texts
Automated Compliance Checking (ACC) systems aim to semantically parse building regulations to a set of rules. However, semantic parsing is known to be hard and requires large amounts of training data. The complexity of c…
Semantic ParsingA Higher-Order Semantic Dependency Parser
Higher-order features bring significant accuracy gains in semantic dependency parsing. However, modeling higher-order features with exact inference is NP-hard. Graph neural networks (GNNs) have been demonstrated to be an…
Dependency ParsingGraph LearningSemantic Dependency ParsingComplex Question Decomposition for Semantic Parsing
In this work, we focus on complex question semantic parsing and propose a novel Hierarchical Semantic Parsing (HSP) method, which utilizes the decompositionality of complex questions for semantic parsing. Our model is de…
Semantic Parsing