Rule Writing or Annotation: Cost-efficient Resource Usage for Base Noun Phrase Chunking
ArXiv.orgPublished 2 May 2001Open access
Grace Ngai, David Yarowsky
Citations18
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper presents a comprehensive empirical comparison between two approaches for developing a base noun phrase chunker: human rule writing and active learning using interactive real-time human annotation. Several novel variations on active learning are investigated, and underlying cost models for cross-modal machine learning comparison are presented and explored. Results show that it is more efficient and more successful by several measures to train a system using active learning annotation rather than hand-crafted rule writing at a comparable level of human labor investment.
Keywords
Computer Science
Building a Large Annotated Corpus of English: The Penn Treebank
7,528 Citations1993Mitchell P. Marcus
Query by committee
1,657 Citations1992H. Sebastian Seung, Manfred Opper +1 more
It is suggested that asymptotically finite information gain may be an important characteristic of good query algorithms, in which a committee of students is trained on the same data set.
Elsevier eBooksHeterogeneous Uncertainty Sampling for Supervised Learning
1,142 Citations1994David Lewis, Jason Catlett
This work test the use of one classifier (a highly efficient probabilistic one) to select examples for training another (the C4.5 rule induction program) and finds that the uncertainty samples yielded classifiers with lower error rates than random samples ten times larger.
Machine LearningSelective Sampling Using the Query by Committee Algorithm
1,118 Citations1997Yoav Freund, H. Sebastian Seung +2 more
It is shown that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the number of queries, and this exponential decrease holds for query learning of perceptrons.
A stochastic parts program and noun phrase parser for unrestricted text
974 Citations1988Kenneth Church
A program that tags each word in an input sentence with the most likely part of speech has been written and performance is encouraging; a 400-word sample is presented and is judged to be 99.5% correct.
Natural Language EngineeringTechnical terminology: some linguistic properties and an algorithm for identification in text
817 Citations1995John S. Justeson, Slava M. Katz
The paper presents a terminology indentification algorithm that recovers a high proportion of the technical terms in a text, and a high proportaion of the recovered strings are vaild technical terms.
Representing text chunks
449 Citations1999Erik F. Tjong Kim Sang, Jorn Veenstra
It is shown that the the data representation choice has a minor influence on chunking performance, however, equipped with the most suitable data representation, the memory-based learning chunker was able to improve the best published chunking results for a standard data set.
ScholarlyCommons (University of Pennsylvania)A Lexicalized Tree Adjoining Grammar for English
313 Citations1990Anne Abeillé, Kathleen Bishop +2 more
A representation of prepositional complements that is based on extended elementary trees, and how to deal with semantic non compositionality in verb-particle combinations, light verb constructions and idioms, without losing the internal syntactic composition of these structures are presented.
Machine LearningForgetting Exceptions is Harmful in Language Learning
228 Citations1999Walter Daelemans, Antal van den Bosch +1 more
It is shown that in language learning, contrary to received wisdom, keeping exceptional training instances in memory can be beneficial for generalization accuracy, and that decision-tree learning often performs worse than memory-based learning.
Surface grammatical analysis for the extraction of terminological noun phrases
201 Citations1992Didier Bourigault
The type of analysis used (surface grammatical analysis) is highlighted, as the methodological approach adopted to adapt the rules (experimental approach).
Active Learning with Committees for Text Categorization
143 Citations1997Ray Liere, Prasad Tadepalli
This paper reports on experiments using a committee of Winnowbased learners and demonstrates that this approach can reduce the number of labeled training examples required over that used by a single Winnow learner by l-2 orders of magnitude.
Mixed-initiative development of language processing systems
141 Citations1997David Day, John Aberdeen +4 more
A new set of integrated tools, collectively called the Alembic Workbench, that uses a mixed-initiative approach to "bootstrapping" the manual tagging process, with the goal of reducing the overhead associated with corpus development.
arXiv (Cornell University)A Learning Approach to Shallow Parsing
80 Citations2000M. Ruiz Muñoz, Vasin Punyakanok +2 more
Fast NP Chunking using Memory-Based learning techniques
47 Citations1998Jorn Veenstra
A fast decision tree variant of MBL (IGTree) is applied to fast NP chunking on the dataset described in (Ramshaw and Marcus, 1995), which consists of roughly 50,000 test and 200,000 train items.
ArXiv.orgMinimizing Manual Annotation Cost In Supervised Training From Corpora
10 Citations1996Sean P. Engelson, Ido Dagan