| { | |
| "paper_id": "O18-1006", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T08:09:55.786165Z" | |
| }, | |
| "title": "Supporting Evidence Retrieval for Answering Yes/No Questions", | |
| "authors": [ | |
| { | |
| "first": "\u5433\u5b5f\u54f2", | |
| "middle": [], | |
| "last": "Meng", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Tse", | |
| "middle": [], | |
| "last": "Wu", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Yi-Chung", | |
| "middle": [], | |
| "last": "\u6797\u4e00\u4e2d", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Lin", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Keh-Yih", | |
| "middle": [], | |
| "last": "\u8607\u514b\u6bc5", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Su", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "", | |
| "pdf_parse": { | |
| "paper_id": "O18-1006", | |
| "_pdf_hash": "", | |
| "abstract": [], | |
| "body_text": [ | |
| { | |
| "text": "showed that the performance of our proposed approach is 5% higher than the well-known ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": {}, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "num": null, | |
| "type_str": "figure", | |
| "uris": null, | |
| "text": "for retrieving the supporting evidence, which is a question related text passage in the given document, for answering Yes/No questions is proposed in this paper. It locates the desired passage according to the question text with an efficient and simple n-gram matching algorithm. In comparison with those previous approaches, this model is more efficient and easy to implement. The proposed approach was tested on a task of answering Yes/No questions of Taiwan elementary school Social Studies lessons. Experimental results" | |
| }, | |
| "TABREF0": { | |
| "num": null, | |
| "text": "The 2018 Conference on Computational Linguistics and Speech Processing ROCLING 2018, pp. 76-77 \u00a9The Association for Computational Linguistics and Chinese Language Processing", | |
| "html": null, | |
| "content": "<table/>", | |
| "type_str": "table" | |
| } | |
| } | |
| } | |
| } |