Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 204-209 |
| Number of pages | 6 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1994-June |
| State | Published - 1994 |
| Event | 32nd Annual Meeting of the Association for Computational Linguistics, ACL 1994 - Las Cruces, United States Duration: Jun 27 1994 → Jun 30 1994 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics