• Publications
  • Influence
Introduction to the CoNLL-2005 Shared Task: Semantic Role Labeling
In this paper we describe the CoNLL-2005 shared task on Semantic Role Labeling. We introduce the specification and goals of the task, describe the data sets and evaluation methods, and present aExpand
  • 632
  • 74
Simple Semi-supervised Dependency Parsing
We present a simple and effective semisupervised method for training dependency parsers. We focus on the problem of lexical representation, introducing features that incorporate word clusters derivedExpand
  • 484
  • 69
FreeLing: An Open-Source Suite of Language Analyzers
Basic language processing such as tokenizing, morphological analyzers, lemmatizing, PoS tagging, chunking, etc. is a need for most NL applications such as Machine Translation, Summarization, DialogueExpand
  • 311
  • 35
Experiments with a Higher-Order Projective Dependency Parser
We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between the tokens of aExpand
  • 259
  • 29
Boosting Trees for Anti-Spam Email Filtering
This paper describes a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages. Several variants of the AdaBoost algorithm with confidence-ratedExpand
  • 393
  • 24
Introduction to the CoNLL-2004 Shared Task: Semantic Role Labeling
In this paper we describe the CoNLL-2004 shared task: semantic role labeling. We introduce the specification and goal of the task, describe the data sets and evaluation methods, and present a generalExpand
  • 315
  • 23
Semantic Role Labeling: An Introduction to the Special Issue
Semantic role labeling, the computational identification and labeling of arguments in text, has become a leading task in computational linguistics today. Although the issues for this task have beenExpand
  • 227
  • 23
TAG, Dynamic Programming, and the Perceptron for Efficient, Feature-Rich Parsing
We describe a parsing approach that makes use of the perceptron algorithm, in conjunction with dynamic programming methods, to recover full constituent-based parse trees. The formalism allows a richExpand
  • 133
  • 22
Structured Prediction Models via the Matrix-Tree Theorem
This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how partition functionsExpand
  • 121
  • 18
Named Entity Extraction using AdaBoost
This paper presents a Named Entity Extraction (NEE) system for the CoNLL 2002 competition. The two main sub-tasks of the problem, recognition (NER) and classification (NEC), are performedExpand
  • 190
  • 17