CoChat

Identifying Well-formed Natural Language Questions

Open access
Faruqui, Manaal, Das, Dipanjan · 2018 · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Cited by 32

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/d18-1091

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • A large annotated corpus for learning natural language inference

    Bowman, S. R., Angeli, G., Potts, C., & Manning, C. D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1075 · Cited by 3,377

  • Microsoft COCO Captions: Data Collection and Evaluation Server

    Chen, X., Fang, H., Lin, T.-Y., Vedantam, R., Gupta, S., Dollar, P., & Zitnick, C. L. (2015) · arXiv · doi:10.48550/arxiv.1504.00325 · Cited by 1,614 · cited 1×

    “We use the evaluation package released by Chen et al. (2015) to compute BLEU-1 and BLEU-4 scores.”
    Method
  • Learning to Ask: Neural Question Generation for Reading Comprehension

    Du, X., Shao, J., & Cardie, C. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1123 · Cited by 696 · cited 4×

    “We also demonstrate that such a query well-formedness clas-sifier can be used to improve the quality of a sequence-to-sequence question generation model (Du et al., 2017) by showing an improvement of 0.2 BLEU score in its performance ( § 3).”
    BackgroundMethodInfluential
  • Generating Natural Questions About an Image

    Mostafazadeh, N., Misra, I., Devlin, J., Mitchell, M., He, X., & Vanderwende, L. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1170 · Cited by 270 · cited 1×

    “Identifying well-formed natural language questions can also facilitate a more nat-ural interaction between a user and a machine in personal assistants or chatbots (Yang et al., 2014; Mostafazadeh et al., 2016) or while recommending related queries in search-engines.”
    Background
  • Task-Oriented Query Reformulation with Reinforcement Learning

    Nogueira, R., & Cho, K. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1061 · Cited by 120 · cited 1×

    “Another direction is to obtain a paraphrase of the given query that is a grammatical natural language question, and then analyze that paraphrase to extract the required information (Nogueira and Cho, 2017; Buck et al., 2018).”
    Background

Show all 5 references

Cited by

See all 32

Metadata

Authors
Faruqui, M., & Das, D.
Venue
Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Published
2018
Pages
798-803
OpenAlex
W2889242953
Cited by
32
References
5
FWCI
2.59
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Identifying Well-formed Natural Language Questions. https://app.cochat.ai/papers/10.18653/v1/d18-1091
The paper
Faruqui, M., & Das, D. (2018). Identifying Well-formed Natural Language Questions. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d18-1091

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.