Computer Science – Computation and Language
Scientific paper
1994-07-04
Computer Science
Computation and Language
5 pages,latex+5figures,to appear in Proceedings of ACL 94
Scientific paper
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.
No associations
LandOfFree
Compact Representations by Finite-State Transducers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compact Representations by Finite-State Transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact Representations by Finite-State Transducers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-615699