Computational structure of generative phonology and its relation to language comprehension

Authors:
Eric Sven Ristad
Affiliations:
MIT Artificial Intelligence Lab, Cambridge, MA
Venue:
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Year:
1990

Citing 2
Cited 1

Alternation

Journal of the ACM (JACM)
Computation: finite and infinite machines

Computation: finite and infinite machines

On bootstrapping of linguistic features for bootstrapping grammars

CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the computational complexity of phonological models as they have developed over the past twenty years. The major results are that generation and recognition are undecidable for segmental models, and that recognition is NP-hard for that portion of segmental phonology subsumed by modern autosegmental models. Formal restrictions are evaluated.