English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In computer science, divide and conquer (D&C) is an algorithm design paradigmbased on multi-branched recursion. A D&C algorithm works by recursively andmonotonically breaking down a problem into sub problems of the same (or arelated) type, until these become simple enough to be solved directly. Thesolutions to the sub problems are then combined to give a solution to theoriginal problem. The present work identifies D&C algorithms assumed withincontemporary syntactic theory, and discusses the limits of their applicabilityin the realms of the syntax semantics and syntax morphophonology interfaces. Wewill propose that D&C algorithms, while valid for some processes, fall short onflexibility given a mixed approach to the structure of linguistic phrasemarkers. Arguments in favour of a computationally mixed approach to linguisticstructure will be presented as an alternative that offers advantages to uniformD&C approaches.

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