CoChat

Question Answering Systems With Deep Learning-Based Symbolic Processing

Open access
Honda, Hiroshi, Hagiwara, Masafumi · 2019 · IEEE Access

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

Abstract

The authors propose methods to learn symbolic processing with deep learning and to build question answering systems by means of learned models. Symbolic processing, performed by the Prolog processing systems which execute unification, resolution, and list operations, is learned by a combination of deep learning models, Neural Machine Translation (NMT) and Word2Vec training. To our knowledge, the implementation of a Prolog-like processing system using deep learning is a new experiment that has not been conducted in the past. The results of their experiments revealed that the proposed methods are superior to the conventional methods because symbolic processing (1) has rich representations, (2) can interpret inputs even if they include unknown symbols, and (3) can be learned with a small amount of training data. In particular (2), handling of unknown data, which is a major task in artificial intelligence research, is solved using Word2Vec. Furthermore, question answering systems can be built from knowledge bases written in Prolog with learned symbolic processing, which, with conventional methods, is extremely difficult to accomplish. Their proposed systems can not only answer questions through powerful inferences by utilizing facts that harbor unknown data but also have the potential to build knowledge bases from a large amount of data, including unknown data, on the Web. The proposed systems are a completely new trial, there is no state-of-the-art methods in the sense of “newest”. Therefore, to evaluate their efficiency, they are compared with the most traditional and robust system i.e., the Prolog system. This is new research that encompasses the subjects of conventional artificial intelligence and neural network, and their systems have higher potential to build applications such as FAQ chatbots, decision support systems and energy-efficient estimation using a large amount of information on the Web. Mining hidden information through these applications will provide great value.

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.1109/access.2019.2948081

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Figures

FIGURE 2 An example of SLD resolution.
FIGURE 2 An example of SLD resolution.CC-BY · From the PDF
FIGURE 3 An example of backtrack.
FIGURE 3 An example of backtrack.CC-BY · From the PDF
FIGURE 5 Unification model.
FIGURE 5 Unification model.CC-BY · From the PDF
FIGURE 6 Resolution model.
FIGURE 6 Resolution model.CC-BY · From the PDF
FIGURE 7 Example of increasing training data.
FIGURE 7 Example of increasing training data.CC-BY · From the PDF
FIGURE 8 Membership relation model.
FIGURE 8 Membership relation model.CC-BY · From the PDF
FIGURE 9 Question answering system.
FIGURE 9 Question answering system.CC-BY · From the PDF
FIGURE 10 User interface.
FIGURE 10 User interface.CC-BY · From the PDF
FIGURE 11 Some examples of translation from texts to Prolog.
FIGURE 11 Some examples of translation from texts to Prolog.CC-BY · From the PDF
FIGURE 12 Text-to-Prolog model.
FIGURE 12 Text-to-Prolog model.CC-BY · From the PDF
FIGURE 14 An example of translation from Prolog to texts.
FIGURE 14 An example of translation from Prolog to texts.CC-BY · From the PDF
Image 12
CC-BY · From the PDF
FIGURE 16 Transformer.
FIGURE 16 Transformer.CC-BY · From the PDF
FIGURE 17 An example of kinsources knowledge base.
FIGURE 17 An example of kinsources knowledge base.CC-BY · From the PDF
Image 15
CC-BY · From the PDF
Image 16
CC-BY · From the PDF

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 53 references

Research works printed but not linked: 6

  1. G. Sourek, V. Aschenbrenner, F. Zelezny, and O. Kuzelka, ''Lifted rela- tional neural networks,'' in Proc. Int. Conf. Cogn. Comput., Integrating Neural Symbolic Approaches, Montreal, QC, Canada, 2015.
  2. L. Shastri, ''Neurally motivated constraints on the working memory capac- ity of a production system for parallel processing: Implications of a connectionist model based on temporal synchrony,'' in Proc. 14th Annu. Conf. Cognit. Sci. Soc. Bloomington, IN, USA: Psychology Press, vol. 14, Jul./Aug. 1992, p. 159.
  3. received the B.E., M.E., and Ph.D. degrees in electrical engineering from Keio University, Yokohama, Japan, in 1982, 1984, and 1987, respectively. Since 1987, he has been with Keio University, where he is currently a Professor. From 1991 to 1993, he was a Visiting Scholar with Stanford University. His research interests include neural networks, fuzzy systems, and affective engineering. He is a member of IEICE, IPSJ, JSAI, SOFT, IEE of Japan, and JNNS. He received from the IEEE Consumer Electronics Society Chester Sall Award, in 1990, the Author Award from Japan Society of Fuzzy Theory and Systems, in 1996, the Technical Award and Paper Awards from Japan Society of Kansei Engineering, in 2003, 2004, and 2014, respectively, and the Best Research Award from Japanese Neural Network Society, in 2013. He was the President of the Japan Society for Fuzzy Theory and Intelligent Informatics (SOFT).
  4. Kinsources: A Collaborative Web Platform for Kinship Data Sharing. Accessed: May 19, 2018. [Online]. Available: https://www.kinsources.net/
  5. A. Maas, A. Hannu, and A. Ng, ''Rectifier nonlinearities improve neural network acoustic models,'' in Proc. 30th Int. Conf. Mach. Learn., Atlanta, GA, USA, 2013, p. 3.
  6. M. S. Kohn, J. Sun, S. Knoop, A. Shabo, B. Carmeli, D. Sow, T. Syed-Mahmood, and W. Rapp, ''IBM's health analytics and clini- cal decision support.,'' Yearbook Med. Inf., vol. 9, no. 1, pp154-162, Aug. 2014.

Cited by

Metadata

Authors
Honda, H., & Hagiwara, M.
Affiliations
Keio University (JP)
Venue
IEEE Access
Published
2019
Volume
7
Pages
152368-152378
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2981096080
Cited by
23
References
55
Citations by year
2026: 3 · 2025: 6 · 2024: 4 · 2023: 4 · 2022: 3 · 2021: 3
FWCI
0.68
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Keio University
  • KLL Ph.D. Program Research Grant
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
Keywords
question answering systems, symbolic processing, Prolog, neural machine translation, Word2Vec, knowledge base, unification, resolution

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

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.