Abstract
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorithms. Further, many of our applications demand the ability to compile weighted rules into weighted FSTs, transducers generalized by providing transitions with weights. We have extended the algorithm to allow for this.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 231-238 |
| Number of pages | 8 |
| Journal | Proceedings of the Annual Meeting of the Association for Computational Linguistics |
| Volume | 1996-June |
| State | Published - 1996 |
| Event | 34th Annual Meeting of the Association for Computational Linguistics, ACL 1996 - Santa Cruz, United States Duration: Jun 24 1996 → Jun 27 1996 |
ASJC Scopus subject areas
- Computer Science Applications
- Linguistics and Language
- Language and Linguistics