Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Mastering regular expressions
Finite-State Language Processing
Finite-State Language Processing
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
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Regular expressions for language engineering
Natural Language Engineering
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
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
The proper treatment of optimality in computational phonology: plenary talk
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
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
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Finite state methods in natural language processing
Natural Language Engineering
Finite state methods for hyphenation
Natural Language Engineering
A finite state and data-oriented method for grapheme to phoneme conversion
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A bimachine compiler for ranked tagging rules
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Efficient dictionary-based text rewriting using subsequential transducers†
Natural Language Engineering
Symbolic String Verification: An Automata-Based Approach
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
xfst2fsa: comparing two finite-state toolboxes
Software '05 Proceedings of the Workshop on Software
A new method for compiling parallel replacement rules
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Mix and match replacement rules
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
| Hi-index | 0.00 |
Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various algorithms to compile such rewrite rules into finite-state transducers. The present paper extends this work by allowing a limited form of backreferencing in such rules. The explicit use of backreferencing leads to more elegant and general solutions.