Jeffrey Heinz | SUNY: Stony Brook University (original) (raw)

Papers by Jeffrey Heinz

Theoretical and Typological Issues

J. Lang. Model., 2020

This article describes a novel approach to the computational modeling of reduplication. Reduplica... more This article describes a novel approach to the computational modeling of reduplication. Reduplication is often treated as a stumbling block within finite-state treatments of morphology because they cannot adequately capture the productivity of unbounded copying (total reduplication) and because they cannot describe bounded copying (partial reduplication) without a large increase in the number of states. We provide a comprehensive typology of reduplicative processes and show that an understudied type of finite-state machine, 2-way deterministic finite-state transducers (2-way D-FSTs), captures virtually all of them. Furthermore, the 2-way D-FSTs have few states, are in practice easy to design and debug, and are linguistically motivated in terms of the transducer’s origin semantics or segment alignment. Most of these processes, and their corresponding 2-way D-FSTs, are available in an online database of reduplication (RedTyp). We classify these 2- way D-FSTs according to the concatena...

Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology

Proceedings of the Annual Meetings on Phonology, 2016

Page 1. Learning Long-Distance Agreement Phonotactics Jeffrey Heinz jheinz@humnet.ucla. edu Unive... more Page 1. Learning Long-Distance Agreement Phonotactics Jeffrey Heinz jheinz@humnet.ucla. edu University of California, Los Angeles The 81st meeting of the LSA Anaheim, California, 2007 1 Introduction Introduction ... University of Washington, Seattle. Heinz, Jeffrey. 2006b. ...

Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015), 2015

Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993/2004) is “in general ... more Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993/2004) is “in general computationally intractable ” on the basis of a proof adapted from Eisner (1997a). We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT) and second, the result crucially depends on a particular representation of OT grammars. We show that there is an alternative representation of OT grammars that allows for efficient computation of optimal surface forms and provides deeper insight into the sources of complexity of Optimality Theory. We conclude that it is a mistake to reject Optimality Theory on the grounds that it is computationally intractable.

ABSTRACT In this paper we address the task of automatically assigning primary stress to out-of-vo... more ABSTRACT In this paper we address the task of automatically assigning primary stress to out-of-vocabulary words in English. This work forms a necessary component in a scansion system for English poetry. We propose three different approaches based on (1) word similarity, (2) handwritten linguistic rules and (3) machine learning. The first and last approach require stress-annotated corpora to train a model for stress assignment, while the linguistic approach relies on grapheme to phoneme conversion, a syllabification procedure and hand-written stress assignment rules. An implementation of each approach is provided and the precision of the systems is compared. The linguistic approach proves to be the most effective, but the machine learning approach is not far behind. We anticipate that including part of speech information will improve the accuracy of each system. The source code of the approaches is released under the GNU GPL license.

52nd IEEE Conference on Decision and Control, 2013

ABSTRACT This paper presents a framework that integrates grammatical inference with symbolic cont... more ABSTRACT This paper presents a framework that integrates grammatical inference with symbolic control on finite-state transition systems interacting with partially unknown, adversarial, rule-governed environments. We model the interaction between a system and its environment as a two-player zero-sum game on graphs. We show that with some prior knowledge of the environment, the system can autonomously infer a game equivalent to the one actually being played and thus successively adapt its control strategy in polynomial time, and evolve its controller into one that ensures the completion of the desired task, whenever such a completion is possible.

ABSTRACT Beginning with Goldsmith (1976), the phonological tier has a long history in phonologica... more ABSTRACT Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which begin to describe such phenomena. Then this class is located within the Subregular Hierarchy (McNaughton and Papert, 1971). It is found that these languages contain the Strictly Local languages, are star-free, are incomparable with other known sub-star-free classes, and have other interesting properties.

Relation, 2009

Speakers of Kwara'ae pronounce individual words in the language in two different ways. These... more Speakers of Kwara'ae pronounce individual words in the language in two different ways. These two speech styles are related by CV metathesis; C1V1C2V2 sequences in the Citation speech style are pronounced as C1V1V2C2 sequences in the Normal speech style. Previous ...

PROCEEDINGS-NELS, 2008

Page 1. Learning Unbounded Stress Systems via Local Inference Jeff Heinz University of California... more Page 1. Learning Unbounded Stress Systems via Local Inference Jeff Heinz University of California, Los Angeles October 14, 2006 NELS 2006, University of Illinois, Urbana-Champaign 0 Page 2. Introduction I will present a tractable unsupervised batch learning ...