CN100362514C - A Method for Constructing and Navigating Semantic Chains - Google Patents
A Method for Constructing and Navigating Semantic Chains Download PDFInfo
- Publication number
- CN100362514C CN100362514C CNB2004100302807A CN200410030280A CN100362514C CN 100362514 C CN100362514 C CN 100362514C CN B2004100302807 A CNB2004100302807 A CN B2004100302807A CN 200410030280 A CN200410030280 A CN 200410030280A CN 100362514 C CN100362514 C CN 100362514C
- Authority
- CN
- China
- Prior art keywords
- chain network
- semantic
- semantic chain
- browsing
- reasoning
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 69
- 238000010276 construction Methods 0.000 claims abstract description 11
- 238000005516 engineering process Methods 0.000 claims abstract description 7
- 238000012795 verification Methods 0.000 claims description 11
- 239000011159 matrix material Substances 0.000 claims description 8
- 230000015572 biosynthetic process Effects 0.000 description 5
- 101150053299 Mark1 gene Proteins 0.000 description 3
- 101150116075 Mark2 gene Proteins 0.000 description 3
- 230000001364 causal effect Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 239000003550 marker Substances 0.000 description 2
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 240000005373 Panax quinquefolius Species 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000013517 stratification Methods 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
Landscapes
- Information Transfer Between Computers (AREA)
- Machine Translation (AREA)
Abstract
本发明涉及计算机技术领域的构造和浏览语义链网络的方法，在语义链网络构造时采用了树型数据结构并支持多种类型的语义链网络的构造。步骤如下：步骤S1，输入一个资源文件；步骤S2，对该文档进行三种标记；步骤S3，对构造好的语义链网络进行校验；步骤S4，将这些语义链网络以扩展标记语言格式分别保存为文档内容文件和语义链网络文件；步骤S5，在生成的语义链网络文件的基础上对语义链网络所包含的语义信息进行大粒度推理和小粒度推理；步骤S6，将文档内容文件和语义链网络文件转换成超文本标记语言格式的文件；步骤S7，浏览语义链网络。该文档可被当前的各种浏览器浏览。
The invention relates to a method for constructing and browsing a semantic chain network in the field of computer technology, adopts a tree data structure and supports the construction of various types of semantic chain networks in the construction of the semantic chain network. The steps are as follows: step S1, input a resource file; step S2, mark the document in three ways; step S3, verify the constructed semantic chain network; step S4, separate these semantic chain networks in XML format Save it as a document content file and a semantic chain network file; step S5, perform large-grained reasoning and small-grained reasoning on the semantic information contained in the semantic chain network on the basis of the generated semantic chain network file; step S6, combine the document content file and The semantic chain network file is converted into a hypertext markup language file; step S7, browsing the semantic chain network. This document can be viewed by all current browsers.
Description
Technical field
The present invention relates to field of computer technology, particularly a kind of method of constructing and browsing semantic links, and between Internet resources semantic links (relation) structure with browse.
Technical background
After HTML(Hypertext Markup Language) was invented, webpage became the media that a kind of people carry out information interchange gradually.Along with the release of various webpage development instruments, the quantity sharp increase of webpage on the internet.This makes the user obtain needed information and becomes very difficult.The reason that causes this situation is that HTML (Hypertext Markup Language) is very limited to the ability to express of semanteme, and it almost can not express semantic relation.Therefore current internet (Web) is difficult to the information of retrieval is carried out accurate localization, and above-mentioned situation also makes the very difficulty that becomes of the service of developing intellectual resourceization on the internet simultaneously.
In order to address the above problem, semantic internet (Semantic Web) is suggested.The target of semantic internet be set up a kind of can be by the document of machine perception, make computing machine and people collaborative work well.Theory based on semantic internet comprises XML, RDF, and RDF-SCHEMA, Ontology (body) is suggested and adopts in interior technology and standard.
Be different from semantic internet, yet the semantic links network that we proposed is an expansion stably certainly to current hyperlink.It is made of seven kinds of fundamental types: cause and effect link, example link, implicit link, Reference-links, similar link, order link, subclass link etc.A large amount of semantic links networks that distribute interlink by semantic links and have constituted worldwide semantic links network.In the semantic links network, semantic expression is very succinct, and the transitivity of semantic links network and inference rule support the semantic links network to carry out semantic reasoning and intelligent application exploitation.
Summary of the invention
The object of the present invention is to provide a kind of method of constructing and browsing semantic links.
The objective of the invention is to construct fast and browse the semantic links network, solve in the internet arena about the structure of semantic links network and browse problem.The present invention is constructing semantic chain network on the basis of an original document earlier, and will construct good semantic links network with the storage of extending mark language form, then this storage file is converted to the file of a browsable HTML (Hypertext Markup Language) form.This method mainly comprise following some: according to the characteristics of semantic links network, when expression, structure and storage semantic links network, adopted tree, this had both solved the storage problem of semantic links network in computing machine, made the structure of semantic links network become very directly perceived again; Adopt the correctness of checking procedure with the semantic links network guaranteeing to construct; In structure integrated image preview technology during based on the semantic links network of image; Adopted general explanation mould plate technique; In order fully to show the characteristics of semantic links network, in general explanation template, added the process of semantic links network reasonings at display word right way of conduct face; When browsing the semantic links network, both combined the result of semantic links network reasoning, adopted the structure of browsing of tree type simultaneously again, and made both stratification of browsing content to comprise abundant semantic information again.
Inference rule of the present invention or reasoning are a kind ofly to use machine inference and non-artificial reasoning.
The invention technical scheme
A kind of method of constructing and browsing the semantic links network, this method is the various types of semantic links networks of structure on the basis of source file at first, to construct good semantic links network then with the storage of extending mark language (XML) form, and the semantic links network switch that generates be become with the webpage of HTML(Hypertext Markup Language) form storage browse again for the user; In the structure of semantic links network and storing process, adopt tree, in construction process, carried out verification, in the process of the webpage that the semantic links network switch is become the storage of HTML (Hypertext Markup Language) form, added the inference mechanism of semantic links network.This technical scheme has following technical characterictic:
1) adopted the tree mode to construct step by step during the constructing semantic chain network.
2) whether the verification construction process is correct at any time in the construction process.
3) can construct various types of semantic links networks.This method can not only be constructed the semantic links network of common type, can also construct the semantic links network based on image type and customization type.
4) store with the extending mark language form with the semantic links network of this method construct, and document content and semantic links network are stored respectively.
5) the semantic links network switch with storage becomes in the process of HTML (Hypertext Markup Language) form to have adopted general explanation mould plate technique, and this template is analyzed and explained the institute that is run into is underlined, and converts these marks to corresponding HTML (Hypertext Markup Language) mark.
6) adopted the semantic links network matrix to represent the semantic links network.
7) added the semantic links reasoning in explaining template, mainly comprised coarsegrain reasoning and small grain size reasoning two parts, the coarsegrain reasoning utilizes the semantic relation of inclusion between the semantic links network to carry out reasoning; The small grain size reasoning utilizes the transitivity of semantic links and inference rule to carry out reasoning.
8) when browsing the represented semantic links network of the HTML (Hypertext Markup Language) that generates with this method, this method shows the structure of semantic links network with the tree type again, and merged the The reasoning results of semantic links, make browsing content comprise extremely abundant semantic information.
Description of drawings
Fig. 1 is the process flow diagram that semantic links network of the present invention defines and browses.
Embodiment
The realization flow of this method is once described at first simply, specifically referring to Fig. 1.Concrete implementation step is as follows: step S1, import a resource file, and step S2 carries out three kinds of marks to the document: common type semantic links network mark, image type semantic links network mark and customization type semantic links network mark.Step S3, this method is carried out verification to the semantic links network of constructing, and forwards step S4 after verification is finished to.Step S4 saves as document content file and semantic links network file with these semantic links networks respectively with the extending mark language form.Step S5, the semantic information that on the basis of the semantic links network file that generates the semantic links network is comprised is carried out coarsegrain reasoning and small grain size reasoning.Step S6, the The reasoning results of comprehensive step S5, this method converts document content file and semantic links network file the file of HTML (Hypertext Markup Language) form to, and the file of the type can be browsed by the web browser of current popular, step S7 browses the semantic links network.
This method is supported the structure of three types semantic links network: the structure of the semantic links network of the structure of semantic links mark commonly used and customize tag, the structure of semantic links network and image type.From the strict sense, semantic links mark commonly used does not belong to the category of semantic links network, they only are that some need special semantic markers of handling, but the definition of these marks helps the understanding of reader to the document, therefore they discussion of all putting together.Structure with paper is that example illustrates the semantic links mark commonly used that this method is adopted below.Mainly contain article title (ArticleTitle), author (Author), author address (AuthorAddress), and mailbox (Email), the abstract of a thesis (Abstract), paper brief introduction (Introduction), paper is quoted (References) or the like.This method is corresponding marks on adding with the form of extending mark language in the front and back of the literal of being chosen in realization during said these semantic links marks of face.For example, if we carry out the semantic links mark to one piece of paper, suppose that the author of paper is " Zhang San ".If we want author " Zhang San " interpolation " author " semantic links mark, so the result after adding under the effect of this method be exactly "＜author〉Zhang San＜/author ".
Introduce the structure mechanism of semantic links network in this method below.In essence, the construction process of the similar multiway tree of the construction process of a semantic links network.Tree root is exactly one section text that will be described with semantic chain network, and branch is the type of various semantic links networks or the address information and the semantic information of some semantic links, but leaf can only be made up of hypertext link.Concrete structure is as follows:
<Entity PredecessorID＝string PredecessorText＝string>
<SemanticRelation>
<Similar-to>
Link specification
</Similar-to>
<Sequential>
Link specification
</Sequential>
<Reference>
Link specification
</Reference>
<SubType>
Link specification
</SubType>
<Instance>
Link specification
</Instance>
<Cause-effective>
Link specification
</Cause-effective>
<Implication>
Link specification
</Implication>
</SemanticRelation>
</Entity>，
Wherein " Link Specification " is defined as follows:
<Link>
<SuccessorID> </SuccessorID>
<SuccessorText> </SuccessorText>
</Link>
...
<Link>
<SuccessorID> </SuccessorID>
<SuccessorText> </SuccessorText>
</Link>
Any one semantic links all exists forerunner's node and descendant node.In the superincumbent data structure, these two nodes use " PredecessorID " and " SuccessorID " to represent respectively.The value of these two marks is to safeguard automatically in the method." PredecessorText " and " SuccessorText " refers to the content of text of forerunner's node and descendant node representative.May there be multiple semantic relation between forerunner's node and the descendant node, " Similar-to ", " Cause-effective " above Here it is described in the data structure, " Instance " and " Subtype " or the like.The constructing semantic chain network is to follow following order: the text of forerunner's node---the various semantic types that exist between forerunner's node and the descendant node---text of descendant node.The text of descendant node may become the text of next forerunner's node again on this basis, has so just formed the recurrence of a semantic links structure, finally forms a semantic links network.If but the descendant node of semantic links points to a hypertext link (not only having text but also have hypertext link) in the semantic links network, this semantic links network stops in this semantic relation branch so.
The verification of semantic links network is meant the verification carried out according to above-mentioned data structure and the verification of relevant semantic links mark in the method.If finding the semantic links network in checking procedure is not to construct according to the form of above-mentioned data structure, this method can point out the user to re-construct.Verification to the semantic links mark mainly is that the verification semantic links mark whether to intersect nested.For instance, suppose that we have two sections text text1 and text2, we have carried out semantic marker Mark1 and Mark2 to text1 and text2 respectively.Then following mark result is wrong:＜Mark1〉text1＜Mark2〉＜/Mark1〉text2＜/Mark2 〉.Because there is the place that intersects in their tag definitions, this does not meet the syntax rule of extending mark language.
This method is when storage semantic links network, and content of document (data file) and semantic links (semantic links network file) leave in respectively in two files, and all are to store with the form of extending mark language.Like this can be easy-to-look-up, improve the accuracy of retrieval.
For the structure of the semantic links network of image type, the building method of the semantic links network of its building method and universal class is basic identical, but for the ease of selecting suitable picture, the semantic links network of image type the has constituted process integration method for previewing of image.
This method has proposed the result of browse that two kinds of inference methods strengthen the semantic links network, and these two kinds of methods are respectively coarsegrain reasoning and small grain size reasoning.The coarsegrain reasoning mainly is to find out the abundantest one of semantic information from the set of a semantic links network, has mainly adopted the matching technique in the graph theory.At first each semantic links cyberspeak justice chain network matrix representation is come out from the angle that realizes.The representative of the row and column of semantic links network matrix be each node in the semantic links network, each element representative of matrix be all semantic relations between corresponding two nodes.The semantic links network matrix has been arranged, judged that the problem that concerns between each semantic links network just is converted to the problem of judging between each semantic links network matrix that concerns.Be to judge the core algorithm that has relation between these two matrixes below.Suppose two semantic links networks be G1=(V1, E1) and G2=(V2, E2), if V1 V2, and each the bar limit among the E1 is all in E2, so G1 G2.Be to contain the semantic relation abundanter in the semantic links network G 2 than G1.In view of the above, can be divided into the relation between two semantic links networks five kinds: relation of inclusion (to two orderly semantic links nexus right＜G1, G2 〉, point among the G1 and limit are all in G2), oppositely relation of inclusion, relation of equality, overlapping relation and void relation (no converging relation).Certainly when the specific implementation algorithm, the core concept of above-mentioned algorithm to be come out and could be used on computers with semantic chain network matrix description.The small grain size reasoning meaning is to find out and all semantic links that semantic links are relevant according to the inference rule of semantic links in the set of a semantic links network.Illustrate with an example below.Suppose to exist a semantic links V
1→ V
2, V
1And V
2Between have cause-effect relationship (ce).The target of small grain size reasoning is found out all with V in the set of a semantic links network
2For forerunner's node and have causal semantic links or the descendant node of the semantic links found out with the front as forerunner's node and have causal semantic links.Be the algorithm of small grain size reasoning below.At first will
Be put in the formation, then following operation carried out in this formation.
1) if this formation is empty, return results collection ResultSet.
2) if this formation non-NULL, the rule of taking out the formation head is designated as
Should advise simultaneously
Then put into result set ResultSet.
3) from the semantic links collection of network, find out all with V
tFor forerunner's node and have causal semantic links, then these semantic links are put into rear of queue.
Realizing that aspect the browsing of semantic links network, this method has proposed general explanation mould plate technique.Be exactly the file that generates a HTML (Hypertext Markup Language) form particularly, to analyze and explain each mark that may occur when the structure of semantic links network and other semantic marker in this document, be converted into the file of HTML (Hypertext Markup Language) form then according to the implication of respective markers, in the process of explaining, will add the reasoning information of semantic links network simultaneously.In order when browsing, to show more semantic information, in the process of changing, adopted the structure technology of browsing of tree type.In HTML (Hypertext Markup Language), tree type browser technology is very ripe, specifically can be with reference to relevant technical documentation.
The document of Sheng Chenging can be browsed by current various browsers at last.
Claims (9)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100302807A CN100362514C (en) | 2004-03-23 | 2004-03-23 | A Method for Constructing and Navigating Semantic Chains |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100302807A CN100362514C (en) | 2004-03-23 | 2004-03-23 | A Method for Constructing and Navigating Semantic Chains |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1564161A CN1564161A (en) | 2005-01-12 |
| CN100362514C true CN100362514C (en) | 2008-01-16 |
Family
ID=34481072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100302807A Expired - Fee Related CN100362514C (en) | 2004-03-23 | 2004-03-23 | A Method for Constructing and Navigating Semantic Chains |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100362514C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101917413A (en) * | 2010-07-29 | 2010-12-15 | 清华大学 | Service assembly system and method based on service quality optimization and semantic information integration |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8468048B2 (en) * | 2005-04-22 | 2013-06-18 | Google Inc. | Suggesting targeting information for ads, such as websites and/or categories of websites for example |
| CN100585591C (en) * | 2005-07-15 | 2010-01-27 | 国际商业机器公司 | Systems and methods for enabling interactive browsing |
| CN100399335C (en) * | 2005-11-15 | 2008-07-02 | 李利鹏 | Method for converting source file to target web document |
| CN102004799B (en) * | 2010-12-28 | 2012-10-03 | 天津神舟通用数据技术有限公司 | Consistency check method for redundant data of database |
| CN102096715A (en) * | 2011-02-11 | 2011-06-15 | 深圳市同洲电子股份有限公司 | Method and system for acquiring webpage template, and method and system for generating single website |
| CN110781679B (en) * | 2019-10-15 | 2023-09-15 | 上海大学 | News event keyword mining method based on associated semantic chain network |
| CN110765777B (en) * | 2019-10-17 | 2023-09-15 | 上海大学 | Event correlation degree calculation method based on associated semantic chain network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1286447A (en) * | 1999-08-26 | 2001-03-07 | 国际商业机器公司 | System and method for incorperating semantic characteristics into syntax file code transformation architecture |
| WO2001035235A1 (en) * | 1999-11-09 | 2001-05-17 | Vocal Point, Inc. | System and method for accessing web content using limited display devices |
| US6249794B1 (en) * | 1997-12-23 | 2001-06-19 | Adobe Systems Incorporated | Providing descriptions of documents through document description files |
| WO2003001413A1 (en) * | 2001-06-22 | 2003-01-03 | Nosa Omoigui | System and method for knowledge retrieval, management, delivery and presentation |
| CN1428033A (en) * | 2000-03-07 | 2003-07-02 | 日本电信电话株式会社 | Semantic information network |
-
2004
- 2004-03-23 CN CNB2004100302807A patent/CN100362514C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6249794B1 (en) * | 1997-12-23 | 2001-06-19 | Adobe Systems Incorporated | Providing descriptions of documents through document description files |
| CN1286447A (en) * | 1999-08-26 | 2001-03-07 | 国际商业机器公司 | System and method for incorperating semantic characteristics into syntax file code transformation architecture |
| WO2001035235A1 (en) * | 1999-11-09 | 2001-05-17 | Vocal Point, Inc. | System and method for accessing web content using limited display devices |
| CN1428033A (en) * | 2000-03-07 | 2003-07-02 | 日本电信电话株式会社 | Semantic information network |
| WO2003001413A1 (en) * | 2001-06-22 | 2003-01-03 | Nosa Omoigui | System and method for knowledge retrieval, management, delivery and presentation |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101917413A (en) * | 2010-07-29 | 2010-12-15 | 清华大学 | Service assembly system and method based on service quality optimization and semantic information integration |
| CN101917413B (en) * | 2010-07-29 | 2013-07-17 | 清华大学 | Service assembly system and method based on service quality optimization and semantic information integration |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1564161A (en) | 2005-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sahuguet et al. | Building intelligent web applications using lightweight wrappers | |
| Jäschke et al. | Tag recommendations in social bookmarking systems | |
| JP4267336B2 (en) | Method, system and program for generating structure pattern candidates | |
| Jarrar et al. | A query formulation language for the data web | |
| US20090144302A1 (en) | Web application for argument maps | |
| US8775356B1 (en) | Query enhancement of semantic wiki for improved searching of unstructured data | |
| WO2008021561A2 (en) | Joint optimization of wrapper generation and template detection | |
| JP2004240954A (en) | How to present hierarchical data | |
| CN102016887A (en) | Method, system and computer program for user-driven semantic web and dynamic generation of media composition | |
| MX2008015483A (en) | Automatically generating web forms from database schema. | |
| Hachicha et al. | A survey of XML tree patterns | |
| CN102982095B (en) | A kind of body automatic creation system based on thesaurus and method thereof | |
| CN101114291A (en) | An Approximate Query Method Based on Diversity XML Documents | |
| CN100362514C (en) | A Method for Constructing and Navigating Semantic Chains | |
| Mehler et al. | Towards logical hypertext structure: a graph-theoretic perspective | |
| CN101192220A (en) | Tag construction method and system | |
| Lv et al. | Mapping DTDs to relational schemas with semantic constraints | |
| Bry et al. | Data retrieval and evolution on the (semantic) web: A deductive approach | |
| Rigaux et al. | SeLeNe report: metadata management and learning object composition in a self eLearning network | |
| Brophy | OWL-PL: A presentation language for displaying semantic data on the web | |
| Zhang et al. | Odaies: ontology-driven adaptive Web information extraction system | |
| CN101364234A (en) | A Quick Finding Method for the Lowest Common Ancestor of XML Keyword Retrieval | |
| Zhuge et al. | Modeling language and tools for the semantic link network | |
| Sierra et al. | Tagging learning objects with evolving metadata schemas | |
| Kim et al. | Efficient processing of regular path joins using PID |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: BEIJING ZHONGKE HUILIAN INFORMATION TECHNOLOGY CO. Free format text: FORMER OWNER: INSTITUTE OF COMPUTING TECHNOLOGY, CHINESE ACADEMY OF SCIENCES Effective date: 20121224 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100080 HAIDIAN, BEIJING TO: 100083 HAIDIAN, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20121224 Address after: North Fourth Ring Road 100083 Beijing Haidian District City 229 Haitai building 527 Patentee after: Beijing Zhongke Huilian Information Technology Co., Ltd. Address before: 100080 No. 6 South Road, Zhongguancun Academy of Sciences, Beijing Patentee before: Institute of Computing Technology, Chinese Academy of Sciences |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080116 Termination date: 20160323 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |