We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Understanding search queries is a hard problem as it involves dealing with "word salad" text ubiquitously issued by users. However, if a query resembles a well-formed question, a natural language processing pipeline is able to perform more accurate interpretation, thus reducing downstream compounding errors. Hence, identifying whether or not a query is well formed can enhance query understanding. Here, we introduce a new task of identifying a well-formed natural language question. We construct and release a dataset of 25,100 publicly available questions classified into well-formed and non-wellformed categories and report an accuracy of 70.7% on the test set. We also show that our classifier can be used to improve the performance of neural sequence-to-sequence models for generating questions for reading comprehension.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1808.09419")
get_code_for_paper("1808.09419")
have("1808.09419")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1808.09419.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1808.09419)
Connect an agent — have() is free.