|
|
| Spring 2001: CLSP Seminar Series | Tuesday, May 13, 2008 |
This talk addresses two questions: what are the properties of a good grammar representation for natural language processing applications, and how can such grammars be constructed automatically and efficiently? I shall begin by describing a formalism called the Probabilistic Lexicalized Tree Insertion Grammars (PLTIGs), which has several linguistically motivated properties that are helpful for processing natural languages. Next, I shall present a learning algorithm that automatically induces PLTIGs from human-annotated text corpora. I have conducted empirical studies showing that a trained PLTIG compares favorably with other formalisms on several kinds of tasks. Finally, I shall discuss ways of making grammar induction more efficient. In particular, I want to reduce the dependency of the induction process on human-annotated training data. I will show that by applying a learning technique called sample selection to grammar induction, we can significantly decrease the number of training examples needed, and thereby reducing the human effort spent on annotating training data.
Biographical Information
Rebecca Hwa is currently a postdoctoral research fellow at University of Maryland, College Park. Her research interests include natural language processing, machine learning, and human computer interaction.
| The Center for Language and Speech Processing The Johns Hopkins University 3400 North Charles Street, Barton Hall Baltimore, MD 21218 | |||||
 | Telephone: (410) 516-4237 | | Fax: (410) 516-5050 | | E-mail: clsp@clsp.jhu.edu |