Eric Brill


2004

pdf bib
Spelling Correction as an Iterative Process that Exploits the Collective Knowledge of Web Users
Silviu Cucerzan | Eric Brill
Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing

pdf bib
Automatic Question Answering: Beyond the Factoid
Radu Soricut | Eric Brill
Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics: HLT-NAACL 2004

pdf bib
Web Search Intent Induction via Automatic Query Reformulation
Hal Daumé III | Eric Brill
Proceedings of HLT-NAACL 2004: Short Papers

pdf bib
A Unified Framework For Automatic Evaluation Using 4-Gram Co-occurrence Statistics
Radu Soricut | Eric Brill
Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL-04)

2002

pdf bib
An Analysis of the AskMSR Question-Answering System
Eric Brill | Susan Dumais | Michele Banko
Proceedings of the 2002 Conference on Empirical Methods in Natural Language Processing (EMNLP 2002)

2001

pdf bib
Scaling to Very Very Large Corpora for Natural Language Disambiguation
Michele Banko | Eric Brill
Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics

pdf bib
Mitigating the Paucity-of-Data Problem: Exploring the Effect of Training Corpus Size on Classifier Performance for Natural Language Processing
Michele Banko | Eric Brill
Proceedings of the First International Conference on Human Language Technology Research

2000

pdf bib
An Improved Error Model for Noisy Channel Spelling Correction
Eric Brill | Robert C. Moore
Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics

pdf bib
Automatic Grammar Induction: Combining, Reducing and Doing Nothing
Eric Brill | John C. Henderson | Grace Ngai
Proceedings of the Sixth International Workshop on Parsing Technologies

This paper surveys three research directions in parsing. First, we look at methods for both automatically generating a set of diverse parsers and combining the outputs of different parsers into a single parse. Next, we will discuss a parsing method known as transformation-based parsing. This method, though less accurate than the best current corpus-derived parsers, is able to parse quite accurately while learning only a small set of easily understood rules, as opposed to the many-megabyte parameter files learned by other techniques. Finally, we review a recent study exploring how people and machines compare at the task of creating a program to automatically annotate noun phrases.

pdf bib
Bagging and Boosting a Treebank Parser
John C. Henderson | Eric Brill
1st Meeting of the North American Chapter of the Association for Computational Linguistics

pdf bib
Pattern-Based Disambiguation for Natural Language Processing
Eric Brill
2000 Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora

1999

pdf bib
Exploiting Diversity in Natural Language Processing: Combining Parsers
John C. Henderson | Eric Brill
1999 Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora

pdf bib
Man vs. Machine: A Case Study in Base Noun Phrase Learning
Eric Brill | Grace Ngai
Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics

1998

pdf bib
Beyond N-Grams: Can Linguistic Sophistication Improve Language Modeling?
Eric Brill | Radu Florian | John C. Henderson | Lidia Mangu
COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics

pdf bib
Classifier Combination for Improved Lexical Disambiguation
Eric Brill | Jun Wu
COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics

pdf bib
Beyond N -Grams: Can Linguistic Sophistication Improve Language Modeling?
Eric Brill | Radu Florian | John C. Henderson | Lidia Mangu
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1

pdf bib
Classifier Combination for Improved Lexical Disambiguation
Eric Brill | Jun Wu
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1

1996

pdf bib
Efficient Transformation-Based Parsing
Girogion Satta | Eric Brill
34th Annual Meeting of the Association for Computational Linguistics

1995

pdf bib
Unsupervised Learning of Disambiguation Rules for Part of Speech Tagging
Eric Brill
Third Workshop on Very Large Corpora

pdf bib
Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging
Eric Brill
Computational Linguistics, Volume 21, Number 4, December 1995

1994

pdf bib
A Rule-Based Approach to Prepositional Phrase Attachment Disambiguation
Eric Brill | Philip Resnik
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics

pdf bib
PEGASUS: A Spoken Language Interface for On-Line Air Travel Planning
Victor Zue | Stephanie Seneff | Joseph Polifroni | Michael Phillips | Christine Pao | David Goddeau | James Glass | Eric Brill
Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994

pdf bib
A Report of Recent Progress in Transformation-Based Error-Driven Learning
Eric Brill
Human Language Technology: Proceedings of a Workshop held at Plainsboro, New Jersey, March 8-11, 1994

1993

pdf bib
Automatic Grammar Induction and Parsing Free Text: A Transformation-Based Approach
Eric Brill
Human Language Technology: Proceedings of a Workshop Held at Plainsboro, New Jersey, March 21-24, 1993

pdf bib
Transformation-Based Error-Driven Parsing
Eric Brill
Proceedings of the Third International Workshop on Parsing Technologies

In this paper we describe a new technique for parsing free text: a transformational grammar is automatically learned that is capable of accurately parsing text into binary-branching syntactic trees. The algorithm works by beginning in a very naive state of knowledge about phrase structure. By repeatedly comparing the results of bracketing in the current state to proper bracketing provided in the training corpus, the system learns a set of simple structural transformations that can be applied to reduce the number of errors. After describing the algorithm, we present results and compare these results to other recent results in automatic grammar induction.

pdf bib
Automatic Grammar Induction and Parsing Free Text: A Transformation-Based Approach
Eric Brill
31st Annual Meeting of the Association for Computational Linguistics

1992

pdf bib
A Simple Rule-Based Part of Speech Tagger
Eric Brill
Speech and Natural Language: Proceedings of a Workshop Held at Harriman, New York, February 23-26, 1992

pdf bib
Automatically Acquiring Phrase Structure Using Distributional Analysis
Eric Brill | Mitchell Marcus
Speech and Natural Language: Proceedings of a Workshop Held at Harriman, New York, February 23-26, 1992

pdf bib
A Simple Rule-Based Part of Speech Tagger
Eric Brill
Third Conference on Applied Natural Language Processing

1991

pdf bib
Discovering the Lexical Features of a Language
Eric Brill
29th Annual Meeting of the Association for Computational Linguistics

1990

pdf bib
Deducing Linguistic Structure from the Statistics of Large Corpora
Eric Brill | David Magerman | Mitchell Marcus | Beatrice Santorini
Speech and Natural Language: Proceedings of a Workshop Held at Hidden Valley, Pennsylvania, June 24-27,1990