Optimizing over subsequences generates context-sensitive languages | Zendy

Andrew Lamont | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimizing over subsequences generates context-sensitive languages

Author(s) -

Andrew Lamont

Publication year - 2021

Publication title -

transactions of the association for computational linguistics

Language(s) - English

Resource type - Journals

ISSN - 2307-387X

DOI - 10.1162/tacl_a_00382

Subject(s) - optimality theory , generative grammar , phonology , context (archaeology) , computer science , finite state , state (computer science) , linguistics , characterization (materials science) , natural language processing , artificial intelligence , algorithm , machine learning , history , philosophy , archaeology , materials science , markov chain , nanotechnology

Phonological generalizations are finite-state. While Optimality Theory is a popular framework for modeling phonology, it is known to generate non-finite-state mappings and languages. This paper demonstrates that Optimality Theory is capable of generating non-context-free languages, contributing to the characterization of its generative capacity. This is achieved with minimal modification to the theory as it is standardly employed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research