Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Multi-tape Automata for Speech and Language Systems: A Prolog Implementation
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
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
Treatment of ε-moves in subset construction
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
A modern computational linguistics course using Dutch
ELST '99 Proceedings of the Workshop on Computer and Internet Supported Education in Language and Speech Technology
Applications of Finite-State Transducers in Natural Language Processing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
A System for Recognition of Named Entities in Greek
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Extended Sequentialization of Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Bootstrapping morphological analyzers by combining human elicitation and machine learning
Computational Linguistics
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Parameter estimation for probabilistic finite-state transducers
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Computational Linguistics
Finite-State Registered Automata for Non-Concatenative Morphology
Computational Linguistics
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
CLARIN and Free Open Source Finite-State Tools
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
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
Learning compound decision functions for sequential data in dialog with experts
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Automatic image description based on textual data
Journal on Data Semantics VII
Book review: finite state morphology
Computational Linguistics
Learning regular expressions to template-based FAQ retrieval systems
Knowledge-Based Systems
| Hi-index | 0.00 |
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP).As Kaplan and Kay [12] have argued, regular expressions are the appropriate level of abstraction for thinking about finite-state languages and finite-state relations.More complex finite-state operations (such as contexted replacement) are defined on the basis of basic operations (such as Kleene closure, complementation, composition).In order to be able to experiment with such complex finite-state operations the FSA Utilities (version 5) provides an extendible regular expression compiler.The paper discusses the regular expression operations provided by the compiler, and the possibilities to create new regular expression operators.The benefits of such an extendible regular expression compiler are illustrated with a number of examples taken from recent publications in the area of finite-state approaches to NLP.