Abstract
We build a question–answering (Q/A) chatbot component for answering complex questions in poorly formalized and logically complex domains. Answers are annotated with deductively linked logical expressions (semantic skeletons), which are to be matched with formal representations for questions. We utilize a logic programming approach so that the search for an answer is implemented as determining clauses (associated with this answer) from which the formal representation of a question can be deduced. This Q/A technique has been implemented for the financial and legal domains, which are rather sophisticated on one hand and requires fairly precise answers on the other hand.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Acheampong KN, Pan Z-H, Zhou E-Q, Li X-Y (2016) Answer triggering of factoid questions: a cognitive approach. In: 13th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)
Baral C, Gelfond M, Scherl R (2004) Using answer set programming to answer complex queries. In: Workshop on pragmatics of question answering at HLT-NAAC2004
Chen D, A Fisch, J Weston, A Bordes (2017) Reading Wikipedia to answer open-domain questions. https://arxiv.org/abs/1704.00051
Galitsky B (2003) Natural language question answering system: technique of semantic headers. Advance Knowledge International, Australia
Galitsky B (2004) Use of default reasoning for disambiguation under question answering. In: FLAIRS conference, pp 496–501
Galitsky B (2005) Disambiguation via default reasoning for answering complex questions. Intl J AI Tools N1-2:157–175
Galitsky B, Botros S (2012) Searching for associated events in log data. US Patent 8,306,967
Galitsky B, Kovalerchuk B (2014) Clusters, orders, and trees: methods and applications, pp 341–376
Galitsky B, Pampapathi R (2005) Can many agents answer questions better than one? First Monday 10(1). http://firstmonday.org/issues/issue10_1/galitsky/index.html
Galitsky B, Dobrocsi G, De La Rosa JL, Kuznetsov SO (2010) From generalization of syntactic parse trees to conceptual graphs. In: International conference on conceptual structures, pp 185–190
Galitsky B, Ilvovsky D, Strok F, Kuznetsov SO (2013a) Improving text retrieval efficiency with pattern structures on parse thickets. In: Proceedings of FCAIR@IJCAI, pp 6–21
Galitsky B, Kuznetsov SO, Usikov D (2013b) Parse thicket representation for multi-sentence search. In: International conference on conceptual structures, pp 153–172
Galitsky B, Ilvovsky D, Kuznetsov SO, Strok F (2014) Finding maximal common sub-parse thickets for multi-sentence search. In: Graph structures for knowledge representation and reasoning, IJCAI workshop, pp 39–57
Kovalerchuk B, Smigaj A (2015) Computing with words beyond quantitative words: incongruity modeling. In: 2015 annual conference of the north American fuzzy information processing society (NAFIPS). Redmond, WA
Maybury MT (2000) Adaptive multimedia information access – ask questions, get answers. In: First international conference on adaptive hypertext AH 00, Trento, Italy
Moldovan D, Pasca M, Harabagiu S, Surdeanu M (2002) Performance issues and error analysis in an open-domain question answering system. In: ACL-2002
Ng HT, Lai Pheng Kwan J, Xia Y (2001) Question answering using a large text database: a machine learning approach. In: Proceedings of the 2001 conference on empirical methods in natural language processing. EMNLP 2001, Pittsburgh
Pasca M (2003) Open-domain question answering from large text collections. CSLI Publication series
Popescu A-M, Etzioni O, Kautz H (2003) Towards a theory of natural language interfaces to databases. Intelligent user interface
Rajpurkar P, Zhang J, Lopyrev K, Liang P (2016) Squad: 100,000+ questions for machine comprehension of text. https://arxiv.org/abs/1606.05250
Rus V, Moldovan D (2002) High precision logic form transformation. Int J AI Tools 11(3):437–454
Sidorov G (2014) Should syntactic N-grams contain names of syntactic relations? Int J Comput Linguist Appl 5(1):139–158
Winograd T (1972) Understanding natural language. Academic, New York
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Galitsky, B. (2019). Semantic Skeleton Thesauri for Question Answering Bots. In: Developing Enterprise Chatbots. Springer, Cham. https://doi.org/10.1007/978-3-030-04299-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-04299-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04298-1
Online ISBN: 978-3-030-04299-8
eBook Packages: Computer ScienceComputer Science (R0)