Compact Representations by Finite-State Transducers

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how to perform the corresponding minimization, and point out interesting linguistic side-effects of this operation.
5 pages,latex+5figures,to appear in Proceedings of ACL 94

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151019

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9407003
 http://arxiv.org/abs/cmp-lg/9407003

Collections

arXiv