oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
基于句法语义规则系统的比较句自动识别
Recognition of Comparative Sentences Based on Syntactic and Semantic Rules-System
 [PDF]

白林楠,胡韧奋,刘智颖
- , 2015,
Abstract: 摘要 针对汉语比较句的自动识别, 提出一种基于句法语义规则的方法。将比较标记和比较结果做为识别比较句的关键因素, 归纳汉语比较句的类别, 书写比较句识别规则, 同时设计4个模型进行分类识别。实验结果表明, 规则系统可以有效地实现汉语比较句的句法分析和自动识别, 为比较关系的抽取打下良好的基础。
Abstract The authors propose a novel method to identify comparative sentences based on rules, and these rules contain syntactic and semantic features of comparative sentences. Comparative marks and comparative result words are significant elements to identify comparative sentences. Based on this, the authors conclude the categories and identification rules of comparative sentences. Four models are designed to respectively recognize every category. Experiments show that proposed method can gain satisfactory results in comparative parser and recognition, which lay good foundation for comparative relation extraction.
汉语否定处置句研究  [PDF]
张俊阁
浙江大学学报(人文社会科学版) , 2015,
Abstract: ?否定是语言中普遍存在的一种现象,是语法中的重要范畴。就汉语处置句而言,根据否定词出现的位置,否定处置句可分为两种类型:否定前置处置句,否定后置处置句。这两种否定处置句的产生与处置介词语法化的句法环境有密切的关系。否定词前后位置的不同,其否定辖域及否定焦点也随之有所变化。否定词否定辖域及否定焦点和语用因素是两种否定处置句一直广泛存在于汉语方言的一个重要的内在动因,同时阿尔泰语否定词紧靠动词的语序对新疆、甘肃等地汉语方言处置句否定词的位置也有一定影响。
“句吴”与“吴”  [PDF]
陆振岳
- , 2015,
Abstract: 作为吴国名号的"句吴"与"吴",在先秦迄汉的载籍中,仅见于司马迁的《史记·吴太伯世家》。二者既有同一性,又存在区别。前者是太伯的自号,为俗辞;后者为周武王给予的封号,是中国之辞。不仅有元典的记载,有经史的注释,而且有相当的考古发现的器物铭文,证据充足,说理有凭。
Syntactic Monoids in a Category  [PDF]
Jiri Adamek,Stefan Milius,Henning Urbat
Mathematics , 2015,
Abstract: The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D = sets), the syntactic semirings of Polak (D = semilattices), and the syntactic associative algebras of Reutenauer (D = vector spaces). Assuming that D is an entropic variety of algebras, we prove that the syntactic D-monoid of a language L can be constructed as a quotient of a free D-monoid modulo the syntactic congruence of L, and that it is isomorphic to the transition D-monoid of the minimal automaton for L in D. Furthermore, in case the variety D is locally finite, we characterize the regular languages as precisely the languages with finite syntactic D-monoids.
汉语块扩句的自动分析  [PDF]
韦向峰,张全?
计算机科学 , 2010,
Abstract: 块扩句是一类概念预期知识十分明确的句子。基于概念层次网络理论介绍了块扩句对应的块扩句类,总结了能够激活块扩句类的典型块扩动词。根据块扩动词的概念知识得到句子的特征语义块及块扩句类,依据块扩句类的知识对句子进行检验后可给出句子句类的分析结果。在已有的句类分析系统的基础上对真实语料中的块扩句进行了自动分析,实验表明正确率达到了71.29%,错误主要来自特征语义块动词辨识、动词多句类代码等。正确分析块扩句将有助于解决汉语句子的多动词处理难点。
Syntactic Complexity of Regular Ideals  [PDF]
Janusz Brzozowski,Marek Szyku?a,Yuli Ye
Computer Science , 2015,
Abstract: The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We prove that $n^{n-1}$, $n^{n-1}+n-1$, and $n^{n-2}+(n-2)2^{n-2}+1$ are tight upper bounds on the syntactic complexities of right ideals and prefix-closed languages, left ideals and suffix-closed languages, and two-sided ideals and factor-closed languages, respectively. Moreover, we show that the transition semigroups meeting the upper bounds for all three types of ideals are unique, and the numbers of generators (4, 5, and 6, respectively) cannot be reduced.
Syntactic Topic Models  [PDF]
Jordan Boyd-Graber,David M. Blei
Computer Science , 2010,
Abstract: The syntactic topic model (STM) is a Bayesian nonparametric model of language that discovers latent distributions of words (topics) that are both semantically and syntactically coherent. The STM models dependency parsed corpora where sentences are grouped into documents. It assumes that each word is drawn from a latent topic chosen by combining document-level features and the local syntactic context. Each document has a distribution over latent topics, as in topic models, which provides the semantic consistency. Each element in the dependency parse tree also has a distribution over the topics of its children, as in latent-state syntax models, which provides the syntactic consistency. These distributions are convolved so that the topic of each word is likely under both its document and syntactic context. We derive a fast posterior inference algorithm based on variational methods. We report qualitative and quantitative studies on both synthetic data and hand-parsed documents. We show that the STM is a more predictive model of language than current models based only on syntax or only on topics.
汉语的语境信息对抽象句和具体句回忆的影响
张浩,彭聃龄
心理学报 , 1990,
Abstract: 本实验用汉语材料进行实验,考察了语境信息对抽象句和具体句回忆的影响。在实验Ⅰ中抽象目标句和具体目标句镶嵌在随机语境或主题语境中。在随机语境条件下,被试对具体句比抽象句具有较好的回忆成绩;而在主题语境下,两种类型的句子之间的回忆成绩没有差异,具体性效应消失。实验Ⅱ增加了部分整合语境,在这种条件下,构成语境的主要名词与主题语境相同,但没有形成一个完整的主题。结果发现适当的语境对抽象句的回忆有促进作用,部分整合语境的促进作用位于随机语境和主题语境之间。语境对具体句的回忆没有影响。这一结果支持了语境有效模型。
Syntactic Complexity of Ideal and Closed Languages  [PDF]
Janusz Brzozowski,Yuli Ye
Computer Science , 2010,
Abstract: The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals and prefix-closed languages, and that there exist left ideals and suffix-closed languages of syntactic complexity $n^{n-1}+n-1$, and two-sided ideals and factor-closed languages of syntactic complexity $n^{n-2}+(n-2)2^{n-2}+1$.
综框的模态识别  [PDF]
纺织学报 , 1989,
Abstract: 本文介绍了通过输入输出数据分析识别综框模态参数的方法,给出了综框固有频率、模态阻尼和振型等模态参数测定的实例,讨论了模态参数在综框设计中的应用。
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.