Article ID: | iaor201112709 |
Volume: | 27 |
Issue: | 4 |
Start Page Number: | 558 |
End Page Number: | 582 |
Publication Date: | Nov 2011 |
Journal: | Computational Intelligence |
Authors: | Riedel Sebastian, Stre Rune, Chun Hong-Woo, Takagi Toshihisa, Tsujii Junichi |
Keywords: | learning, markov processes |
This article presents a novel approach to event extraction from biological text using Markov Logic. It can be described by three design decisions: (1) instead of building a pipeline using local classifiers, we design and learn a joint probabilistic model over events in a sentence; (2) instead of developing specific inference and learning algorithms for our joint model, we apply Markov Logic, a general purpose Statistical Relation Learning language, for this task; (3) we represent events as relations over the token indices of a sentence, as opposed to structures that relate event entities to gene or protein mentions. In this article, we extend our original work by providing an error analysis for binding events. Moreover, we investigate the impact of different loss functions to precision, recall and F‐measure. Finally, we show how to extract events of different types that share the same event clue. This extension allowed us to improve our performance our performance even further, leading to the third best scores for task 1 (in close range to the second place) and the best results for task 2 with a 14% point margin.