Hostname: page-component-89b8bd64d-dvtzq Total loading time: 0 Render date: 2026-05-06T15:09:44.714Z Has data issue: false hasContentIssue false

Computational Universals in Linguistic Theory: Using Recursive Programs for Phonological Analysis

Published online by Cambridge University Press:  01 January 2026

Jane Chandlee*
Affiliation:
Haverford College
Adam Jardine*
Affiliation:
Rutgers University

Abstract

This article presents BOOLEAN MONADIC RECURSIVE SCHEMES (BMRSs), adapted from the mathematical study of computation, as a phonological theory that both explains the observed computational properties of phonological patterns and directly captures phonological substance and linguistically significant generalizations. BMRSs consist of structures defined as logical predicates and situated in an ‘if ... then ... else’ syntax in such a way that they variably license or block the features that surface in particular contexts. Three case studies are presented to demonstrate how these grammars (i) express conflicting pressures in a language, (ii) naturally derive elsewhere condition effects, and (iii) capture typologies of repairs for marked structures.

Information

Type
Research Article
Copyright
Copyright © 2021 Linguistic Society of America

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable