Construction method of Chinese sentential semantic structure

A new method is proposed for constructing the Chinese sentential semantic structure in this paper.The method adopts the features including predicates,relations between predicates and basic arguments,relations between words,and case types to train the models of CRF + + and dependency parser. On the basis of the data set in Beijing Forest Studio-Chinese Tagged Corpus( BFS-CTC),the proposed method obtains precision value of 73. 63% in open test. This result shows that the formalized computer processing can construct the sentential semantic structure absolutely. The features of predicates,topic and comment extracted with the method can be applied in Chinese information processing directly for promoting the development of Chinese semantic analysis.The method makes the analysis of sentential semantic analysis based on large scale of data possible. It is a tool for expanding the corpus and has certain theoretical research and practical application value.     

基于谓词及句义类型块的汉语句义类型识别

从现代汉语语义学角度,可将句义类型划分为简单句义、复杂句义、复合句义和多重句义4种。作为在整体上对句义结构进行描述的方式之一,句义类型识别是对汉语句子进行完整句义结构分析的重要步骤。该文基于谓词及句义类型块提出了一种汉语句义类型识别的方法,实现了4种句义类型的识别。该方法先通过句中谓词的个数进行初步识别判断出部分简单句,再对剩余的句子先用C4.5机器学习的方法得到句中谓词经过的最大句义类型块的个数,再结合句法结构中顶端句子节点进行判决,最终给出剩余句子的句义类型判定结果。实验采用BFS-CTC汉语标注语料库中10221个句子进行开集测试,句义类型的整体识别准确率达到97.6%,为基于现代汉语语义学的研究奠定了一定的技术研究基础。     

基于LS空间的IC真实缺陷图像的分割

在对集成电路(IC)真实缺陷进行分类与识别时,IC缺陷图像分割是非常重要的一步.本文提出一种新的IC缺陷图像分割方法.该方法首先将IC缺陷图像由RGB空间转换到HLS空间,然后根据IC缺陷图像背景像素的L及S值的分布,设计LS空间上的分段线性判别函数及聚类准则,最后由聚类准则完成IC真实缺陷图像的分割.实验结果表明,本文方法不仅可分割背景一致的IC图像,而且对背景不一致的图像也可获得满意的分割效果.从而为真实缺陷的分类与识别奠定了可靠基础.     

The time-limited influence of sentential context of function word identification.

Sentential context effects on the identification of the Dutch function words te (to) and de (the) were examined. In Experiment 1, listeners labeled words on a [te]–[de] continuum more often as to when the context was to biased (Ik probeer [?e] schieten [I try to/the shoot]) than when it was de biased (Ik probeer [?e] schoenen [I try to/the shoes]). The effect was weaker in slower responses. In Experiment 2, disambiguation began later, in the second word after [?e]. There was a weak context effect only in the slower responses. In Experiments 3 and 4, disambiguation occurred on the word before [?e]: There was no context effect when one set of sentences was used, but there was an effect (larger in the faster responses) when more sentences were used. Syntactic processing affects word identification only within a limited time frame. It appears to do so not by influencing lexical access processes through feedback but, instead, by biasing decision making. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

ON THE LAWS OF FORM

This paper directs attention to certain formalizations, within mathematical logic, of philosophical content related to self-reference and G. Spencer Brown's Laws of Form. These topics suggest further investigation into modifications and/or extensions of Brown's Calculus of Indications. An abbreviated account of Brown's work is also given with one example of its application to the propositional calculus.     

ON THE LAWS OF FORM

This paper directs attention to certain formalizations, within mathematical logic, of philosophical content related to self-reference and G. Spencer Brown's Laws of Form. These topics suggest further investigation into modifications and/or extensions of Brown's Calculus of Indications. An abbreviated account of Brown's work is also given with one example of its application to the prepositional calculus.     

语句级汉字拼音输入技术评估方法的研究

该文介绍了语句级汉字拼音输入技术评估方法的研究意义及其重要性。从信息论角度出发,提出了基于损失函数的语句级汉字拼音输入技术的评估方法,它通过损失函数比较经语句级汉字拼音输入系统输出的句子和相应的标准句子,得到描述系统性能的定量指标。该方法对汉字拼音输入技术的音节流自动切分和音字转换两方面进行了较全面的评估。采用手工标注的1996年《人民日报》部分语料,对目前流行的汉字拼音输入技术进行了评估,实验结果表明:拼音输入技术音字转换准确率最高能达到64.3%,音节流自动切分对音字转换的准确率有大约2%的影响。评估结果对今后的拼音输入技术的评估提供了参考价值,对汉字拼音输入技术的持续发展有指导意义。     

Contraction Based on Sentential Selection

The properties of full meet contraction are investigated, andit is shown to be a useful building-block in the constructionof composite contraction operators. This is followed by a detailedinvestigation of specified meet contraction, i.e. the operation÷ such that K ÷ p = K f(p), where is full meetcontraction and f is a function from sentences to sentences.A number of realistic examples of belief contraction are discussed,and it is shown how the properties of contraction differ accordingto how the sentence to be contracted is situated in the structureof the belief state. Some plausible properties of f are proposed,and it is shown how they correspond to properties of the contractionoperator.     

Distributivity in Łℵ0 and Other Sentential Logics

Certain distributivity results for ukasiewicz's infinite-valued logic ₀ are proved axiomatically (for the first time) with the help of the automated reasoning program OTTER. In addition, nondistributivity results are established for a wide variety of positive substructural logics by the use of logical matrices discovered with the automated model-finding programs MACE and MAGIC.     

The Ackermann constant theorem: A computer-assisted investigation

The Ackermann constant problem for a logicL is to determine how many sentential constants generated by closing {t} under the connectives ofL are non-equivalent according toL. This problem was solved for the logicR by the author in 1979–1980. First a constraint satisfaction program was used to generate appropriate finite algebras. Then the constant fragment of their direct product was generated and studied. This paper is a history of the work, explaining the problems, the solution method and the algorithms used.