英语“情态副词+DP”的合法性解析——兼谈其汉语对应表达

认识类情态副词作用于命题,表达对命题的主观确定程度。但英语中,这类副词却常与DP组合,作用于DP,而非命题。本研究探讨英语"情态副词+DP"结构的合法性条件。研究认为,在"情态副词+DP"的语义解释中,表层的DP实际关联一个命题,这是支撑"情态副词+DP"结构合法的深层语义条件;英语关系从句是"情态副词+DP"成立的句法前提,它在语言使用经济性原则和转喻机制的推动下在表层实现为DP;此外,从语义匹配角度而言,情态副词表达认知不确定性,与之组合的命题内容(表层为DP)也需要具有与之匹配的"不确定性",这是"情态副词+DP"合法的另一语义条件。在上述分析的基础上,研究还对比分析了相同的概念语义在汉语中的编码问题,审视了英汉语在句法—语义界面上不同的工作机制。研究发现,汉语不存在英语关系从句的这样的固定句法结构,故无法借助转喻机制使用DP代替命题表达的概念语义。

“把”+构式的演化

"把"既可以用作动词,也可以用作"把"字句的介词。含"把"的句式可分为3大类,语料库揭示它们出现的顺序是:单结构>双结构>"把"式结构。本文认为,"把"+构式演化的主要渐进条件是:1)相邻构式之间存在语义-句法的部分相同,因为演化是语义-句法渐进式的。2)语段中单结构句子和后续句子重复同现,导致双结构产生,句式信息量增加。3)双结构的进一步扩展和复杂化,导致语义节奏发生变化。4)节奏变化导致"把"的语义弱化,"把"式结构动词类频和"把"字句例频快速增加;使用频次增加又促使"把"式结构进一步变异。本文通过国家语委语料库(CNC)具体验证理论表述的合理性。

An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree

To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm.