Loading...

Formal verification of temporal questions in the context of query-answering text summarization

Mostafazadeh, N ; Sharif University of Technology | 2012

595 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-30353-1_35
  3. Publisher: 2012
  4. Abstract:
  5. This paper presents a novel method for answering complex temporal ordering questions in the context of an event and query-based text summarization. This task is accomplished by precisely mapping the problem of "query-based summarization of temporal ordering questions" in the field of Natural Language Processing to "verifying a finite state model against a temporal formula" in the realm of Model Checking. This mapping requires specific definitions, structures, and procedures. The output of this new approach is promisingly a readable and informative summary satisfying the user's needs
  6. Keywords:
  7. Finite-state models ; Formal verifications ; NAtural language processing ; Temporal formulae ; Temporal ordering ; Temporal questions ; Text summarization ; Computational linguistics ; Model checking ; Natural language processing systems ; Text processing ; Artificial intelligence
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 28 May 2012 through 30 May 2012 ; Volume 7310 LNAI , May , 2012 , Pages 350-355 ; 03029743 (ISSN) ; 9783642303524 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-30353-1_35