{"pk":31354,"title":"Simple+Robust = Pragmatic: A Natural language Query Processing Model for Card-type Databases","subtitle":null,"abstract":"Read users' queries to databases written in their natural language tend to be extra-grammatical, erroneous and, sometimes just a sequence of keywords. Since most conventional natural language interfaces are seminatural, they cannot treat such real queries very well. This paper proposes a new natural language query interpretation model, named SIMPLA. Because the model has a keyword-based parsing mechanism, it is very robust to cope with extragrammatical sentences. The strong keyword-based parsing capability is very dependent upon its target database's being a \"card''-type. SIMPLA provides several operators to define peripheral knowledge, regarding the target database. Such peripheral knowledge is stored virtually in parts of the target ''card\"-type database. Since the target database with the peripheral knowledge remains •'card\"-type, S I M P L A does not decrease its robust natural language processing capability, while it embodies the ability to respond to questions concerning peripheral questions.","language":"eng","license":{"name":"","short_name":"","text":null,"url":""},"keywords":[],"section":"Posters","is_remote":true,"remote_url":"https://escholarship.org/uc/item/1sz0784h","frozenauthors":[{"first_name":"Seigou","middle_name":"","last_name":"Arita","name_suffix":"","institution":"NEC Corporation","department":""},{"first_name":"Hideo","middle_name":"","last_name":"Shimazu","name_suffix":"","institution":"NEC Corporation","department":""},{"first_name":"Yosuke","middle_name":"","last_name":"Takashima","name_suffix":"","institution":"NEC Corporation","department":""}],"date_submitted":null,"date_accepted":null,"date_published":"1992-01-01T18:00:00Z","render_galley":null,"galleys":[{"label":"PDF","type":"pdf","path":"https://journalpub.escholarship.org/cognitivesciencesociety/article/31354/galley/22423/download/"}]}