publication . Preprint . Conference object . 1996

An efficient compiler for weighted rewrite rules

Mehryar Mohri; Richard Sproat;
Open Access English
  • Published: 19 Jun 1996
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.
Subjects
ACM Computing Classification System: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
free text keywords: Computer Science - Computation and Language, Natural language, Speech processing, Computer science, Compiler, computer.software_genre, computer, Phonology, Theoretical computer science, Programming language
Related Organizations

Tools. Addison Wesley: Reading, MA.

Alfred V. Aho, Ravi Sethi, and Jerey D. Ullman.

1986. Compilers, Principles, Techniques and

1988. Rational Series and Their Languages.

Springer-Verlag: Berlin-New York.

Berstel and Christophe Reutenauer.

recognition in the future.

Jean

Arto

References

Acknowledgements

620

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Preprint . Conference object . 1996

An efficient compiler for weighted rewrite rules

Mehryar Mohri; Richard Sproat;