Causatives as complex predicates without the restriction operator

This paper addresses a significant theoretical issue in Lexical-Functional Grammar (LFG) regarding the analysis of complex predicates, specifically causative constructions. In the standard LFG framework, the modification of PRED attributes in f-structures is not permitted, which has led previous researchers to adopt the “restriction operator” introduced by Kaplan and Wedekind (1993) as a workaround.
While this approach has been applied to various linguistic phenomena across different languages, including Turkish causatives (Çetinoglu et al., 2008), we argue that it compromises one of LFG’s core strengths: monotonicity. The restriction operator, though functional, breaks the monotonicity of the LFG architecture that Bresnan (2001) identifies as a fundamental advantage of the formalism.
Our paper presents an alternative solution that preserves monotonicity while effectively modeling causative constructions. Instead of relying on the restriction operator, we develop an approach based on equational unification. This solution maintains the theoretical integrity of LFG while offering a more elegant treatment of complex predicates.
The proposed model has implications beyond causatives, potentially extending to other complex predicate phenomena across languages, and contributes to the ongoing refinement of formal linguistic theory.