Formal parameters of phonology: from government phonology to SPE

Authors:
Thomas Graf
Affiliations:
Department of Linguistics, University of California, Los Angeles
Venue:
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Year:
2008

Citing 13
Cited 0

A temporal fixpoint calculus

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressive power of temporal logic for infinite words

Theoretical Computer Science
Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Modal logic

Modal logic
Strict LT2: Regular : : Local : Recognizable

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
First-Order Logic with Two Variables and Unary Temporal

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Optimality theory and the generative complexity of constraint violability

Computational Linguistics
Logical specification of regular relations for NLP

Natural Language Engineering
A model-theoretic framework for theories of syntax

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
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Regular linear temporal logic

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by the model-theoretic approach to phonology deployed by Kracht [25] and Potts and Pullum [32], I develop an extendable modal logic for the investigation of phonological theories operating on (richly annotated) string structures. In contrast to previous research in this vein [17, 31, 37], I ultimately strive to study the entire class of such theories rather than merely one particular incarnation thereof. To this end, I first provide a formalization of classic Government Phonology in a restricted variant of temporal logic, whose generative capacity is then subsequently increased by the addition of further operators, thereby pushing it up the subregular hierarchy until one reaches the level of the regular stringsets. I identify several other axes along which Government Phonology might be generalized, moving us towards a parametric metatheory of phonology.