Divide and...conquer? On the limits of algorithmic approaches to syntactic semantic structure

TL;DR

This paper critically examines the application of divide and conquer algorithms in syntactic and semantic linguistic theories, highlighting their limitations and proposing a mixed approach for better flexibility in linguistic structures.

Contribution

It identifies the limits of D&C algorithms in linguistic interfaces and advocates for a computationally mixed approach as a more effective alternative.

Findings

D&C algorithms are limited in handling complex linguistic interfaces.

A mixed computational approach offers greater flexibility for linguistic structures.

The paper challenges the universality of D&C in syntax and semantics.

Abstract

In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A D&C algorithm works by recursively and monotonically breaking down a problem into sub problems of the same (or a related) type, until these become simple enough to be solved directly. The solutions to the sub problems are then combined to give a solution to the original problem. The present work identifies D&C algorithms assumed within contemporary syntactic theory, and discusses the limits of their applicability in the realms of the syntax semantics and syntax morphophonology interfaces. We will propose that D&C algorithms, while valid for some processes, fall short on flexibility given a mixed approach to the structure of linguistic phrase markers. Arguments in favour of a computationally mixed approach to linguistic structure will be presented as an alternative that offers advantages to uniform D&C approaches.