Cargando…
A Natural Language Interface Concordant with a Knowledge Base
The discordance between expressions interpretable by a natural language interface (NLI) system and those answerable by a knowledge base is a critical problem in the field of NLIs. In order to solve this discordance problem, this paper proposes a method to translate natural language questions into fo...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4745981/ https://www.ncbi.nlm.nih.gov/pubmed/26904105 http://dx.doi.org/10.1155/2016/9174683 |
_version_ | 1782414753601159168 |
---|---|
author | Han, Yong-Jin Park, Seong-Bae Park, Se-Young |
author_facet | Han, Yong-Jin Park, Seong-Bae Park, Se-Young |
author_sort | Han, Yong-Jin |
collection | PubMed |
description | The discordance between expressions interpretable by a natural language interface (NLI) system and those answerable by a knowledge base is a critical problem in the field of NLIs. In order to solve this discordance problem, this paper proposes a method to translate natural language questions into formal queries that can be generated from a graph-based knowledge base. The proposed method considers a subgraph of a knowledge base as a formal query. Thus, all formal queries corresponding to a concept or a predicate in the knowledge base can be generated prior to query time and all possible natural language expressions corresponding to each formal query can also be collected in advance. A natural language expression has a one-to-one mapping with a formal query. Hence, a natural language question is translated into a formal query by matching the question with the most appropriate natural language expression. If the confidence of this matching is not sufficiently high the proposed method rejects the question and does not answer it. Multipredicate queries are processed by regarding them as a set of collected expressions. The experimental results show that the proposed method thoroughly handles answerable questions from the knowledge base and rejects unanswerable ones effectively. |
format | Online Article Text |
id | pubmed-4745981 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | Hindawi Publishing Corporation |
record_format | MEDLINE/PubMed |
spelling | pubmed-47459812016-02-22 A Natural Language Interface Concordant with a Knowledge Base Han, Yong-Jin Park, Seong-Bae Park, Se-Young Comput Intell Neurosci Research Article The discordance between expressions interpretable by a natural language interface (NLI) system and those answerable by a knowledge base is a critical problem in the field of NLIs. In order to solve this discordance problem, this paper proposes a method to translate natural language questions into formal queries that can be generated from a graph-based knowledge base. The proposed method considers a subgraph of a knowledge base as a formal query. Thus, all formal queries corresponding to a concept or a predicate in the knowledge base can be generated prior to query time and all possible natural language expressions corresponding to each formal query can also be collected in advance. A natural language expression has a one-to-one mapping with a formal query. Hence, a natural language question is translated into a formal query by matching the question with the most appropriate natural language expression. If the confidence of this matching is not sufficiently high the proposed method rejects the question and does not answer it. Multipredicate queries are processed by regarding them as a set of collected expressions. The experimental results show that the proposed method thoroughly handles answerable questions from the knowledge base and rejects unanswerable ones effectively. Hindawi Publishing Corporation 2016 2016-01-21 /pmc/articles/PMC4745981/ /pubmed/26904105 http://dx.doi.org/10.1155/2016/9174683 Text en Copyright © 2016 Yong-Jin Han et al. https://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Article Han, Yong-Jin Park, Seong-Bae Park, Se-Young A Natural Language Interface Concordant with a Knowledge Base |
title | A Natural Language Interface Concordant with a Knowledge Base |
title_full | A Natural Language Interface Concordant with a Knowledge Base |
title_fullStr | A Natural Language Interface Concordant with a Knowledge Base |
title_full_unstemmed | A Natural Language Interface Concordant with a Knowledge Base |
title_short | A Natural Language Interface Concordant with a Knowledge Base |
title_sort | natural language interface concordant with a knowledge base |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4745981/ https://www.ncbi.nlm.nih.gov/pubmed/26904105 http://dx.doi.org/10.1155/2016/9174683 |
work_keys_str_mv | AT hanyongjin anaturallanguageinterfaceconcordantwithaknowledgebase AT parkseongbae anaturallanguageinterfaceconcordantwithaknowledgebase AT parkseyoung anaturallanguageinterfaceconcordantwithaknowledgebase AT hanyongjin naturallanguageinterfaceconcordantwithaknowledgebase AT parkseongbae naturallanguageinterfaceconcordantwithaknowledgebase AT parkseyoung naturallanguageinterfaceconcordantwithaknowledgebase |