Part-of-Speech Tagging with Two Sequential Transducers
Andre Kempe

TL;DR
This paper introduces a fast, cascade-based finite-state transducer method for part-of-speech tagging, offering a speed advantage over HMMs with a slight trade-off in accuracy, suitable for applications prioritizing speed.
Contribution
It proposes a novel FST cascade approach for POS disambiguation that improves processing speed while maintaining acceptable accuracy levels.
Findings
FST cascade significantly faster than HMM-based methods.
Slight decrease in accuracy compared to traditional HMM approaches.
Effective for applications where speed outweighs perfect accuracy.
Abstract
We present a method of constructing and using a cascade consisting of a left- and a right-sequential finite-state transducer (FST), T1 and T2, for part-of-speech (POS) disambiguation. Compared to an HMM, this FST cascade has the advantage of significantly higher processing speed, but at the cost of slightly lower accuracy. Applications such as Information Retrieval, where the speed can be more important than accuracy, could benefit from this approach. In the process of tagging, we first assign every word a unique ambiguity class c_i that can be looked up in a lexicon encoded by a sequential FST. Every c_i is denoted by a single symbol, e.g. [ADJ_NOUN], although it represents a set of alternative tags that a given word can occur with. The sequence of the c_i of all words of one sentence is the input to our FST cascade. It is mapped by T1, from left to right, to a sequence of reduced…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Speech and dialogue systems · Topic Modeling
