Mix and match replacement rules

Authors:
Dale Gerdemann
Affiliations:
Universität Tübingen, Tübingen, Germany
Venue:
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Year:
2009

Citing 8
Cited 0

Rational equivalence relations

Theoretical Computer Science
Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Optimality theory and the generative complexity of constraint violability

Computational Linguistics
Transducers from rewrite rules with backreferences

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Directed replacement

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Foma: a finite-state compiler and library

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session

Quantified Score

Hi-index	0.00

Visualization

Abstract

A flexible construction kit is presented compiling various forms of finite state replacement rules. The approach is simpler and more declarative than algorithms in the tradition of Kaplan & Kay. Simple constraints can be combined to achieve complex effects, including effects based on Optimality Theory.