CSAIL Publications and Digital Archive header
bullet Technical Reports bullet Work Products bullet Research Abstracts bullet Historical Collections bullet

link to publications.csail.mit.edu link to www.csail.mit.edu horizontal line

 

Research Abstracts - 2006
horizontal line

horizontal line

vertical line
vertical line

Knowledge Fusion for Question Answering

Gary Borchardt, Boris Katz & Sue Felshin

The Problem

Question answering systems can provide "one-stop shopping" for information in diverse resources such as databases, Web resources, and repositories of multi-media information. While some questions can be answered using information from a single resource, other questions require the combination of information from multiple resources. Particularly in cases where the question itself does not indicate possible subquestions to be answered, a problem arises of determining which components of knowledge, drawn from which resources, can be combined in which ways to arrive at an answer.

Approach

We are investigating two general approaches to question answering over multiple resources. Our approach to answering complex questions addresses the case where a question can be syntactically decomposed into subquestions that can be relayed to relevant resources. The second approach, described here, applies in those cases where the question is syntactically simple, yet domain knowledge or a representation of underlying meaning can be used to identify and combine suitable components of knowledge from multiple, available resources.

One strategy for handling these situations involves the use of domain-motivated decomposition rules to answer key questions identified by system designers and users. These rules are expressed in terms of "knowledge templates", which combine fixed English phrasing with argument slots for variable values. For example, individual rows in a database table of terrorist incidents might be described using a knowledge template of the form "On [a date], [a terrorist group] used [a weapon type] to perform [an attack type] against [a target type] in [a country]." Using templates of this sort, decomposition rules relate particular questions to sets of subquestions or to available components of knowledge which may be supplied by multiple resources.

The strategy of using explicit semantic decomposition rules works best when there are relatively few key domain questions and available resources. However, when there are many targeted question types and many resources, it becomes increasingly difficult to identify all of the potential semantic interactions between available content in different resources.

For this situation, we are focusing on described event occurrences in particular, with the intent of decomposing these occurrences into collections of lower-level assertions that model what happens during the events. In this way, we hope to automatically identify a number of inter-event relationships, such as when the occurrence of one or more events implies or contradicts the occurrence of another event. This work is grounded in our work on transition space representation [1] [2].

In this approach, the temporal unfolding of various events is modeled by sets of language-based statements that specify, in particular, changes in the values of key attributes of event participants. These statements concerning changes are then further decomposed into statements regarding momentary presence and absence of attributes, and, ultimately, a lowest level of statements that specify whether one quantity, such as a timestamped attribute value, is equal to, not equal to, greater than, or not greater than another quantity. Inference can be carried out on the elaborated lower-level assertions, and the resulting base of assertions can be used to detect instances of support or conflict for other event occurrences.

The following are examples of language-based statements that serve as a grounding for this representation:

  • The affinity between PIJ and Hezbollah increases.
  • The supreme leader of al-Saiqa does not change.
  • The PLF becomes a part of the PFLP-GC.
  • Jordan ceases to be a base of operations for al-Fatah.
  • Khalid al-Hasan is a leader of al-Fatah.
  • The supreme leader of PLO in 1970 equals Yasser Arafat.
Current Status

The strategies described above are being implemented within our IMPACT reasoning system, which operates in conjunction with the START and Omnibase systems to implement our three-layered question answering architecture. A preliminary description of this work appears in [3]. We have applied the strategy of using decomposition rules to a set of information contained in the Monterey Weapons of Mass Destruction Terrorism Database and the MIPT Terrorism Knowledge Base. These rules enable IMPACT, START and Omnibase to answer a range of key questions about terrorist group activities, characteristics and capabilities.

We are currently applying the strategy of representing events in terms of lower-level assertions to a subset of information contained in the MIPT Terrorism Knowledge Base, concerning terrorist group formation, merging, splitting, and related events. This effort targets questions about event occurrences that may be implied or contradicted by other event occurrences, plus questions about underyling changes and the persistence of conditions implied by event occurrences.

Research Support

This work is supported by the Advanced Research and Development Activity as part of the AQUAINT Phase II research program.

References:

[1] Gary C. Borchardt. Understanding Causal Descriptions of Physical Systems. In Proceedings of the AAAI Tenth National Conference on Artificial Intelligence, pp. 2–8, 1992.

[2] Gary C. Borchardt. Thinking between the Lines: Computers and the Comprehension of Causal Descriptions. Cambridge, Massachusetts, 1994.

[3] Boris Katz, Gary Borchardt, and Sue Felshin. Syntactic and Semantic Decomposition Strategies for Question Answering from Multiple Resources. In Proceedings of the AAAI 2005 Workshop on Inference for Textual Question Answering, pp. 35–41, 2005.

 

vertical line
vertical line
 
horizontal line

MIT logo Computer Science and Artificial Intelligence Laboratory (CSAIL)
The Stata Center, Building 32 - 32 Vassar Street - Cambridge, MA 02139 - USA
tel:+1-617-253-0073 - publications@csail.mit.edu