Abstract
A lot of recent work in computational phonology seeks to pinpoint the complexity of phonotactic dependencies from a formal perspective. Numerous mathematical classes have been proposed, but Graf (2017) subsumes them all under the umbrella of *interval-based strictly piecewise dependencies* (IBSP). IBSP …

# More Output

# Syntax in Phonology? C-Command over Strings

# It’s a (Sub-)Regular Conspiracy: Locality and Computation in Phonology, Morphology, Syntax, and Semantics

Abstract It is commonly believed that phonology, morphology, syntax, and semantics are distinct modules of language, governed by very different principles with little common ground. Nonetheless several approaches (e.g. Government Phonology, Distributed Morphology) subscribe to the idea that at least some of …

# Fragments of First-Order Logic for Linguistic Structures

Abstract Logic has always played a central role in the study of natural language meaning. But logic can also be used to describe the structure of words and sentences. Recent research has revealed that these structures are so simple that they can be …

# Computational Parallels Across Language Modules

Abstract Linguists study a variety of aspects of language, including phonology, morphology, and syntax. It is commonly believed that those are distinct modules of language, governed by very different principles and consequently studied with very different tools. While there have been attempts at …

# A Computational Guide to the Dichotomy of Features and Constraints

Abstract A contentious issue in the Minimalist literature is whether certain phenomena are best described in terms of features or constraints. Building on recent work in mathematical linguistics, I argue that constraints and features are interchangeable in Minimalist syntax. This does not invalidate …

# Computational Lessons from and for Language

Abstract Barely any task is more challenging and more effortlessly carried out by humans than the efficient use of language. Within a couple of years, children figure out a learning problem that even computers with large, extensively annotated training sets fail at. On …

# Adjuncts, Conjuncts, Ojuncts: Deriving Strong Island Constraints

Abstract Adjuncts differ from arguments by a number of properties, in particular i) optionality and ii) their island status, which renders them opaque for extraction of subconstituents. Conjuncts, too, are optional and forbid extraction. Starting from this basic observation, I demonstrate that islandhood …

# Formal Processing Theory, or Parsing Without Parsers

Abstract I argue that computational parsing research so far has operated at the wrong level(s) of granularity and that we should take a hint from formal language theory instead. Rather than compare the predictions of specific parsing models for specific phenomena, we …

# A Hidden Consensus: Computational Invariants of Minimalist Syntax

Abstract A common sentiment among linguists is that the Minimalist literature features a dazzling array of competing proposals that seem to share little common ground in their technical assumptions. While differences certainly do exist between accounts, a computationally informed perspective reveals a set …

# A Computational Guide to the Dichotomy of Features and Constraints

Abstract I draw on various result from mathematical linguistics to argue that feature-based accounts and constraint-based ones should not be viewed as competing with each other but rather as complementing each other. In particular, recent results on Minimalist grammars show that features and …

# Dependencies in Syntax and Phonology: A Computational Comparison

# Adjuncts, Islands, Algebra (with a Sprinkling of Semantics)

# Beyond the Apparent: Cognitive Parallels Between Syntax and Phonology

Abstract One of the central changes in 20th century linguistics was the reconceptualization of language as a cognitive ability rather than merely an abstract relational system of signs —- in the terminology of Chomsky (1986), the move from E-language to I-language. This shift entails …

# Optionality Implies Islandhood

# Islands Without Islands

# Computational Computational Linguistics

# Local and Transderivational Constraints in Syntax and Semantics

Abstract A long-standing tension in Minimalist syntax is that between the structure-building operations Merge and Move on the one hand and the constraints restricting the shape of the structures built by said operations on the other. Proposals differ vastly in how much weight …

# The Syntactic Algebra of Adjuncts

Abstract This paper gives a theory-neutral account of the Adjunct Island Constraint. I show that the island status of adjuncts is a consequence of two properties that set them apart from arguments: optionality and independence. Adjuncts can be omitted without affecting grammaticality, and …

# The Syntactic Algebra of Adjuncts

Abstract I argue that the special behavior of adjuncts is a consequence of two properties that set them apart from arguments: optionality and independence.

**Optionality**Adjuncts can be omitted.**Independence**Independently well-formed adjuncts can be combined.

These properties yield several grammaticality inferences that …

# The Price of Freedom: Why Adjuncts Are Islands

Abstract I propose that if one takes seriously the Minimalist idea that syntax is driven by Merge and the feature calculus, the status of adjuncts as strong islands follows immediately from the properties that set them apart from arguments: optionality and iterability. This …

# Constraints Emerge from Merge

# Concealed Reference-Set Computation: How Syntax Escapes the Parser’s Clutches

Abstract It has been conjectured that all properties of language beyond recursion can be motivated by interface requirements. One component in this setup is the parser, which is thought to give rise to a preference for computational parsimony. I discuss a mathematical result …

# Optimality Is Not a Race: Against a Performance-Based View of Reference-Set Computation

Abstract Reference-set constraints (RCs; also known as transderivational constraints) differ from standard well-formedness conditions in that for every tree, they compute a set of output candidates called its

*reference set*and pick from said set the optimal candidate(s) according to some economy …# Lost in Translation: A Formal Model of Merge-over-Move and Its Implications for the Language Faculty

Abstract I demonstrate that Merge-over-Move (MOM), a transderivational constraint (TC) put forward in Chomsky (1995, 2000), can be modeled by

*linear tree transducers*, i.e.\ machines that take a tree as input and traverse it from the leaves towards the root while at …# Concealed Reference-Set Computation or How Syntax Escapes the Parser’s Clutches

Abstract A core assumption of the biolinguistic program is that all properties of language beyond recursion can be motivated by requirements imposed by other cognitive modules. One component in this setup is the parser, which is thought to give rise to a preference …

# A Tree Transducer Model of Reference-Set Computation

Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …