Strict Locality and Phonological Maps

2018 ◽  
Vol 49 (1) ◽  
pp. 23-60 ◽  
Author(s):  
Jane Chandlee ◽  
Jeffrey Heinz
Keyword(s):  
Formal Languages ◽  
Local Functions ◽  
Strict Locality ◽  
Computational Property ◽  
Computational Properties

In this article, we identify Strict Locality as a strong computational property of a certain class of phonological maps from underlying to surface forms. We show that these maps can be modeled with Input Strictly Local functions, a previously undefined class of subregular relations. These functions extend the conception of locality from the Strictly Local formal languages (recognizers/acceptors) ( McNaughton and Papert 1971 , Rogers and Pullum 2011 , Rogers et al. 2013 ) to maps (transducers/functions) and therefore formalize the notion of phonological locality. We discuss the insights such computational properties provide for phonological theory, typology, and learning.

scholarly journals The Strict Locality of Phonological Processes

2014 ◽  
Author(s):  
Jane Chandlee
Keyword(s):  
Formal Languages ◽  
Surface Representation ◽  
Phonological Processes ◽  
Phonological Learning ◽  
Empirical Coverage ◽  
Computational Perspective ◽  
Strict Locality ◽  
Computational Property ◽  
Computational Properties

<p>This paper addresses the question of ‘what is a possible phonological <span>process’ from a computational perspective. Many previous studies have offered explanations </span>for why certain processes are attested and/or common while others are unattested or rare <span>(see Hume &amp; Johnson 2001, Hayes et al. 2004, Blevins 2004, among others). Following work on phonotactics by Heinz (2007, 2009, 2010), the goal of the present study is to demonstrate </span>the extent to which computational properties can distinguish the subset of what is phonologically possible from the larger set of logically possible processes. <span>Specifically, I identify a strong computational property of the mapping from underlying </span>representation (UR) to surface representation (SR) in local phonological processes. This property is called Input Strict Locality (ISL) after the well-studied Strictly Local formal languages (McNaughton &amp; Papert 1971, Rogers &amp; Pullum 2011, Rogers et al. 2013). I demonstrate <span>that this property has broad empirical coverage and describe its </span>utility in phonological learning.</p>

scholarly journals Learning Phonological Mappings by Learning Strictly Local Functions

2014 ◽  
Vol 1 (1) ◽  
Author(s):  
Jane Chandlee ◽  
Adam Jardine
Keyword(s):  
Learning Algorithm ◽  
Formal Languages ◽  
Proper Subset ◽  
Input Output ◽  
Phonological Processes ◽  
Local Functions ◽  
Output Mapping ◽  
Strict Locality ◽  
Computational Property ◽  
Theoretic Characterization

<p>In this paper we identify strict locality as a defining computational property of the input-output mapping that underlies local phonological processes. We provide an automata-theoretic characterization for the class of Strictly Local functions, which are based on the well-studied Strictly Local formal languages (McNaughton &amp; Papert 1971; Rogers &amp; Pullum 2011; Rogers et al. 2013), and show how they can model a range of phonological processes. We then present a learning algorithm, the SLFLA, which uses the defining property of strict locality as an inductive principle to learn these mappings from finite data. The algorithm is a modification of an algorithm developed by Oncina et al. (1993) (called OSTIA) for learning the class of subsequential functions, of which the SL functions are a proper subset. We provide a proof that the SLFLA learns the class of SL functions and discuss these results alongside previous studies on using OSTIA to learn phonological mappings (Gildea and Jurafsky 1996).</p>

Bipolar Abstract Argumentation with Dual Attacks and Supports

2020 ◽  
Author(s):  
Nico Potyka
Keyword(s):  
Computational Complexity ◽  
Decision Problems ◽  
Abstract Argumentation ◽  
Stable Semantics ◽  
Support Relations ◽  
Support Relationships ◽  
Computational Properties ◽  
Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Languages Accepted by Weighted Restarting Automata*

2021 ◽  
Vol 180 (1-2) ◽  
pp. 151-177
Author(s):  
Qichao Wang
Keyword(s):  
General Class ◽  
Formal Languages ◽  
Input Word ◽  
Additional Requirement ◽  
Tropical Semiring

Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. In earlier works we studied the classes of functions and relations that are computed by weighted restarting automata. Here we use them to define classes of formal languages by restricting the weight associated to a given input word through an additional requirement. In this way, weighted restarting automata can be used as language acceptors. First, we show that by using the notion of acceptance relative to the tropical semiring, we can avoid the use of auxiliary symbols. Furthermore, a certain type of word-weighted restarting automata turns out to be equivalent to non-forgetting restarting automata, and another class of languages accepted by word-weighted restarting automata is shown to be closed under the operation of intersection. This is the first result that shows that a class of languages defined in terms of a quite general class of restarting automata is closed under intersection. Finally, we prove that the restarting automata that are allowed to use auxiliary symbols in a rewrite step, and to keep on reading after performing a rewrite step can be simulated by regular-weighted restarting automata that cannot do this.

A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó
Keyword(s):  
Formal Languages ◽  
Parallel Program ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Concurrent System ◽  
Closure Properties ◽  
Sequential Program ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Independence Relations

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.

Sign in / Sign up

Export Citation Format

Share Document