共查询到20条相似文献,搜索用时 140 毫秒
1.
一种文本理解的知识表示方法 总被引:2,自引:0,他引:2
对自然语言文本的理解, 应该把它与一定的情境联系起来。本文正是基于这样的思想, 讨论了一个文本所描述的事物及其有关情境是如何在机内表示的。 相似文献
2.
针对目前情境信息丰富问题语义理解的困难,提出了一种基于语义句模的语义理解方法.该方法借鉴汉语言学中句模的研究成果,以及问题的分类,构建语义句模,将语义信息蕴含在句模中,利用文本中能够穷举的信息,为千变万化的情境信息赋予相应的语义.实验构建了基于自然语言处理工具Gate的语义句模jape规则库,以收集的102道四则运算应用题为例进行语义理解,实验结果为完全理解的题目为82.4%,部分理解为17.6%,完全不理解的0%.得出的实验结论是,该方法能够较好地实现情境信息丰富问题的语义理解. 相似文献
3.
中文文本自动校对技术研究及系统组成 总被引:1,自引:0,他引:1
对文本自动校对国内外发展现状进行描述,针对中文文本出现错误的状况进行分析,提出了查错,纠错的两类自动校对技术;基于语料统计的词的匹配技术和基于自然语言理解的理解技术,给出了中文文本自动校对系统的组成及关键技术。 相似文献
4.
5.
6.
何怡 《电子制作.电脑维护与应用》2014,(17)
文本技术是人工智能领域对自然语言理解的重要内容,也是搜索引擎需要解决的重要问题之一。本文对国内外流行的基于Web文本的技术和算法进行了简单探讨,根据实际情况提出了一种对网页中的文本进行的算法,并对该算法进行了验证。 相似文献
7.
●整合营造了理想的学习情境网络提供的多媒体文本、图形、图像、动画、影视等视觉信息与解说、拟音、音乐等听觉信息,为学生学习语文创设了图文并茂的课文情境,大大激发了学生的学习兴趣,提高了他们对语言文字的理解与感悟能力,促进了学生的自我实现。 相似文献
8.
王鹏 《中国信息技术教育》2011,(13)
“整合”营造了理想的学习情境
网络提供的多媒体文本、图形、图像,动画、影视等视觉信息与解说、拟音、音乐等听觉信息,为学生学习语文创设了图文并茂的课文情境,大大激发了学生的学习兴趣,提高了他们对语言文字的理解与感悟能力,促进了学生的自我实现。 相似文献
9.
10.
启发式相关文本提取技术研究 总被引:2,自引:0,他引:2
随着WEB上图片资源的日益丰富,人们对WEB图片检索的需求也日趋强烈,基于文本检索WEB图片,是人们当前检索WEB图片的主要手段,其中,提取图片的相关文本是实现基于文本的图片检索的基础,现有的相关文本提取技术对WEB的复杂性理解不够,使用固定的模式提取文本,常常以偏概全,提取效果不佳.本文进一步明确了相关文本的概念,使用启发式提取方法,让系统更智能地提取相关文本,实验表明,该技术能提取到绝大部分的相关文本,并且所提取的文本与图片的相关度也很高. 相似文献
11.
The PEMS high speed maglev train, which features a permanent magnet inside an electromagnet, is a new kind of maglev train for long distance intercity transportation. The joint structure, which consists of two single levitation sub‐systems, is the fundamental levitation unit. Two kinds of faults are considered and corresponding fault tolerant control strategies are proposed. The first fault condition is when a gap sensor that is part of a single levitation system is faulty. For this kind of fault, a fault tolerant control strategy based on signal reconfiguration is proposed. The second fault condition is when the whole of a single levitation sub‐system is faulty. Under this condition, a faulty model is firstly established, then a fault tolerant control strategy is designed. When this kind of fault is detected, a switch from the normal controller to the fault tolerant controller can make the faulty system stable. 相似文献
12.
Lotfi A. Zadeh 《Computational statistics & data analysis》2006,51(1):15-46
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitantly, existing theories of uncertainty are based on probability theory. The generalized theory of uncertainty (GTU) departs from existing theories in essential ways. First, the thesis that information is statistical in nature is replaced by a much more general thesis that information is a generalized constraint, with statistical uncertainty being a special, albeit important case. Equating information to a generalized constraint is the fundamental thesis of GTU. Second, bivalence is abandoned throughout GTU, and the foundation of GTU is shifted from bivalent logic to fuzzy logic. As a consequence, in GTU everything is or is allowed to be a matter of degree or, equivalently, fuzzy. Concomitantly, all variables are, or are allowed to be granular, with a granule being a clump of values drawn together by a generalized constraint. And third, one of the principal objectives of GTU is achievement of NL-capability, that is, the capability to operate on information described in natural language. NL-capability has high importance because much of human knowledge, including knowledge about probabilities, is described in natural language. NL-capability is the focus of attention in the present paper. The centerpiece of GTU is the concept of a generalized constraint. The concept of a generalized constraint is motivated by the fact that most real-world constraints are elastic rather than rigid, and have a complex structure even when simple in appearance. The paper concludes with examples of computation with uncertain information described in natural language. 相似文献
13.
在实际应用中有这样一类关系数据库,其中数据项在某个属性上的取值本身又是一个关系。讨论这种混合关系中的函数依赖及其相应的相关规则具有一定的理论意义和实际应用价值。给出这种混合关系的形式定义、混合关系中4种类型的函数依赖关系以及相应的4种类型的相关规则;并给出混合关系到一般关系的转换,通过这个转换说明了混合关系与普通关系的联系及其差别。给出一个实际应用中的例子,来说明混合关系中的函数依赖和相关规则的形式多样性。 相似文献
14.
The essence of intelligence is to use certain abilities to obtain knowledge, to use that knowledge, and to operate with that knowledge. New knowledge learned by a human is often related to old existing knowledge, and sometimes we could have more conceptual knowledge based on old knowledge. So, the knowledge in the brain exists in a related structural form, and this structure is dynamic, and therefore is evolvable. Based on the understanding of the real process of learning by a human being, we discuss how to make a model to describe the dynamic structure of knowledge. This model is also a principle of artificial brain design. Most of the knowledge a child learns is from natural language and perception information, and we define this as semantic knowledge. The model to describe the process and structure of knowledge growing in a network form is called a K-net. It is a dynamic network with two main dynamics: one is new knowledge added, and the other is aggregating knowledge existing in the network with some probability. Under these very natural conditions, we found that the network is originally a simple random net, and then some characteristics of a complex network gradually appear when more new knowledge is added and aggregated. A more interesting phenomenon is the appearance of a random hierarchical structure. Does this mean emergence? 相似文献
15.
16.
Stephen J. Hegner 《Annals of Mathematics and Artificial Intelligence》2004,40(1-2):63-125
The fundamental problem in the design of update strategies for views of database schemata is that of selecting how the view update is to be reflected back to the base schema. This work presents a solution to this problem, based upon the dual philosophies of closed update strategies and order-based database mappings. A closed update strategy is one in which the entire set of updates exhibit natural closure properties, including transitivity and reversibility. The order-based paradigm is a natural one; most database formalisms endow the database states with a natural order structure, under which update by insertion is an increasing operation, and update by deletion is decreasing. Upon augmenting the original constant-complement strategy of Bancilhon and Spyratos – which is an early version of a closed update strategy – with compatible order-based notions, the reflection to the base schema of any update to the view schema which is an insertion, a deletion, or a modification which is realizable as a sequence of insertions and deletions is shown to be unique and independent of the choice of complement. In addition to this uniqueness characterization, the paper also develops a theory which identifies conditions under which a natural, maximal, update strategy exists for a view. This theory is then applied to a ubiquitous example – single-relational schemata constrained by equality-generating dependencies. Within this framework it is shown that for a view defined as a projection of the main relation, the only possibility is that the complement defining the update process is also a projection, and that the reconstruction is based upon functional dependencies. 相似文献
17.
In this paper, we study stabilization for a Schoedinger equation, which is interconnected with a heat equation via boundary coupling. A direct boundary feedback control is adopted. By a detailed spectral analysis, it is found that there are two branches of eigenvalues: one is along the negative real axis, and the other is approaching to a vertical line, which is parallel to the imagine axis. Moreover, it is shown that there is a set of generalized eigenfunctions, which forms a Riesz basis for the energy state space. Finally, the spectrum-determined growth condition is held and the exponential stability of the system is then concluded. 相似文献
18.
This paper examines the use of speculations, a form of distributed transactions, for improving the reliability and fault tolerance of distributed systems. A speculation is defined as a computation that is based on an assumption that is not validated before the computation is started. If the
assumption is later found to be false, the computation is aborted and the state of the program is rolled back; if the assumption is found to be true, the results of the computation are committed. The primary difference between a speculation and a transaction is that a speculation is not isolated—for example, a speculative
computation may send and receive messages, and it may modify shared objects. As a result, processes that share those objects
may be absorbed into a speculation. We present a syntax, and an operational semantics in two forms. The first one is a speculative
model, which takes full advantage of the speculative features. The second one is a nonspeculative, nondeterministic model,
where aborts are treated as failures. We prove the equivalence of the two models, demonstrating that speculative execution
is equivalent to failure-free computation. 相似文献
19.
Hideki Sakauchi Yasuyo Okanoue Hiroyuki Okazaki Satoshi Hasegawa 《Journal of Network and Systems Management》1993,1(2):123-141
This paper proposes a distributed self-healing architecture which contains two self-healing techniques. In this proposal, a path restoration by Self-Healing Ring (SHR) and a path restoration by Dynamic Self-Healing (DSH) algorithm are jointly applied in a network. In the architecture, SHR is applied for a part of a path which is terminated by an Add-Drop Multiplexer (ADM), and DSH is applied for another part of a path which is terminated by two Digital Cross-Connect Systems (DCSs). Based on the architecture, DSH can be applied for a part of a path which is terminated by an ADM. Next, a network design algorithm is described in order to optimize the amount of spare capacity. As a result, spare capacity reduction is realized by using the algorithm for a network where the proposed architecture is applied. 相似文献