Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
Automata, Languages, and Machines
Automata, Languages, and Machines
The Use of Finite Automata in the Lexical Representaion of Natural Language
Proceedings of the LITP Spring School on Theoretical Computer Science: Electronic Dictionaries and Automata in Computational Linguistics
Tagging French: comparing a statistical and a constraint-based method
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Constructing lexical transducers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Parallel replacement in finite state calculus
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
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
Detecting emerging concepts in textual data mining
Computational information retrieval
Finite state methods in natural language processing
Natural Language Engineering
Robustness beyond shallowness: incremental deep parsing
Natural Language Engineering
Incremental finite-state parsing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Natural Language Engineering
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
Efficient dictionary-based text rewriting using subsequential transducers†
Natural Language Engineering
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
Regular Expressions and Predicate Logic in Finite-State Language Processing
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
A multilingual natural-language interface to regular expressions
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Implementing voting constraints with finite state transducers
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
xfst2fsa: comparing two finite-state toolboxes
Software '05 Proceedings of the Workshop on Software
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
Mix and match replacement rules
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
This paper introduces to the finite-state calculus a family of directed replace operators. In contrast to the simple replace expression, UPPER ← LOWER, defined in Karttunen (1995), the new directed version, UPPER @← LOWER, yields an unambiguous transducer if the lower language consists of a single string. It transduces the input string from left to right, making only the longest possible replacement at each point.A new type of replacement expression, UPPER @← PREFIX ... SUFFIX, yields a transducer that inserts text around strings that are instances of UPPER. The symbol ... denotes the matching part of the input which itself remains unchanged. PREFIX and SUFFIX are regular expressions describing the insertions.Expressions of the type UPPER @← PREFIX ... SUFFIX may be used to compose a deterministic parser for a "local grammar" in the sense of Gross (1989). Other useful applications of directed replacement include tokenization and filtering of text streams.