Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve bo...Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve both textual descriptions and geometry diagrams,requiring a joint understanding of these modalities.Although considerable progress has been made in solving math word problems,research on solving APGDs still cannot discover implicit geometry knowledge for solving APGDs,which limits their ability to effectively solve problems.In this study,a systematic and modular three-phase scheme is proposed to design an algorithm for solving APGDs that involve textual and diagrammatic information.The three-phase scheme begins with the application of the statetransformer paradigm,modeling the problem-solving process and effectively representing the intermediate states and transformations during the process.Next,a generalized APGD-solving approach is introduced to effectively extract geometric knowledge from the problem’s textual descriptions and diagrams.Finally,a specific algorithm is designed focusing on diagram understanding,which utilizes the vectorized syntax-semantics model to extract basic geometric relations from the diagram.A method for generating derived relations,which are essential for solving APGDs,is also introduced.Experiments on real-world datasets,including geometry calculation problems and shaded area problems,demonstrate that the proposed diagram understanding method significantly improves problem-solving accuracy compared to methods relying solely on simple diagram parsing.展开更多
Coordinate structures are traditionally treated as symmetric constructions in which conjuncts are parallel in category,hierarchical status,and function.This assumption,however,is empirically inadequate:English coordin...Coordinate structures are traditionally treated as symmetric constructions in which conjuncts are parallel in category,hierarchical status,and function.This assumption,however,is empirically inadequate:English coordination exhibits systematic hierarchical non-parallelism among conjuncts with respect to structural position,sharing relations,and interpretive burden-asymmetries irreducible to surface categorial mismatch.Despite substantial generative work on coordination,no existing account has determined which asymmetry type demands which structure-building operation,or whether such distinctions can be established on language-internal grounds alone.This article addresses that gap through four empirical domains in English:unlike-category coordination,irreversible ordering,Across-the-Board(ATB)extraction and the Coordinate Structure Constraint(CSC),and the syntax-semantics subordination mismatch.These domains are shown to instantiate three structurally distinct asymmetry types,evaluated against ordinary Merge,pair-Merge,and Parallel Merge,with the movement/base-generation distinction and lexicalized dependency as boundary conditions.No single Merge operation proves sufficient:Ordinary Merge provides a baseline for unlike-category structures but fails to derive ordering restrictions or shared-structure dependencies;pair-Merge better handles adjunction-like augmentation asymmetries;and Parallel Merge offers the most principled account of ATB phenomena through multidominance.The article concludes that the three asymmetry types are irreducible to a single structural source,and that this irreducibility constitutes the primary diagnostic for differentiating among Merge paths within a single language.展开更多
Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This pap...Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations(DIR-AWP),such as entailing commonsense or subject-domain knowledge involved in the problem-solving process.This paper proposes to take three steps to solve DIR-AWPs,in which the first three steps are used to conduct the qualia inference process.The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic(S2)method from the given problem.The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models,respectively.The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations.The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities.The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.展开更多
In this paper, I will focus on the debate between descriptivism and anti-descriptivism theory about proper names. In the introduction, l will propose an historical reconstruction of the debate, and focus in particular...In this paper, I will focus on the debate between descriptivism and anti-descriptivism theory about proper names. In the introduction, l will propose an historical reconstruction of the debate, and focus in particular on Russell and Kripke's treatments of proper names. Strong criticisms will be advanced against Kripke's hypothesis of rigid-designator and, more deafly, against the consequent distinction between the epistemic and metaphysical level that Kripke proposes to explain identity assertions between proper names. Furthermore, I will argue, that, pace Kripke, Russellian treatment of proper names allows to capture all our semantic intuitions, and also those semantic interpretations which concern context-belief sentences. I will close the introduction by focusing on a criticism that Kripke rightly points out against an example that Russell proposes in his On Denoting. Section 2 will be devoted to Russellian solution: I will show that not only Russell's logical treatment of proper names allows to answer to Kripke's criticism to Russell's example, but also that such treatment can disambiguate and express all our semantic intuitions about Frege's puzzle sentence "Hesperus is Phosphorus." ! will then show that, contrarily, Quinian solution (discussed in section 3) and Kripkian one (see section 4) are not satisfactory to capture our semantic knowledge about Frege's sentence. Furthermore, in section 5, I will focus on Kripke's distinction between epistemic and metaphysical level to deal with identity assertions between proper names, and I will logically show that such distinction is not plausible. In section 5, then, I will show that Russellian solution allows to explain context-belief sentences, contrarily to what Kripke thinks. In Conclusions, I will summarize what 1 have argued in the text.展开更多
山东大学文化传播学院庄会彬教授所著Syntax-Semantics Mismatches in Mandarin Chinese于2026年4月由Springer出版社出版。该书是作者国家社科基金后期资助项目成果《现代汉语形义错配研究》(北京师范大学出版社,2021)的英文版。全书...山东大学文化传播学院庄会彬教授所著Syntax-Semantics Mismatches in Mandarin Chinese于2026年4月由Springer出版社出版。该书是作者国家社科基金后期资助项目成果《现代汉语形义错配研究》(北京师范大学出版社,2021)的英文版。全书共分八章。第一章总述现代汉语形义错配问题的现状分析与研究构想。第二至四章主要探讨主语定化现象:第二章详细讨论“V-得”结构以及由其带来的形义错配现象;第三章讨论动补结构限制宾语现象,主要涉及V-V动结式的本质,V-V动结式限制宾语现象,以及动补结构的历史来源问题;第四章从韵律语法的视角探索“的”的本质及其形义错配的形成机制。第五章讨论宾语定化及相关结构的句法特点,揭示VO复杂动词的宾语成为O的定语的原因。第六章讨论补语定化现象,利用格理论从句法上讨论其推导过程。第七章主要探讨状语定化现象,兼及代体宾语的形成机制。第八章结语。展开更多
基金supported by the National Natural Science Foundation of China(No.61977029)the Fundamental Research Funds for the Central Universities,CCNU(No.3110120001).
摘要Solving Algebraic Problems with Geometry Diagrams(APGDs)poses a significant challenge in artificial intelligence due to the complex and diverse geometric relations among geometric objects.Problems typically involve both textual descriptions and geometry diagrams,requiring a joint understanding of these modalities.Although considerable progress has been made in solving math word problems,research on solving APGDs still cannot discover implicit geometry knowledge for solving APGDs,which limits their ability to effectively solve problems.In this study,a systematic and modular three-phase scheme is proposed to design an algorithm for solving APGDs that involve textual and diagrammatic information.The three-phase scheme begins with the application of the statetransformer paradigm,modeling the problem-solving process and effectively representing the intermediate states and transformations during the process.Next,a generalized APGD-solving approach is introduced to effectively extract geometric knowledge from the problem’s textual descriptions and diagrams.Finally,a specific algorithm is designed focusing on diagram understanding,which utilizes the vectorized syntax-semantics model to extract basic geometric relations from the diagram.A method for generating derived relations,which are essential for solving APGDs,is also introduced.Experiments on real-world datasets,including geometry calculation problems and shaded area problems,demonstrate that the proposed diagram understanding method significantly improves problem-solving accuracy compared to methods relying solely on simple diagram parsing.
基金Research on Ideological and Political Construction of Linguistics Courses in Universities Based on Educational Informatization(2022B01171),2022 Zhanjiang Non-funded Science and Technology Research ProjectResearch on Mechanisms for Promoting Syntax Learning in Blended Teaching Contexts(2JY22008),Higher Education Teaching Research Project of Guangdong Medical University.
摘要Coordinate structures are traditionally treated as symmetric constructions in which conjuncts are parallel in category,hierarchical status,and function.This assumption,however,is empirically inadequate:English coordination exhibits systematic hierarchical non-parallelism among conjuncts with respect to structural position,sharing relations,and interpretive burden-asymmetries irreducible to surface categorial mismatch.Despite substantial generative work on coordination,no existing account has determined which asymmetry type demands which structure-building operation,or whether such distinctions can be established on language-internal grounds alone.This article addresses that gap through four empirical domains in English:unlike-category coordination,irreversible ordering,Across-the-Board(ATB)extraction and the Coordinate Structure Constraint(CSC),and the syntax-semantics subordination mismatch.These domains are shown to instantiate three structurally distinct asymmetry types,evaluated against ordinary Merge,pair-Merge,and Parallel Merge,with the movement/base-generation distinction and lexicalized dependency as boundary conditions.No single Merge operation proves sufficient:Ordinary Merge provides a baseline for unlike-category structures but fails to derive ordering restrictions or shared-structure dependencies;pair-Merge better handles adjunction-like augmentation asymmetries;and Parallel Merge offers the most principled account of ATB phenomena through multidominance.The article concludes that the three asymmetry types are irreducible to a single structural source,and that this irreducibility constitutes the primary diagnostic for differentiating among Merge paths within a single language.
基金The National Natural Science Foundation of China(No.61977029)supported the worksupported partly by Nurturing Program for Doctoral Dissertations at Central China Normal University(No.2022YBZZ028).
摘要Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations(DIR-AWP),such as entailing commonsense or subject-domain knowledge involved in the problem-solving process.This paper proposes to take three steps to solve DIR-AWPs,in which the first three steps are used to conduct the qualia inference process.The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic(S2)method from the given problem.The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models,respectively.The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations.The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities.The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.
摘要In this paper, I will focus on the debate between descriptivism and anti-descriptivism theory about proper names. In the introduction, l will propose an historical reconstruction of the debate, and focus in particular on Russell and Kripke's treatments of proper names. Strong criticisms will be advanced against Kripke's hypothesis of rigid-designator and, more deafly, against the consequent distinction between the epistemic and metaphysical level that Kripke proposes to explain identity assertions between proper names. Furthermore, I will argue, that, pace Kripke, Russellian treatment of proper names allows to capture all our semantic intuitions, and also those semantic interpretations which concern context-belief sentences. I will close the introduction by focusing on a criticism that Kripke rightly points out against an example that Russell proposes in his On Denoting. Section 2 will be devoted to Russellian solution: I will show that not only Russell's logical treatment of proper names allows to answer to Kripke's criticism to Russell's example, but also that such treatment can disambiguate and express all our semantic intuitions about Frege's puzzle sentence "Hesperus is Phosphorus." ! will then show that, contrarily, Quinian solution (discussed in section 3) and Kripkian one (see section 4) are not satisfactory to capture our semantic knowledge about Frege's sentence. Furthermore, in section 5, I will focus on Kripke's distinction between epistemic and metaphysical level to deal with identity assertions between proper names, and I will logically show that such distinction is not plausible. In section 5, then, I will show that Russellian solution allows to explain context-belief sentences, contrarily to what Kripke thinks. In Conclusions, I will summarize what 1 have argued in the text.
摘要山东大学文化传播学院庄会彬教授所著Syntax-Semantics Mismatches in Mandarin Chinese于2026年4月由Springer出版社出版。该书是作者国家社科基金后期资助项目成果《现代汉语形义错配研究》(北京师范大学出版社,2021)的英文版。全书共分八章。第一章总述现代汉语形义错配问题的现状分析与研究构想。第二至四章主要探讨主语定化现象:第二章详细讨论“V-得”结构以及由其带来的形义错配现象;第三章讨论动补结构限制宾语现象,主要涉及V-V动结式的本质,V-V动结式限制宾语现象,以及动补结构的历史来源问题;第四章从韵律语法的视角探索“的”的本质及其形义错配的形成机制。第五章讨论宾语定化及相关结构的句法特点,揭示VO复杂动词的宾语成为O的定语的原因。第六章讨论补语定化现象,利用格理论从句法上讨论其推导过程。第七章主要探讨状语定化现象,兼及代体宾语的形成机制。第八章结语。