Results 1 - 10
of
68
Comparing a Linguistic and a Stochastic Tagger
- Proceedings of the Thirty-Fifth Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
, 1997
"... Concerning different approaches to automatic PoS tagging: EngCG-2, a constraintbased morphological tagger, is compared in a double-blind test with a state-of-the-art statistical tagger on a common disambiguation task using a common tag set. The ex- periments show that for the same amount of remainin ..."
Abstract
-
Cited by 45 (2 self)
- Add to MetaCart
Concerning different approaches to automatic PoS tagging: EngCG-2, a constraintbased morphological tagger, is compared in a double-blind test with a state-of-the-art statistical tagger on a common disambiguation task using a common tag set. The ex- periments show that for the same amount
Simulating Morphological Analyzers with Stochastic Taggers for Confidence Estimation
"... Abstract. We propose a method for providing stochastic confidence estimates for rule-based and black-box natural language (NL) processing systems. Our method does not require labeled training data: We simply train stochastic models on the output of the original NL systems. Numeric confidence estimat ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. We propose a method for providing stochastic confidence estimates for rule-based and black-box natural language (NL) processing systems. Our method does not require labeled training data: We simply train stochastic models on the output of the original NL systems. Numeric confidence
A Simple Rule-Based Part of Speech Tagger
, 1992
"... Automatic part of speech tagging is an area of natural language processing where statistical techniques have been more successful than rule- based methods. In this paper, we present a sim- ple rule-based part of speech tagger which automatically acquires its rules and tags with accuracy coinparable ..."
Abstract
-
Cited by 596 (9 self)
- Add to MetaCart
to stochastic taggers. The rule-based tagger has many advantages over these taggers, including: a vast reduction in stored information required, the perspicuity of a sinall set of meaningful rules, ease of finding and implementing improvements to the tagger, and better portability from one tag set, cor- pus
BioCreAtIvE Task1A: entity identification with a stochastic tagger
, 2005
"... doi:10.1186/1471-2105-6-S1-S4 <supplement> <title> <p>A critical assessment of text mining methods in molecular biology</p> </title> <editor>Christian Blaschke, Lynette Hirschman, Alfonso Valencia, Alexander Yeh</editor> <note>Report</note> </ ..."
Abstract
- Add to MetaCart
;/supplement> Background: Our approach to Task 1A was inspired by Tanabe and Wilbur's ABGene system [1,2]. Like Tanabe and Wilbur, we approached the problem as one of part-of-speech tagging, adding a GENE tag to the standard tag set. Where their system uses the Brill tagger, we used TnT, the Trigrams 'n &apos
Some advances in transformation-based part-of-speech tagging
- In Proceedings of the Twelfth National Conference on Artificial Intelligence
, 1994
"... Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual probabilities. In (Brill 1992), a trainable rule-based tagger wa ..."
Abstract
-
Cited by 294 (1 self)
- Add to MetaCart
Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual probabilities. In (Brill 1992), a trainable rule-based tagger
unknown title
"... reconfigurable stochastic tagger for languages with complex tag structure ..."
Abstract
- Add to MetaCart
reconfigurable stochastic tagger for languages with complex tag structure
Partial parsing via finite-state cascades
- Natural Language Engineering
, 1996
"... Finite-state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite-state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers d ..."
Abstract
-
Cited by 340 (4 self)
- Add to MetaCart
do not necessarily involve trading off accuracy against speed—they may in fact be more accurate than exhaustive-search stochastic contextfree parsers. 1 Finite-State Cascades Of current interest in corpus-oriented computational linguistics are techniques for bootstrapping broad-coverage parsers from
Automatic Acquisition Of A Large Subcategorization Dictionary From Corpora
, 1993
"... This paper presents a new method for producing a dictionary of subcategorization frames from un- labelled text corpora. It is shown that statistical filtering of the results of a finite state parser running on the output of a stochastic tagger produces high quality results, despite the error rates o ..."
Abstract
-
Cited by 184 (4 self)
- Add to MetaCart
This paper presents a new method for producing a dictionary of subcategorization frames from un- labelled text corpora. It is shown that statistical filtering of the results of a finite state parser running on the output of a stochastic tagger produces high quality results, despite the error rates
Implementing an Efficient Part-of-Speech Tagger
- Software–Practice and Experience
, 1999
"... An efficient implementation of a part-of-speech tagger for Swedish is described. The stochastic tagger uses a well-established Markov model of the language. The tagger tags 92% of unknown words correctly and up to 97% of all words. Several implementation and optimization considerations are discussed ..."
Abstract
-
Cited by 42 (6 self)
- Add to MetaCart
An efficient implementation of a part-of-speech tagger for Swedish is described. The stochastic tagger uses a well-established Markov model of the language. The tagger tags 92% of unknown words correctly and up to 97% of all words. Several implementation and optimization considerations
Trigram morphosyntactic tagger for Polish
- In Proceedings of the International IIS:IIPWM'04 Conference
, 2004
"... Abstract. We introduce an implementation of a plain trigram part-of-speech tagger which appears to work well on Polish texts. At this moment the tagger achieves 9.4 % error rate, which makes it signficantly better than our previous stochastic disambiguator. Since the trigram model for Polish behaves ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
Abstract. We introduce an implementation of a plain trigram part-of-speech tagger which appears to work well on Polish texts. At this moment the tagger achieves 9.4 % error rate, which makes it signficantly better than our previous stochastic disambiguator. Since the trigram model for Polish
Results 1 - 10
of
68