The paper proposes a correspondence principle to unify PSG, DG, and CG into one representation and claims this lowers computational complexity, but the complexity argument is invalid.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Unified Representation for Continuity and Discontinuity: Syntactic and Computational Motivations
The paper proposes a correspondence principle to unify PSG, DG, and CG into one representation and claims this lowers computational complexity, but the complexity argument is invalid.