{"id":"afb494dc-3201-414a-8677-f44faf53dbda","arxiv_id":"2506.05235","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"A correspondence principle is claimed to unify phrase structure, dependency, and categorial grammar representations for continuous and discontinuous syntax, but the equivalence is asserted rather than proven.","lead":"A linguistics preprint claims a single mathematical representation can unify three grammar formalisms for both continuous and discontinuous sentence structures. The paper's key equivalence rule is assumed rather than derived, and the three worked examples do not establish the claimed unification.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Correspondence Principle is not a well-defined equivalence: in the exceptional steps B (or A) denotes different words on the two sides, so the DG↔CG conversions are vacuous.","rationale":"The reader's weakest assumption identifies exactly the load-bearing flaw: the Correspondence Principle is stipulated, not derived, and in exceptional steps the variables denote different words on the two sides, making the equivalence vacuous. My analysis confirms this with the specific Croatian Step 3 and Kalkatungu Steps 2, 4, and 5, where the equation relates distinct word pairs. This is not merely an incompleteness or a need for more examples; it is a fundamental failure of the claimed equivalence. If the principle were corrected to require identical words on both sides, the Croatian and Kalkatungu derivations would not go through, and the DG graphs could not be recovered from the CG derivations. If instead the variable-swapping is allowed without further constraints, then the principle can match any functor-argument pair to any dependency pair sharing a category, trivializing the unification and rendering the conclusion PSG≡CG≡DG unsupported. The paper also leaves ≡ undefined and relies on anonymous references for the principle, but the decisive issue is the internal inconsistency in how the principle is applied. Therefore the reader's verdict of REJECT is appropriate; the central claim is not established by the presented derivations.","tokens_in":27297,"tokens_out":2696,"duration_ms":32922,"concrete_test":"Formalize the Correspondence Principle in a small typed calculus with explicit word tokens, and check each claimed equivalence for variable consistency. For Croatian Step 3, instantiate the principle with A=je, LHS B=učionica, RHS B=Naša; the equation Aux(*N) ≡ Det\\Aux should be rejected because it is not an instance of A(B*) ∨ A(*B) ≡ A|B for any single B. More generally, write a script that parses the equivalences in (11c) and (12c) and verifies that the word denoted by the dependent on the LHS equals the word denoted by the argument on the RHS (and similarly for heads/functors). If any step violates this identity condition, the derivation is invalid under the stated principle.","verdict_should_be":"REJECT","load_bearing_attack":"The central claim that PSG→CG, DG→CG, CG→DG, and CG→PSG establish PSG≡CG≡DG rests entirely on the Correspondence Principle in Section 6: A(B*) ∨ A(*B) ≡ A|B. As stated, this requires the same words A and B on both sides. Yet the paper explicitly permits 'exceptional cases' where only one of A or B is the same and the other varies (Section 6, after the principle). This variable-swapping is used in exactly the steps needed to make the derivations balance. For Croatian Step 3 (11c), the RHS functor-argument relation is between je (Aux) and Naša (Det), giving Det\\Aux, while the LHS dependency is between je (Aux) and učionica (N), giving Aux(*N). The principle as written cannot license an equation whose left B is učionica and right B is Naša. Likewise, Kalkatungu Step 2 equates V(*N2) with V/Det2, where the LHS dependent is ṯuar-Ø but the RHS argument is maḻṯa-Ø; Step 4 equates N1(Det1*) with Det1/Adj, where the LHS head is kuḷa-ji but the RHS functor's argument is japacara-tu; Step 5 equates V(N1*) with Det1\\V, where the LHS dependent is kuḷa-ji but the RHS argument is Ṉa-ci. Once variables may denote different words on the two sides, the equivalence sign ≡ is not a relation between the same two linguistic objects; it becomes a license to pair any dependency relation with any functor-argument relation that shares one category. No formal semantics for ≡ is provided, and no restriction is given on which variable substitutions are admissible. Consequently, the conversions do not establish a substantive equivalence; they only show that the author can stipulate a correspondence for each step. The German example (10) works because all functor-argument pairs coincide with head-dependent pairs, but the Croatian and Kalkatungu examples reveal that the principle is doing no formal work: it is a stipulation that any CG cancellation can be reinterpreted as any DG dependency sharing a category.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper argues that phrase structure, dependency, and categorial analyses of continuous and discontinuous syntax can be unified into one representational system. It reviews evidence for discontinuous constituents, compares Phrase Structure Grammar (PSG), Dependency Grammar (DG), and Categorial Grammar (CG), and then proposes a \"Correspondence Principle\" A(B*) ∨ A(*B) ≡ A|B that equates head-dependent relations with functor-argument relations. Using this principle, the paper gives bidirectional conversions among PSG, DG, and CG for one German, one Croatian, and one Kalkatungu sentence, and concludes that these conversions establish PSG≡CG≡DG.","tokens_in":27669,"tokens_out":7292,"duration_ms":86362,"significance":"If the equivalence were established, the paper would offer a significant unification: constituency, dependency, and categorial representations would be notational variants, and discontinuity would become a natural consequence rather than an anomaly. The paper is also useful as a survey of existing treatments of discontinuity, including tangled trees, Parallel Merge, LFG, phenogrammatical structure, and dependency constituents, and it makes its intended conversion steps concrete and checkable for three typologically distinct languages. Those strengths are real. However, the load-bearing Correspondence Principle is stipulated rather than derived, it is not well-defined under the \"exceptional cases\" admitted in Section 6, and the three worked examples do not amount to a proof of general equivalence. The current manuscript therefore does not establish the advertised unification.","major_comments":[{"comment":"The asserted equivalence A(B*) ∨ A(*B) ≡ A|B is not well-defined because the variables A and B are allowed to denote different words on the two sides. In (11c) Step 3, the LHS Aux(*N) instantiates B=učionica while the RHS Det\\Aux instantiates B=Naša; in (12c) Step 2, B is ṯuar-Ø on the LHS and maḻṯa-Ø on the RHS; and in (12c) Step 4 both A and B change, with A=japacara-tu on the RHS but A=kuḷa-ji on the LHS. The paper explicitly licenses these \"exceptional cases\" immediately after stating the principle, but it gives no formal semantics for ≡ and no restriction on admissible substitutions. Under this licensing, the sign can equate any dependency pair with any functor-argument pair that shares one category, so the DG↔CG derivations are vacuous. Footnote 5's claim that the principle \"filters out\" unwanted relations is also untenable under this reading.","section":"Section 6, Correspondence Principle, and (11c) Step 3 / (12c) Steps 2, 4, 5"},{"comment":"The DG↔CG conversions are circular with respect to the claim of unification: each conversion step applies exactly the Correspondence Principle that is the target of the proof. For example, (12b) says \"by using the correspondence principle, we have that ḻaji(*ṯuar-Ø) ≡ ḻaji/maḻṯa-Ø,\" and (11b) says the same for Aux(*N) ≡ Det\\Aux. Since the principle itself already asserts the equivalence between head-dependent and functor-argument relations, these steps cannot count as independent derivations of that equivalence; they are instances of it.","section":"Section 6, (10c)-(10d) and (11b)-(12b)"},{"comment":"The PSG↔CG conversions are not formal translations. In the PSG→CG direction, CG categories are assigned to terminal nodes by hand and cancellation lines are drawn through a pre-existing PSG tree; in the CG→PSG direction, a PSG tree is inferred from each CG cancellation. No rule is given that maps arbitrary PSG rules or arbitrary CG categories onto one another, and the choice of lexical category assignments is unconstrained (for example, maḻṯa-Ø is assigned Det2 in (12) without a procedure for deriving this assignment). The three sentences therefore illustrate parallel annotation, but they do not establish an equivalence between the two formalisms.","section":"Section 6, (10a), (11a), (12a) and the CG → PSG subsections"},{"comment":"The claim that \"establishing PSG->CG, DG->CG, CG->DG and CG->PSG is tantamount to establishing PSG≡CG≡DG\" overgeneralizes from the three sentences (10)–(12). Even if each derivation were internally valid, no inductive, constructive, or formal proof shows that the conversions hold for all, or even for a characterized class of, continuous and discontinuous constructions. At most, the paper gives existence illustrations for three data points.","section":"Section 6, final paragraph, and Section 7"}],"minor_comments":[{"comment":"There is a typo \"a a one-to-one mapping\"; the duplicated article should be deleted.","section":"Section 5, paragraph on Baker's UTAH"},{"comment":"The formal definition ends with \"(see also.\" followed by nothing; this incomplete citation should be completed or removed.","section":"Section 4.2, formal definition of DG"},{"comment":"The page range \"154–15\" should be \"154–155.\"","section":"Section 6, footnote 6"},{"comment":"The text cites \"Anonymous 2014\" and, in Section 6, \"Anonymous 2022, Anonymous 2023, Anonymous 2024,\" but none of these works appears in the reference list; since the Correspondence Principle is attributed to the latter three, this is not merely a formatting issue.","section":"References and Section 2"},{"comment":"The text says that crossing lines are drawn in standard PSG trees for expository purposes, but standard PSG trees prohibit crossing branches; the figures should be labeled as expository/tangled trees or the convention should be clarified in the caption.","section":"Section 6, Figures 16 and 25"},{"comment":"Footnote 7 says \"the author in the original source\" without identifying who that author is; it should name Van Valin 2001.","section":"Section 6, (12), footnote 7"}],"recommendation":"reject","confidential_remarks":"Confidential to the editor: the paper's central formal device is attributed to \"Anonymous 2022, Anonymous 2023, Anonymous 2024,\" none of which is listed in the references. This is a provenance and verifiability problem independent of my technical assessment, and the editor may wish to determine whether these are anonymous self-citations under a double-blind policy. My recommendation to reject rests primarily on the technical grounds in the report: the equivalence relation is not well-defined under the paper's own exceptional cases, and the derivations are applications rather than proofs of the principle."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe headline: this paper has a genuinely useful survey of approaches to syntactic discontinuity, but its central claim—that PSG, DG, and CG are one representational system—rests on a principle that can equate almost anything with anything. I don't think the formal result stands.\n\nWhat's new and good: Section 5 reviews Austin & Bresnan's LFG treatment, Dowty's phenogrammar, McCawley's tangled trees, Citko's parallel merge, and Barry & Pickering's dependency constituents. That survey is clear, accurate enough, and will be a handy reference for students. The German example (10) actually works: in every CG cancellation, the functor-argument pair coincides with a head-dependent pair, so the Correspondence Principle is satisfied with the same words on both sides. The authors are also transparent about the exceptional cases, which is more than many papers do.\n\nThe soft spot is load-bearing, not cosmetic. The Correspondence Principle is stated as A(B*) ∨ A(*B) ≡ A|B, but then the authors explicitly allow cases where only A or only B is the same on the two sides, with the other variable denoting a different word. That is exactly what happens in the Croatian and Kalkatungu derivations. For example, Croatian Step 3 equates the dependency je(*učionica) with the functor-argument relation Naša\\je: the LHS's B is učionica, the RHS's B is Naša. Once that substitution is allowed, ≡ is no longer a relation between the same linguistic objects. It becomes a license to pair any dependency relation with any functor-argument relation that shares one category. No formal semantics for ≡ is given, and there is no restriction on admissible substitutions. The equivalences therefore do not establish a substantive unification; they show that each step can be post-hoc reconciled. The principle is also credited to anonymous works (likely the authors' own prior work), which blocks checking prior art.\n\nA related but smaller issue: the paper claims \"PSG→CG, DG→CG, CG→DG, CG→PSG\" as if these are novel, but the PSG-DG correspondence is old (Gaifman 1965; Hays 1964), and CG-to-dependency mappings are standard in parsing. The only novel piece is the Correspondence Principle, and it is not well-defined.\n\nFor a reader: the survey in Section 5 is the valuable part. The formal derivation in Section 6 does not support the conclusions, and the cognitive speculation in Section 7 goes beyond anything the paper establishes. I would not cite the paper for the unification, but I might point someone to the survey.\n\nRecommendation: send to referees—the question is important enough and the survey worth preserving—but the reviewers should be told to focus on the Correspondence Principle. I expect rejection unless the authors can give a real definition of ≡ and restrict variable substitutions. That is a big lift.\n\nBest,\n[Name]","headline":"Useful survey, but the claimed unification rests on a Correspondence Principle that can equate any dependency with any functor-argument pair, so the formal result collapses.","tokens_in":28292,"tokens_out":2768,"would_cite":false,"duration_ms":30721,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that three rival grammar formalisms can be rewritten as one representation system that handles both continuous and discontinuous syntax.","keywords":["syntactic discontinuity","unified representation","phrase structure grammar","dependency grammar","categorial grammar","constituency","functor-argument relations","non-configurational languages"],"falsifier":"Take a dependency graph in which one head takes two dependents of the same category on the same side, and try to assign each word a single CG category so that every dependency edge matches a distinct functor-argument application under $A(B^*)\\lor A({}^*B)\\equiv A|B$; one unmatched edge would be a direct counterexample to the claimed equivalence.","tokens_in":27031,"feed_emoji":"🧩","tokens_out":7659,"duration_ms":91643,"temperature":0.7,"pith_summary":"The paper tries to prove that three apparently incompatible grammar formalisms—phrase structure, dependency, and categorial—are one system of representation when viewed through a single correspondence principle. It applies the principle to discontinuous constructions in German, Croatian, and Kalkatungu, showing that each construction can be derived in all three formalisms and converted in both directions. If true, this would mean constituency, head-dependent, and functor-argument descriptions are notations for the same underlying structure, so continuous and discontinuous syntax need no separate machinery. The wider stake is that the cognitive system may represent both kinds of languages in one format.","feed_headline":"One notation can represent all three grammar formalisms","feed_subtitle":"Rewrites phrase-structure, dependency, and categorial analyses into one notation for continuous and discontinuous syntax.","key_machinery":"The load-bearing device is the Correspondence Principle, $A(B^*)\\lor A({}^*B)\\equiv A|B$, which reads: if B depends on A and sits to the left (or right) of A, then the pair can be written as a functor-argument category $A|B$ with neutral direction. The paper supplements this with a dependency valuation function $\\delta$ that assigns real values to nodes, and with wrapping, which lets a functor combine with a non-adjacent argument by treating the functor and one argument as a combined lexical form. The derivations then move stepwise: CG cancellations are drawn into PSG trees, using tangled trees when word order requires crossing branches, and each cancellation is rewritten as a dependency relation, producing a unified representation for the sentence.","core_discovery":"On the paper's own terms, the discovery is that continuous and discontinuous sentences can be carried through a chain of conversions—PSG to CG, DG to CG, CG to DG, and CG to PSG—so that no formalism is left with an irreducible representation. For a German verb-final construction, a Croatian copular clause with a split noun phrase, and a Kalkatungu clause with a discontinuous noun phrase, the paper derives dependency graphs, CG cancellation steps, PSG rules, and unified diagrams, then concludes that establishing these conversions is tantamount to establishing $\\mathrm{PSG}\\equiv\\mathrm{CG}\\equiv\\mathrm{DG}$ in their representational descriptions of natural language constructions.","pith_inferences":["Read literally, the Correspondence Principle's exceptional steps allow the category B on one side of the equivalence to pick out a different word from B on the other side, which makes the equivalence a matching rule rather than a true identity; its scope should be tested on dependency graphs where no shared category exists.","A natural extension is to run the same PSG to CG to DG chain on English long-distance dependencies and parentheticals; if the chain goes through, the unification extends beyond free-word-order languages.","The paper's choice to avoid type-raising in favor of iterative wrapping could be tested by checking whether all CG derivations for coordinate or shared-constituent constructions remain inside the closure of the wrapping operation."],"forward_implications":["A single system of representation can cover continuous and discontinuous structures without adding rules, constraints, or transformations beyond the Correspondence Principle.","Representations in any of the three formalisms can be converted into either of the other two, so a constituency tree, a dependency graph, and a CG derivation become views of the same structure.","The traditional opposition between constituency-based and non-constituency formalisms would be a theoretical artefact, not a property of languages.","The same cognitive representation could serve speakers of fixed-word-order and free-word-order languages, with no need for separate continuous and discontinuous syntax modules."],"supporting_citations":[{"why":"Stated source of the Correspondence Principle, the load-bearing equivalence between dependency relations and functor-argument relations.","marker":"Anonymous 2022, Anonymous 2023, Anonymous 2024"},{"why":"Provides the Warlpiri non-configurational data and the lexical-structure/phrase-structure distinction that motivate the need to handle discontinuity.","marker":"Hale (1983)"},{"why":"Source of the Croatian and Kalkatungu example sentences used as the paper's main derivation cases.","marker":"Van Valin (2001)"},{"why":"Demonstrates formal correspondences between dependency systems and phrase-structure systems, the result the paper extends to categorial grammar.","marker":"Gaifman (1965)"},{"why":"Supplies the dependency-rule notation and the encoding of phrase-structure subtrees that ground the DG formalism used here.","marker":"Hays (1964)"},{"why":"Prior proposals for dependency constituents that the paper's unification builds on and explicitly differs from.","marker":"Barry and Pickering (1990, 1993)"},{"why":"Provides the wrapping operation used to combine functors with non-adjacent arguments in discontinuous CG derivations.","marker":"Morrill (1995)"},{"why":"Gives the categorial grammar apparatus and type-raising background that the paper deliberately sets aside in favor of wrapping.","marker":"Steedman (2014)"}],"fun_headline_variants":["One notation unifies three grammar formalisms","Continuous and discontinuous syntax in one system","PSG, DG, CG: now interchangeable","Unified representation for continuity and discontinuity","Grammar formalisms converge in one notation"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the stipulated Correspondence Principle, which assumes every dependency relation between two words can be rewritten as a functor-argument relation, even though in exceptional steps the word assigned to B on one side of the equivalence can be a different word from the B on the other side.","fun_headline_variants_meta":{"raw":{"variants":["One notation unifies three grammar formalisms","Continuous and discontinuous syntax in one system","PSG, DG, CG: now interchangeable","Unified representation for continuity and discontinuity","Grammar formalisms converge in one notation"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000144,"raw_usage":{"total_tokens":1136,"prompt_tokens":870,"completion_tokens":266,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":486,"completion_tokens_details":{"reasoning_tokens":202}},"tokens_in":486,"tokens_out":266,"duration_ms":3517,"temperature":1.0,"reasoning_tokens":202,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T10:22:17.853257+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a dependency graph in which one head takes two dependents of the same category on the same side, and try to assign each word a single CG category so that every dependency edge matches a distinct functor-argument application under $A(B^*)\\lor A({}^*B)\\equiv A|B$; one unmatched edge would be a direct counterexample to the claimed equivalence.","supporting_citations":[],"review_version":1}