A note on sequential rule-based POS tagging

Authors:
Sylvain Schmitz
Affiliations:
LSV, ENS Cachan & CNRS, Cachan, France
Venue:
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Year:
2011

Citing 7
Cited 0

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers

Computational Linguistics
Automata for matching patterns

Handbook of formal languages, vol. 2
String Matching Algorithms and Automata

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
A simple rule-based part of speech tagger

ANLC '92 Proceedings of the third conference on Applied natural language processing
Efficient dictionary-based text rewriting using subsequential transducers†

Natural Language Engineering
Elements of Automata Theory

Elements of Automata Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Brill's part-of-speech tagger is defined through a cascade of leftmost rewrite rules. We revisit the compilation of such rules into a single sequential transducer given by Roche and Schabes (Comput. Ling. 1995) and provide a direct construction of the minimal sequential transducer for each individual rule.