III: Small: Collaborative Research: Scalable Schema-Based Event Extraction

III：小型：协作研究：可扩展的基于模式的事件提取

• 批准号: 1617969
• 负责人: Niranjan Balasubramanian
• 金额: $ 39.12万
• 依托单位: SUNY at Stony Brook
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2016
• 资助国家: 美国
• 起止时间: 2016-09-01 至 2019-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1617969&HistoricalAwards=false
• 关键词: III; Small; Collaborative; Research; Scalable

One of the major bottlenecks in current language understanding algorithms is the lack of commonsense knowledge about how the world works. When we communicate through language, we implicitly assume that the readers will use this common sense knowledge and make the necessary inferences. Computers, on the other hand, do not have access to this shared common knowledge, and as a result are often unable to understand text well enough to perform important tasks such as question answering. This project will study methods to learn one type of common sense knowledge about event scenarios: the series of events (actions) and the types of entities involved. For example, an arrest scenario typically involves a crime event, and an arrest event, with an arresting agent (say police), a suspect, and possibly a victim of the crime. Language understanding algorithms need to be explicitly told to look for these specific types of events and entities. This approach does not scale to the many possible real world event scenarios. This project will develop machine learning algorithms that automatically acquire this type of knowledge covering a broad range of domains in large text collections. Such algorithms can form the basis of a wide variety of assistive technology that enables public access to information. Examples include the generation of schemas from historical documents to assist students in targeted learning about historical events, or extraction of events and actors involved in current world events from streaming news sources. More generally, access to the event structure of documents will enable better question answering capabilities that, embedded appropriately into search engines, can lead to a more informed public.The project will pursue three central research thrusts to learning commonsense event schemas. The first thrust develops new probabilistic algorithms for inducing event schemas that represent real-world scenarios (e.g., a Suspect is arrested by Police, pleads to a Judge, and is later convicted). The second thrust will develop new models that extract instances of these learned schemas from text (e.g., John is the Suspect). This project is unique to previous work by formalizing these as separate tasks, and thus enabling deeper research into knowledge learning apart from traditional relation extraction. Finally, the third thrust will standardize potential evaluation frameworks for event schema research. Due to the young nature of this research area, formal evaluation and analysis is inconsistent across previous work. This project will produce the largest and most diverse set of event schemas through crowd-sourcing, enabling consistent and clear evaluation of future models.

当前语言理解算法的主要瓶颈之一是缺乏关于世界如何运作的常识。当我们通过语言交流时，我们隐含地假设读者会使用这些常识知识并做出必要的推论。 另一方面，计算机无法访问这种共享的公共知识，因此通常无法很好地理解文本以执行诸如问答之类的重要任务。本项目将研究学习一种关于事件场景的常识知识的方法：一系列事件（动作）和所涉及的实体类型。例如，逮捕场景通常涉及犯罪事件和逮捕事件，其中包括逮捕代理（例如警察），嫌疑人以及可能的犯罪受害者。语言理解算法需要被明确地告知去寻找这些特定类型的事件和实体。这种方法不能扩展到许多可能的真实的世界事件场景。该项目将开发机器学习算法，自动获取这种类型的知识，涵盖大型文本集合中的广泛领域。这种算法可以构成各种辅助技术的基础，使公众能够获得信息。例子包括从历史文档中生成模式，以帮助学生有针对性地学习历史事件，或者从流媒体新闻源中提取涉及当前世界事件的事件和演员。更一般地说，访问文档的事件结构将使更好的问题回答能力，适当地嵌入到搜索引擎中，可以导致更知情的public.The项目将追求三个中心的研究推力学习常识事件图式。第一个目标是开发新的概率算法，用于诱导代表真实世界场景的事件模式（例如，嫌疑犯被警察逮捕，向法官申诉，后来被定罪）。第二个重点是开发新的模型，从文本中提取这些学习模式的实例（例如，约翰是嫌疑犯）。这个项目是独特的，以前的工作，正式这些作为单独的任务，从而使更深入的研究，除了传统的关系提取知识学习。最后，第三个推力将标准化潜在的评估框架的事件图式研究。由于这一研究领域的年轻性质，正式的评估和分析是不一致的，在以前的工作。该项目将通过众包产生最大和最多样化的事件模式集，从而对未来模型进行一致和清晰的评估。