Syntactic Simplification and Semantic Enrichment - Trimming Dependency Graphs for Event Extraction.

COMPUTATIONAL INTELLIGENCE(2011)

引用 31|浏览41
暂无评分
摘要
In our approach to event extraction, dependency graphs constitute the fundamental data structure for knowledge capture. Two types of trimming operations pave the way to more effective relation extraction. First, we simplify the syntactic representation structures resulting from parsing by pruning informationally irrelevant lexical material from dependency graphs. Second, we enrich informationally relevant lexical material in the simplified dependency graphs with additional semantic meta data at several layers of conceptual granularity. These two aggregation operations on linguistic representation structures are intended to avoid overfitting of machine learning-based classifiers which we use for event extraction (besides manually curated dictionaries). Given this methodological framework, the corresponding JReX system developed by the JulieLab Team from Friedrich-Schiller-Universitat Jena (Germany) scored on 2nd rank among 24 competing teams for Task 1 in the BioNLP09 Shared Task on Event Extraction, with 45.8% recall, 47.5% precision and 46.7% F1-score on all 3,182 events. In more recent experiments, based on slight modifications of JReX and using the same data sets, we were able to achieve 45.9% recall, 57.7% precision, and 51.1% F1-score.
更多
查看译文
关键词
biomedical natural language processing,dependency parsing,event extraction,relation extraction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要