In classical logic systems,the logical expression is generated mechanically by the formulas according to the forming rules,which cannot characterize the generation process of the sentence.The standard CCG theory uses the generalized quantifier theory as a semantic tool to characterize the combination of the logical language expressions,thus realizing the correspondence between syntactic structure and logical semantic generation.Ambiguity is an important issue in semantic research,and the formal analysis by the scope ambiguity of quantitative structure has attracted much attention.In natural language,when multiple universal quantifiers andnon-universals quantifiers are included at the same time,and there are complex dependencies between these quantifiers,the scope ambiguity of the quantitative structure will arise.According to the traditional Montague generative grammar which attributes of scope ambiguity to the syntactic structural on the surface of sentence,so in order to obtain a complex quantified sentence all of the semantic interpretation,not only need to do a lot of different combinations of syntactic structure to obtain all the scope of interpretation,possibly because there is no ambiguity on the syntactic structure and missed some reasonable interpretation.Different from traditional methods,Steedman uses Combinatory Categorial Grammar to solve the ambiguity of the scope of quantifiers.The generalized quantifier together with generalized skolem terms as the theoretical tool of CCG semantic level,universal quantifier is acted as a generalized quantifier,while the non-universal quantifier is processed by the generalized skolem terms.This new method makes CCG a logical semantic tool more suitable for processing natural language.This new idea make it possible to sovel the scope caused by the combination of quantifiers,coordinate structures,intermediate scope,empty argument structures and the combination of quantifiers and other sentence components.This new approach is a self-sufficiency theoretical construction without resorting to other algorithmic mechanisms,which also demonstrates the thoroughly lexicalized nature of CCG.In this paper,we try to add generalized skolem term to the theoretical framework of CCG and pay attention to dealing with the scope ambiguity of quantization sentences.In this paper,based on the real text of quantization statements in Chinese,the quantization sentences with scope ambiguity are divided into three types,and the appropriate syntactic categories and logical forms are assigned to quantization sentences. |