Support Vector Learning for Semantic Argument Classification

Support Vector Learning for Semantic Argument Classification (2005)

Cached

Download Links

by Sameer Pradhan, Kadri Hacioglu, Valerie Krugler, Wayne Ward , James H. Martin , Daniel Jurafsky

Citations:

67 - 6 self

Versions

Version History

Metadata Version 1

User correction supplied by mph

Datum	Value	Source
TITLE	Support Vector Learning for Semantic Argument Classification	user correction
AUTHOR NAME	Sameer Pradhan, Kadri Hacioglu, Valerie Krugler, Wayne Ward	user correction
AUTHOR NAME	James H. Martin	user correction
AUTHOR NAME	Daniel Jurafsky	user correction
AUTHOR AFFIL	The Center for Spoken Language Research, University of Colorado	user correction
AUTHOR ADDR	Boulder, Co 80303	user correction
ABSTRACT	The natural language processing community has recently experienced a growth of interest in domain independent shallow semantic parsing—the process of assigning a WHO did WHAT to WHOM, WHEN, WHERE, WHY,HOW etc. structure to plain text. This process entails identifying groups of words in a sentence that represent these semantic arguments and assigning specific labels to them. It could play a key role in NLP tasks like Information Extraction, Question Answering and Summarization. We propose a machine learning algorithm for semantic role parsing, extending the work of Gildea and Jurafsky (2002), Surdeanu et al. (2003) and others. Our algorithm is based on Support Vector Machines which we show give large improvement in performance over earlier classifiers. We show performance improvements through a number of new features designed to improve generalization to unseen data, such as automatic clustering of verbs. We also report on various analytic studies examining which features are most important, comparing our classifier to other machine learning algorithms in the literature, and testing its generalization to new test set from different genre. On the task of assigning semantic labels to the PropBank (Kingsbury, Palmer, & Marcus, 2002) corpus, our final system has a precision of 84 % and a recall of 75%, which are the best results currently reported for this task. Finally, we explore a completely different architecture which does not requires a deep syntactic parse. We reformulate the task as a combined chunking and classification problem, thus allowing our algorithm to be applied to new languages or genres of text for which statistical syntactic parsers may not be available.	user correction
YEAR	2005	user correction
CITATIONS	39 found	ParsCit 1.0