Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Natural Language Processing and Digital Libraries
Information Extraction: Towards Scalable, Adaptable Systems
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
Applications of Finite-State Transducers in Natural Language Processing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Is this Finite-State Transducer Sequentiable?
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
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
Regular expressions for language engineering
Natural Language Engineering
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Finite state transducers approximating Hidden Markov Models
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
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
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
Theoretical Computer Science - Implementation and application automata
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Formal description of multi-word lexemes with the finite-state formalism IDAREX
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A Generic Finite State Compiler for Tagging Rules
Machine Translation
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Journal of Functional Programming
Symbolic String Verification: An Automata-Based Approach
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Natural Language Engineering
Finite-State Technology as a Programming Environment
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
The Kleene Language for Weighted Finite-State Programming
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Proper Noun Recognition and Classification Using Weighted Finite State Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Optimality Theory and Vector Semirings
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Look-back and look-ahead in the conversion of Hidden Markov Models into finite state transducers
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
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
Arabic morphology using only finite-state operations
Semitic '98 Proceedings of the Workshop on Computational Approaches to Semitic Languages
The Karamel system and semitic languages: structured multi-tiered morphology
Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
xfst2fsa: comparing two finite-state toolboxes
Software '05 Proceedings of the Workshop on Software
A modern computational linguistics course using Dutch
ELST '99 Proceedings of the Workshop on Computer and Internet Supported Education in Language and Speech Technology
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Multi-word expression recognition integrated with two-level finite state transducer
HCI'07 Proceedings of the 12th international conference on Human-computer interaction: intelligent multimodal interaction environments
A new method for compiling parallel replacement rules
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
fsm2 - a scripting language interpreter for manipulating weighted finite-state automata
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Multi-tape automata with symbol classes
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
FTrace: a tool for finite-state morphology
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
This paper introduces to the calculus of regular expressions a replace operator and defines a set of replacement expressions that concisely encode alternate variations of the operation. Replace expressions denote regular relations, defined in terms of other regular expression operators. The basic case is unconditional obligatory replacement. We develop several versions of conditional replacement that allow the operation to be constrained by context.