Use of Weighted Finite State Transducers in Part of Speech Tagging

Simple item page
dc.creatorTzoukermann, Evelyne
dc.creatorRadev, Dragomir R.
dc.date1997-10-10
dc.date.accessioned2026-07-07T02:36:05Z
dc.date.available2026-07-07T02:36:05Z
dc.descriptionThis paper addresses issues in part of speech disambiguation using finite-state transducers and presents two main contributions to the field. One of them is the use of finite-state machines for part of speech tagging. Linguistic and statistical information is represented in terms of weights on transitions in weighted finite-state transducers. Another contribution is the successful combination of techniques -- linguistic and statistical -- for word disambiguation, compounded with the notion of word classes.
dc.descriptionuses psfig, ipamacs
dc.identifierhttps://arxiv.org/abs/cmp-lg/9710001
dc.identifierhttp://arxiv.org/abs/cmp-lg/9710001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/15791
dc.subjectComputation and Language
dc.titleUse of Weighted Finite State Transducers in Part of Speech Tagging
dc.typetext

Files

Collections

arXiv