A priori analysis of natural language queries

Israel Spiegler; Smadar Elata

doi:10.1016/0306-4573(88)90001-5

A priori analysis of natural language queries

Israel Spiegler^*
, Smadar Elata

^*Corresponding author for this work

Coller School of Management

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

A model for the a priori analysis of natural language queries is presented. Such a model may be used for analyzing queries at the local user workstation and for filtering unanswerable questions. Consequently, unnecessary network traffic and unproductive work at remote information systems may be saved. An algorithm for transforming a natural language query into a logical pattern that represents the meaning of the query is suggested and illustrated. It is claimed that the completeness of the logical pattern is a useful criterion for determining the answerability of the query. The feasibility of the algorithm is tested and validated by a prototype system implemented in PROLOG.

Original language	English
Pages (from-to)	619-631
Number of pages	13
Journal	Information Processing and Management
Volume	24
Issue number	6
DOIs	https://doi.org/10.1016/0306-4573(88)90001-5
State	Published - 1988

Funding

Funders
IIBR
Israel Institute of Business Research
Tel Aviv University
Ministry of Defense

Access to Document

10.1016/0306-4573(88)90001-5

Cite this

@article{80f394ffa60d4985a3c84e48f977c0a0,

title = "A priori analysis of natural language queries",

abstract = "A model for the a priori analysis of natural language queries is presented. Such a model may be used for analyzing queries at the local user workstation and for filtering unanswerable questions. Consequently, unnecessary network traffic and unproductive work at remote information systems may be saved. An algorithm for transforming a natural language query into a logical pattern that represents the meaning of the query is suggested and illustrated. It is claimed that the completeness of the logical pattern is a useful criterion for determining the answerability of the query. The feasibility of the algorithm is tested and validated by a prototype system implemented in PROLOG.",

author = "Israel Spiegler and Smadar Elata",

note = "Funding Information: This study is being supported in part by the Israel Institute of Business Research (IIBR) at Tel Aviv University and by the Israel Ministry of Defense.",

year = "1988",

doi = "10.1016/0306-4573(88)90001-5",

language = "אנגלית",

volume = "24",

pages = "619--631",

journal = "Information Processing and Management",

issn = "0306-4573",

publisher = "Elsevier Ltd.",

number = "6",

}

TY - JOUR

T1 - A priori analysis of natural language queries

AU - Spiegler, Israel

AU - Elata, Smadar

N1 - Funding Information: This study is being supported in part by the Israel Institute of Business Research (IIBR) at Tel Aviv University and by the Israel Ministry of Defense.

PY - 1988

Y1 - 1988

N2 - A model for the a priori analysis of natural language queries is presented. Such a model may be used for analyzing queries at the local user workstation and for filtering unanswerable questions. Consequently, unnecessary network traffic and unproductive work at remote information systems may be saved. An algorithm for transforming a natural language query into a logical pattern that represents the meaning of the query is suggested and illustrated. It is claimed that the completeness of the logical pattern is a useful criterion for determining the answerability of the query. The feasibility of the algorithm is tested and validated by a prototype system implemented in PROLOG.

AB - A model for the a priori analysis of natural language queries is presented. Such a model may be used for analyzing queries at the local user workstation and for filtering unanswerable questions. Consequently, unnecessary network traffic and unproductive work at remote information systems may be saved. An algorithm for transforming a natural language query into a logical pattern that represents the meaning of the query is suggested and illustrated. It is claimed that the completeness of the logical pattern is a useful criterion for determining the answerability of the query. The feasibility of the algorithm is tested and validated by a prototype system implemented in PROLOG.

UR - https://www.scopus.com/pages/publications/45549114569

U2 - 10.1016/0306-4573(88)90001-5

DO - 10.1016/0306-4573(88)90001-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:45549114569

SN - 0306-4573

VL - 24

SP - 619

EP - 631

JO - Information Processing and Management

JF - Information Processing and Management

IS - 6

ER -

A priori analysis of natural language queries

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this