Regular Expressions and Predicate Logic in Finite-State Language Processing

Authors:
Mans Hulden
Affiliations:
University of Arizona
Venue:
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Year:
2009

Citing 7
Cited 5

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Logical specification of regular relations for NLP

Natural Language Engineering
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
Parallel replacement in finite state calculus

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Describing syntax with star-free regular expressions

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
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

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
Revisiting multi-tape automata for semitic morphological analysis and generation

Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
Finite-state methods and models in natural language processing

Natural Language Engineering
Learning word-level dialectal variation as phonological replacement rules using a limited parallel corpus

DIALECTS '11 Proceedings of the First Workshop on Algorithms and Resources for Modelling of Dialects and Language Varieties
Compiling simple context restrictions with nondeterministic automata

FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an extension to the formalism of regular expressions with a form of predicate logic where quantified propositions apply to substrings. The implementation hinges crucially on the manipulation of auxiliary symbols which has been a common, though previously unsystematized practice in finite-state language processing. We also apply the notation to give alternate compilation methods for two-level grammars and various types of replacement rules found in the literature, and show that, under a certain interpretation, two-level rules and many types of replacement rules are equivalent.