William A. Gale
William A. Gale has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- David D. Lewis
AT&T Bell Laboratories Murray Hill 07974 NJ USA
3 shared publications David Yarowsky
AT&T Bell Laboratories 600 Mountain Avenue P.O. Box 636 07974-0636 Murray Hill NJ
1 shared publication- Dragomir R. Radev
Department of Computer Science Columbia University New York 10027 NY
1 shared publication - Evelyne Tzoukermann
Bell-Labs, Lucent Technologies, Bell-Labs, Lucent Technologies
1 shared publication Jonathan I. Helfman
1 shared publicationKenneth W. Church
1 shared publication
Latest Publications
- Open Access
Tagging French Without Lexical Probabilities -- Combining Linguistic Knowledge And Statistical Learning
This paper explores morpho-syntactic ambiguities for French to develop a strategy for part-of-speech disambiguation that a) reflects the complexity of French as an inflected language, b) optimizes the estimation of probabilities, c) allows the user flexibility in choosing a tagset. The problem in extracting lexical probabilities from a limited training corpus is that the statistical model may not necessarily represent the use of a particular word in a particular context. In a highly morphologically inflected language, this argument is particularly serious since a word can be tagged with a large number of parts of speech. Due to the lack of sufficient training data, we argue against estimating lexical probabilities to disambiguate parts of speech in unrestricted texts. Instead, we use the strength of contextual probabilities along with a feature we call ``genotype'', a set of tags associated with a word. Using this knowledge, we have built a part-of-speech tagger that combines linguistic and statistical approaches: contextual information is disambiguated by linguistic rules and n-gram probabilities on parts of speech only are estimated in order to disambiguate the remaining ambiguous tags.
Open AccessTagging French Without Lexical Probabilities -- Combining Linguistic Knowledge And Statistical Learning
This paper explores morpho-syntactic ambiguities for French to develop a strategy for part-of-speech disambiguation that a) reflects the complexity of French as an inflected language, b) optimizes the estimation of probabilities, c) allows the user flexibility in choosing a tagset. The problem in extracting lexical probabilities from a limited training corpus is that the statistical model may not necessarily represent the use of a particular word in a particular context. In a highly morphologically inflected language, this argument is particularly serious since a word can be tagged with a large number of parts of speech. Due to the lack of sufficient training data, we argue against estimating lexical probabilities to disambiguate parts of speech in unrestricted texts. Instead, we use the strength of contextual probabilities along with a feature we call ``genotype'', a set of tags associated with a word. Using this knowledge, we have built a part-of-speech tagger that combines linguistic and statistical approaches: contextual information is disambiguated by linguistic rules and n-gram probabilities on parts of speech only are estimated in order to disambiguate the remaining ambiguous tags.
- Open Access
A Sequential Algorithm for Training Text Classifiers
The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural language processing, and other tasks involving data which is partly or fully textual. An algorithm for sequential sampling during machine learning of statistical classifiers was developed and tested on a newswire text categorization task. This method, which we call uncertainty sampling, reduced by as much as 500-fold the amount of training data that would have to be manually classified to achieve a given level of effectiveness.
Open AccessA Sequential Algorithm for Training Text Classifiers
The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural language processing, and other tasks involving data which is partly or fully textual. An algorithm for sequential sampling during machine learning of statistical classifiers was developed and tested on a newswire text categorization task. This method, which we call uncertainty sampling, reduced by as much as 500-fold the amount of training data that would have to be manually classified to achieve a given level of effectiveness.
- 1 January 1994
- Published by Springer Nature
- p. 3-12
A Sequential Algorithm for Training Text Classifiers
- 1 January 1994
- Published by Springer Nature
- p. 3-12
A Sequential Algorithm for Training Text Classifiers
- 1 December 1992
- Published by Springer Nature in Computers and the Humanities
- Vol. 26 (5-6) , 415-439
A method for disambiguating word senses in a large corpus
- 1 December 1992
- Published by Springer Nature in Computers and the Humanities
- Vol. 26 (5-6) , 415-439
A method for disambiguating word senses in a large corpus