Compiling Regular Formalisms with Rule Features into Finite-State Automata

@inproceedings{Kiraz1997CompilingRF,
  title={Compiling Regular Formalisms with Rule Features into Finite-State Automata},
  author={George Anton Kiraz},
  booktitle={ACL},
  year={1997}
}
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of rules. This general notion can also be applied to other algorithms which compile regular rewrite rules into au-tomata. 1 Introduction The past few years have witnessed an increased interest in applying finite-state methods to language and speech problems. This in turn generated interest in devising algorithms for… CONTINUE READING
5 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Syriac morphology: From a lin

  • G. Kiraz
  • 1996
2 Excerpts

Introduction to Syriac Spirantiza

  • G. Kiraz
  • 1995
2 Excerpts

On some applications of nite-state

  • M. Mohri
  • 1994
2 Excerpts

Morphology with two-level rules and

  • J. Bear
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…