Maximum Entropy Models for FrameNet Classification

46Citations
Citations of this article
92Readers
Mendeley users who have this article in their library.

Abstract

The development of FrameNet, a large database of semantically annotated sentences, has primed research into statistical methods for semantic tagging. We advance previous work by adopting a Maximum Entropy approach and by using previous tag information to find the highest probability tag sequence for a given sentence. Further we examine the use of sentence level syntactic pattern features to increase performance. We analyze our strategy on both human annotated and automatically identified frame elements, and compare performance to previous work on identical test data. Experiments indicate a statistically significant improvement (p<0.01) of over 6%.

Cite

CITATION STYLE

APA

Fleischman, M., Kwon, N., & Hovy, E. (2003). Maximum Entropy Models for FrameNet Classification. In Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing, EMNLP 2003 (pp. 49–56). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1119355.1119362

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free