Skip to main content
SpringerLink
Log in

Summarized Logical Forms for Controlled Question Answering

  • Chapter
  • First Online:
Artificial Intelligence for Customer Relationship Management

Part of the book series: Human–Computer Interaction Series ((HCIS))

  • 956 Accesses

Abstract

Providing a high-end question answering (Q/A) requires a special knowledge representation technique, which is based on phrasing-independent partial formalization of the essential information contained in domain answers. We introduce Summarized Logical forms (SLFs), the formalized expressions which contain the most important knowledge extracted from answers to be queried. Instead of indexing the whole answer, we index only its SLFs as a set of expressions for most important topics in this answer. By doing that, we achieve substantially higher Q/A precision since foreign answers will not be triggered. We also introduce Linked SLFs connected by entries of a domain-specific ontology to increase the coverage of a knowledge domain. A methodology of constructing SLFs and Linked SLFs is outlined and the achieved Q/A accuracy is evaluated. Meta-programming issues of matching query representations (QRs) against SLFs and domain taxonomy are addressed as well.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Abramson H, Dahl V (1989) Logic grammars. Springer, New York, Berlin, Heidelberg

    Google Scholar 

  • 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)

    Google Scholar 

  • Amiridze N, Kutsia T (2018) Anti-unification and natural language processing fifth workshop on natural language and computer science. NLCS’18, EasyChair Preprint no. 203

    Google Scholar 

  • Apt KR (1997) From logic programming to PROLOG. Prentice Hall, London

    Google Scholar 

  • 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

    Google Scholar 

  • Bellows A (2007) Clever Hans the Math Horse. https://www.damninteresting.com/clever-hans-the-math-horse/

  • Boguslavsky IM (1996) The sphere of action for lexical units, Studia philologica. Moscow (In Russian)

    Google Scholar 

  • Black F (1964) A deductive question-answering system. In: Minsky M (ed) Semantic Information Processing. MIT Press, Cambridge MA, pp 354–402

    Google Scholar 

  • Bramer M (2013) Logic programming with Prolog. Switzerland, Springer, Cham

    Book  Google Scholar 

  • Bunt H, Bos J, Pulman S (2014) Computing meaning. In: Text, speech and language technology vol 4. Springer, London

    Google Scholar 

  • Cartoonbank (2020) http://cartoonbank.ru/?page_id=29&category=5

  • Chang C-L, Lee RC-T (1973) Symbolic logic and mechanical theorem proving. Academic Press

    Google Scholar 

  • Chen D, A Fisch, J Weston, A Bordes (2017) Reading Wikipedia to answer open-domain questions. https://arxiv.org/abs/1704.00051

  • Darlington JL (1969). Theorem proving and information retrieval. In: Meltzer B, Michie D (eds) Machine intelligence, vol 4. American Elsevier, pp 173–181

    Google Scholar 

  • Galitsky B (1999) Natural language understanding with the generality feedback. DIMACS Tech. Report 99

    Google Scholar 

  • Galitsky B, Grudin M (2001) System, method, and computer program product for responding to natural language queries. US Patent App 09756722

    Google Scholar 

  • Galitsky B (2001) Semi-structured knowledge representation for the automated financial advisor. In: Monostori L, Váncza J, Ali M (eds) Engineering of intelligent systems. IEA/AIE 2001. Lecture notes in computer science, vol 2070. Springer, Berlin, Heidelberg

    Google Scholar 

  • Galitsky B (2002) A tool for extension and restructuring natural language question answering domains. In: International conference on industrial, engineering and other applications of applied intelligent systems

    Google Scholar 

  • Galitsky B (2003) Natural language question answering system: technique of semantic headers. Adv Knowl Int, Australia

    Google Scholar 

  • Galitsky B (2004) Question-answering system for teaching autistic children to reason about mental states. DIMACS Technical Report 2000-24

    Google Scholar 

  • Galitsky B, Pampapathi R. (2005) Can many agents answer questions better than one? First Monday vol 10, no 1. http://firstmonday.org/issues/issue10_1/galitsky/index.html

  • Galitsky B (2005) Disambiguation via default reasoning for answering complex questions. Intl J AI Tools N1-2:157–175

    Google Scholar 

  • Galitsky B (2006) Building a repository of background knowledge using semantic skeletons. In: AAAI spring symposium series

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • Galitsky B, Kuznetsov SO, Usikov D (2013b) Parse thicket representation for multi-sentence search. In: International conference on conceptual structures, pp 153–172

    Google Scholar 

  • Galitsky B, Ilvovsky D, Kuznetsov SO, Strok F (2013c) Matching sets of parse trees for answering multi-sentence questions. In: Proceedings of the recent advances in natural language processing, RANLP 2013. Shoumen, Bulgaria, pp 285–294

    Google Scholar 

  • 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

    Google Scholar 

  • Galitsky B, Botros S (2015) Searching for associated events in log data. US Patent 8,306,967

    Google Scholar 

  • Galitsky B, Ilvovsky D, Kuznetsov SO (2015) Rhetoric map of an answer to compound queries. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing, vol 2, pp 681–686

    Google Scholar 

  • Galitsky B, Kovalerchuk B (2014) Improving web search relevance with learning structure of domain concepts. Clust Order Trees Methods Appl: 341–376

    Google Scholar 

  • Galitsky B (2016a) Generalization of parse trees for iterative taxonomy learning. Inf Sci 329:125–143

    Article  Google Scholar 

  • Galitsky B (2016b) A tool for efficient content compilation. In: Proceedings of COLING

    Google Scholar 

  • Galitsky B (2016c) Reasoning beyond the mental world. In: Computational autism, pp 215–244

    Google Scholar 

  • Galitsky B (2017) Matching parse thickets for open domain question answering. Data Knowl Eng 107:24–50

    Article  Google Scholar 

  • Galitsky B (2019) Learning discourse-level structures for question answering. Developing enterprise chatbots. Springer, Cham, Switzerland, pp 177–219

    Chapter  Google Scholar 

  • Galitsky B, Ilvovsky D, Goncharova E (2019) On a chatbot providing virtual dialogues. In: Proceedings of the international conference on recent advances in natural language processing (RANLP), pp 382–387

    Google Scholar 

  • Gazdar G, Mellish C (1989) Natural language processing in Prolog: an introduction to computational linguistics. Addison-Wesley, Wokingham

    Google Scholar 

  • Green BF, Wolf AK, Chomsky C, Laughery K (1961) Baseball: an automatic question-answerer. IRE-AIEE-ACM western joint computer conference

    Google Scholar 

  • Jia R, Liang P (2017) Adversarial examples for evaluating reading comprehension systems. In: EMNLP, 2021–2031

    Google Scholar 

  • 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, USA

    Google Scholar 

  • Lee G, Kim S, Hwang S (2019) QADiver: interactive framework for diagnosing QA models. AAAI

    Google Scholar 

  • Lehmann F (1992) Semantic networks, Computers & Mathematics with Applications 23(2–5):1–50

    Google Scholar 

  • Maybury MT (2000) Adaptive multimedia information access—ask questions, get answers. In: First international conference on adaptive hypertext AH 00. Trento, Italy

    Google Scholar 

  • Min S, Zhong V, Socher R, Xiong C (2018) Efficient and robust question answering from minimal context over documents. ACL 1725–1735

    Google Scholar 

  • Moldovan D, Pasca M, Harabagiu S, Surdeanu M (2002) Performance issues and error analysis in an open-domain question answering system. In: ACL-2002

    Google Scholar 

  • Montague R (1974) Formal philosophy. Yale University Press, New Haven

    Google Scholar 

  • 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, PA

    Google Scholar 

  • Palmer M (2009) Semlink: linking PropBank, VerbNet and FrameNet. In: Proceedings of the generative lexicon conference, September 2009, Pisa, Italy, GenLex-09

    Google Scholar 

  • Partee BH, ter Meulen A, Wall RE (1990) Mathematical methods in linguistics. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Pasca M (2003) Open-domain question answering from large text collections. CSLI Publication series

    Google Scholar 

  • Pfenning F (1991) Unification and anti-unification in the calculus of constructions. In: Proceedings, sixth annual IEEE symposium on logic in computer science, Amsterdam, The Netherlands, 15–18 July. IEEE Computer Society Press, pp 74–85

    Google Scholar 

  • Popescu A-M, Etzioni O, Kautz H (2003) Towards a theory of natural language interfaces to databases. Intelligent User Interface

    Google Scholar 

  • Rajpurkar P, Zhang J, Lopyrev K, Liang P (2016) Squad: 100,000 questions for machine comprehension of text. https://arxiv.org/abs/1606.05250

  • Redey G (1999) iCTRL: intensional conformal text representation language. Artif Intell 109:33–70

    Article  MathSciNet  Google Scholar 

  • Rus V, Moldovan D (2002). High precision logic form transformation. Intl J AI Tools 11(3)

    Google Scholar 

  • Seo M, Kembhavi A, Farhadi A, Hajishirzi. H (2017) Bidirectional attention flow for machine comprehension. In: ICLR, p 755

    Google Scholar 

  • Shanahan M (1997) Solving the frame problem. The MIT Press, Cambridge, Massachusetts, London, England

    Google Scholar 

  • Sidorov G (2014) Should syntactic N-grams contain names of syntactic relations? Int J Comput Linguist Appl 5(1):139–158

    Google Scholar 

  • Sidorov G, Velasquez F, Stamatatos E, Gelbukh A, Chanona-Hernández L (2012) Syntactic dependency-based N-grams as classification features. LNAI 7630:1–11

    Google Scholar 

  • Sidorov G, Velasquez F, Stamatatos E, Gelbukh A, Chanona-Hernández L (2013) Syntactic N-grams as machine learning features for natural language processing. Expert Syst Appl 41(3):853–860

    Article  Google Scholar 

  • Sowa J (1992) Conceptual graphs summary. In: Nagle TE, Nagle JA, Gerholz LL, Eklund PW (eds) Conceptual structures: current research and practice. Ellis Horwood, Chichester, pp 3–51

    Google Scholar 

  • Tarau P, De Boschere K, Dahl V, Rochefort S (1999) LogiMOO: an extensible multi-user virtual world with natural language control. J Logic Program 38(3):331–353

    Article  Google Scholar 

  • Vo NPA, Popescu O (2016) A multi-layer system for semantic textual similarity. In: 8th international conference on knowledge discovery and information retrieval, vol 1, pp 56–67

    Google Scholar 

  • Vo NPA, Popescu O (2019) Multi-layer and co-learning systems for semantic textual similarity, semantic relatedness and recognizing textual entailment. In: 8th international joint conference, IC3K 2016, Porto, Portugal, November 9–11, 2016, Revised selected papers, pp 54–77

    Google Scholar 

  • Winograd T (1972) Understanding natural language. Academic Press, NewYork

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oracle Labs, Redwood Shores, CA, USA

    Boris Galitsky

Authors
  1. Boris Galitsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boris Galitsky .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Galitsky, B. (2020). Summarized Logical Forms for Controlled Question Answering. In: Artificial Intelligence for Customer Relationship Management. Human–Computer Interaction Series. Springer, Cham. https://doi.org/10.1007/978-3-030-52167-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-52167-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-52166-0

  • Online ISBN: 978-3-030-52167-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation