Paper

A Logical and Computational Methodology for Exploring Systems of Phonotactic Constraints

Authors
  • Dakotah Lambert (Earlham College)
  • James Rogers (Earlham College)

Abstract

We introduce a methodology built around a logical analysis component based on a hierarchy of classes of Subregular constraints characterized by the kinds of features of a string a mechanism must be sensitive to in order to determine whether it satisfies the constraint, and a computational component built around a publicly-available interactive workbench that implements, based on the equivalence between logical formulae and finite-state automata, a theorem prover for these logics (even algorithmically extracting certain classes of constraints), wherein the alternation between these logical and computational analyses can provide useful insight more easily than using either in isolation.

Keywords: model-theoretic phonotactics, computational phonology, formal logic, automata, lexical stress

How to Cite:

Lambert, D. & Rogers, J., (2019) “A Logical and Computational Methodology for Exploring Systems of Phonotactic Constraints”, Society for Computation in Linguistics 2(1), 247-256. doi: https://doi.org/10.7275/t0dv-9t05

Downloads:
Download PDF

127 Views

35 Downloads

Published on
01 Jan 2019