Compiling regular formalisms with rule features into finite-state automata

Authors:
George Anton Kiraz
Affiliations:
Bell Laboratories, Lucent Technologies, Murray Hill, NJ
Venue:
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Year:
1997

Citing 7
Cited 3

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers

Computational Linguistics
Computational nonlinear morphology: with emphasis on semitic languages

Computational nonlinear morphology: with emphasis on semitic languages
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
An efficient compiler for weighted rewrite rules

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Morphology with two-level rules and negative rule features

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Compiling a partition-based two-level formalism

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic

Computational Linguistics - Special issue on finite-state methods in NLP
Morphology in Machine Translation Systems: Efficient Integration of Finite State Transducers and Feature Structure Descriptions

Machine Translation
Efficient finite state unification morphology

COLING '04 Proceedings of the 20th international conference on Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 automata.