Ultraconservative online algorithms for multiclass problems
The Journal of Machine Learning Research
Machine Learning
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Wide-coverage efficient statistical parsing with ccg and log-linear models
Computational Linguistics
Self-training for biomedical parsing
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Overview of BioNLP'09 shared task on event extraction
BioNLP '09 Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing: Shared Task
The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Collective semantic role labelling with Markov logic
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Jointly identifying predicates, arguments and senses using Markov logic
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Joint inference for knowledge extraction from biomedical literature
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Two strong baselines for the BioNLP 2009 event extraction task
BioNLP '10 Proceedings of the 2010 Workshop on Biomedical Natural Language Processing
A comparative study of syntactic parsers for event extraction
BioNLP '10 Proceedings of the 2010 Workshop on Biomedical Natural Language Processing
Automatic construction and multi-level visualization of semantic trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Joint entity and relation extraction using card-pyramid parsing
CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning
Collective cross-document relation extraction without labelled data
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Evaluating dependency representation for event extraction
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Event extraction as dependency parsing
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Search-based structured prediction applied to biomedical event extraction
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
Overview of Genia event task in BioNLP Shared Task 2011
BioNLP Shared Task '11 Proceedings of the BioNLP Shared Task 2011 Workshop
Robust biomedical event extraction with dual decomposition and minimal domain adaptation
BioNLP Shared Task '11 Proceedings of the BioNLP Shared Task 2011 Workshop
Generalizing biomedical event extraction
BioNLP Shared Task '11 Proceedings of the BioNLP Shared Task 2011 Workshop
Fast and robust joint models for biomedical event extraction
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using compositional semantics and discourse consistency to improve Chinese trigger identification
Information Processing and Management: an International Journal
Hi-index | 0.00 |
In this paper we describe our entry to the BioNLP 2009 Shared Task regarding biomolecular event extraction. Our work can be described by three design decisions: (1) instead of building a pipeline using local classifier technology, 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 relational structures over the tokens of a sentence, as opposed to structures that explicitly mention abstract event entities. Our results are competitive: we achieve the 4th best scores for task 1 (in close range to the 3rd place) and the best results for task 2 with a 13 percent point margin.