The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
Proceedings of the 35th Annual Meeting on Association for Computational Linguistics - 1997
DOI: 10.3115/976909.979649
|View full text |Cite
|
Sign up to set email alerts
|

Comparing a linguistic and a stochastic tagger

Abstract: 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 experiments show that for the same amount of remaining ambiguity, the error rate of the statistical tagger is one order of magnitude greater than that of the rule-based one. The two related issues of priming effects compromising the results and disagreement between huma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

1999
1999
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(22 citation statements)
references
References 16 publications
(16 reference statements)
0
22
0
Order By: Relevance
“…Taggers can be based on stochastic models [2-7], on rules [8,9], or on neural networks [10]. In a recent paper, Samuelsson and Voutilainen claim that rule-based taggers can give higher tagging accuracy than plain stochastic taggers on correct texts [11]. However, hybrids between rule-based taggers and stochastic taggers might be even better [12].…”
mentioning
confidence: 99%
“…Taggers can be based on stochastic models [2-7], on rules [8,9], or on neural networks [10]. In a recent paper, Samuelsson and Voutilainen claim that rule-based taggers can give higher tagging accuracy than plain stochastic taggers on correct texts [11]. However, hybrids between rule-based taggers and stochastic taggers might be even better [12].…”
mentioning
confidence: 99%
“…It calculates the lexical probabilities of unknown words based on their suffixes. Comparison between statistical and linguistic rule based taggers shows that for the same amount of remaining ambiguity, the error rate of a statistical tagger is one order of magnitude greater than that of the rule based one [4]. The taggers described above are specifically designed for relatively fixed word order languages, where position of the word plays an important role.…”
Section: Literature Survey a Existing Workmentioning
confidence: 97%
“…Their claim of better quality with comparable development time for the constraint-based grammar, however, loses in importance because the HMM tagger was trained using unsupervised training only. A more recent comparison was reported by Samuelsson and Voutilainen (1997). A state-of-the-art statistical tagger was trained on a corpus of over 300,000 words manually analysed (and proofread several times) according to the EngCG grammatical representation.…”
Section: The Current Situationmentioning
confidence: 99%
“…Its error rate is between a half and two-thirds of that of the older versions, while the amount of ambiguity it leaves is well below half of that left by the older versions. A performance test and a comparison to a state-of-the-art statistical tagger is reported by Samuelsson and Voutilainen (1997). EngCG-2 documentation and an interactive demo can be found at the following URL: http://www .…”
Section: Some Facts About a Large Grammarmentioning
confidence: 99%