检索结果-内蒙古大学图书馆

2012 IEEE 2nd International Conference on cloud computing and Intelligence Systems

作者： Quanchao Liu Heyan Huang Changzhi Wang Chong Feng Beijing Engineering Applications Research Center of High Volume Language Information Processing and Cloud Computing Beijing Institute of Technology

We propose an algorithm of automatically identifying maximal-length evaluation (MEP) based on statistics and rules. The principle of the algorithm is that transform the problem of evaluation phrase recognition into a sequence tagging problem, use conditional random fields model for recognizing simple structure phrase of evaluation, and then automatically identify MEP with complex structure based on the establishment and application of the rule base. The testing precision and recall rate reached 72.38%. Based on the work above, we proposed a new algorithm of automatically extracting collocation of evaluation based on rules and make the automatic extraction of evaluation object and the MEP become reality. Experiment was conducted at Netease car portal for test, and got a higher accuracy rate.

关键词： Maximal-length evaluation phrase Conditional random fields Sentiment evaluation unit Collocation of evaluation Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Domain Assignment BaseC on Word-Gloss

引用

China Communications 2012年第3期9卷 19-27页

作者：朱朝勇黄河燕史树敏 School of Computer Science and Technology University of Science and Technology of China School of Computer Science and Technology Beijing Institute of Technology Beijing Engineering Research Center of High Volume Language Information Processing & Cloud Computing Applications Beijing Institute of Technology

This paper proposes a hierarchical word domain assignment algorithm to automatically build domain dictionaries from Machine-Readable Dictionary(MRD).The process for word domain assignment can be divided into three steps:1) Hierarchical structure constructing;2) Classifier training;3) Word domain *** with the traditional methods,the hierarchical word domain assignment algorithm enhances the accuracy of word domain assignment while reducing human efforts on collecting *** on WordNet 2.0 show that 62.53% of the first domain labels are matched with the WordNet Domains 3.0 by using gloss-based word domain assignment,and the performance can be further improved by utilizing the hierarchical relationships among the domain sets.

关键词： natural language processing domaindictionary hierarchical classification domain as-sigrmaent WordNet MRD

来源：评论

学校读者我要写书评

暂无评论

Combining CCG parsing and DL for Chinese question answering

引用

International Journal of Advancements in computing Technology 2012年第23期4卷 755-765页

作者： Li, Peng Liao, Lejian Wang, Liu Wang, Sheyang Beijing Engineering Research Centre High Volume Language Information Processing and Cloud Computing Applications School of Computer Science Beijing Institute of Technology Beijing 100081 China

This paper presents a novel Web Question Answering(WQA) approach based on the combination of Combinatory Categorial Grammar (CCG), Description Logic (DL) ontology and Web Service (WS), in order to promote semantic-level accuracy through deep text understanding and improve the solutions for non-WH questions. Our framework transforms a question answering problem into a service planning problem for which HTN planner-SHOP2 is used. It addresses transition from natural language to semantic expression and dynamical composition of web services via planning, and execution of the web services planning. We propose to take DL based semantic modeling, i.e., translating lambda-expression encoding of question meaning into DL based semantic representations. The advantage of such approach is a seamless exploitation of existing semantic resource coded as DL ontology, which is widespread in such areas as Semantic Web and conceptual modeling. The experiments are conducted with a repository of complex Chinese questions which involves the satisfaction of some object property restrictions. The experimental results show that producing the semantic representations with the combination of CCG parsing and DL reasoning is an effective approach for question understanding at semantic level, in terms of both understanding accuracy promotion and semantic resource exploitation.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A hierarchy-based constraint dependency grammar parsing for Chinese

A hierarchy-based constraint dependency grammar parsing for ...

引用

International Conference on Audio, language and Image processing, ICALIP

作者： Peng Li Lejian Liao Xin Li Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology Beijing China

Constraint Dependency Grammar (CDG) is a well known formalism which represents the grammatical rules as constraints on dependency relations. It reduces the structural ambiguities via constraint-propagation instead of generating individual parse trees as the conventional works. In our previous work, we have successfully adopted CDG in Chinese [5]. In this paper, we tend to further explore the nature of the constraints for Chinese CDG. We propose to develop a schema of three hierarchies for the constraints, namely in-the-phrase, between-the-phrase and between-the-simple-sentence, which is based on a study of constraints in corpus with a prior knowledge. With this proposed schema, we could further diminish the ambiguities caused by the originally defined constraints which is lack of hierarchical grammar information considered, The experiments are conducted and the results support our claims.

关键词： Grammar Syntactics Filtering information processing Educational institutions Semantics Presses

来源：评论

学校读者我要写书评

暂无评论

Web Question Answering based on CCG parsing and DL ontology

Web Question Answering based on CCG parsing and DL ontology

引用

International Conference on information Science and Digital Content Technology

作者： Peng Li Lejian Liao Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Multi-living-agent Information System Key Laboratory and Beijing Laboratory of Intelligent Information Technology School of Computer Scienc

ISBN: (纸本)9781467312882

This paper presents a novel WQA (Web Question Answering) approach based on the combination CCG (Combinatory Categorial Grammar) and DL (Description Logic) ontology, in order to promote semantic-level accuracy through deep text understanding capabilities. We propose to take DL based semantic modeling, i.e., translating lambda-expression encoding of question meaning into DL based semantic representations. The advantage of such approach is a seamless exploitation of existing semantic resource coded as DL ontology, which is widespread in such area as the Semantic Web and conceptual modeling. The experiments are conducted with a repository of complex Chinese questions which involves the satisfaction of some object property restrictions. The experimental results show that producing the semantic representations with the combination of CCG parsing and DL reasoning is an effective approach for question understanding at semantic level, in terms of both understanding accuracy promotion and semantic resource exploitation.

关键词： Semantics Ontologies Syntactics Grammar Cognition Accuracy Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science（ICSESS 2012）

作者： Mohammed Lamine Beggar Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution language (BPEL) is a language used to specify compositions of web *** the last few years,a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for *** nets and formal languages have been widely used to model Web services composition,but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several *** BPEL programs are mapped to other languages and then the verification is performed,A more promising way is to directly build TVPCCS model,to check it and then map it to a BPEL process *** paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services,BPEL,TVPCCS,process algebra.

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science(第三届IEEE软件工程与服务科学国际会议 ICSESS2010)

作者： Mohammed Lamine Beggar Liao Lejian Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution language (BPEL) is a language used to specify compositions of web services. In the last few years, a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for BPEL. Petri nets and formal languages have been widely used to model Web services composition, but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several reasons. Generally BPEL programs are mapped to other languages and then the verification is performed, A more promising way is to directly build TVPCCS model, to check it and then map it to a BPEL process model. This paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services BPEL TVPCCS process algebra

来源：评论

学校读者我要写书评

暂无评论

Chinese Parsing Model Based on Constraint Dependency Grammar

Chinese Parsing Model Based on Constraint Dependency Grammar

引用

International Conference on Consumer Electronics, Communications and Networks

作者： Peng Li Lejian Liao Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology

ISBN: (纸本)9781457714146

Constraint Dependency Grammar (CDG) is a formalism representing grammatical rules as constraints on dependency relations. It reduces the structural ambiguity via constraint-propagation without generating individual parse trees. In this paper, we propose a high quality parsing model for Chinese, which defines the phrase molecule lexicalizing the CDG at the word-level. Ternary constraints are used to improve the accuracy and efficiency of parsing.

关键词： Constraint Dependency Grammar Parsing Chinese

来源：评论

学校读者我要写书评

暂无评论

Contracting of E-Business Services in a Constraint- Based Process Modeling Framework

Contracting of E-Business Services in a Constraint- Based Pr...

引用

The Seventh International Conference on Semantics,Knowledge,and Grids(第七届语义、知识与网格国际会议 SKG 20110)

作者： Ruoyu Chen Lejian Liao Zhi Fang Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing 100081 Chi

Analyzing and contracting of E-Business service processes is a crucial step between discovery and execution of Semantic Web Services. This paper proposes a service modelling framework consists of constraint-based service contract, agent style communication messages and service process specification. Service contract is used as shared knowledge between participants and instrument for advertising and requesting of services. The Constraint Process Specification proposed is capable of describing complex data and control-flow restrictions as well as data content restrictions. A state transition based operational semantic for this framework is given. A virtual machine is built for analyzing and contracting of services. We illustrate the expressiveness of this framework within an online shopping scenario.

关键词： Semantic Web Service Service Contracting Constraint Process Specification

来源：评论

学校读者我要写书评

暂无评论

Unsupervised word sense disambiguation using neighborhood knowledge

PACLIC 25 - Proceedings of the 25th Pacific Asia Conference ...

引用

PACLIC 25 - Proceedings of the 25th Pacific Asia Conference on language, information and Computation 2011年 333-342页

作者： Heyan, Huang Zhizhuo, Yang Ping, Jian Beijing Engineering Applications Research Center of High Volume Language Information Processing and Cloud Computing Beijing Institute of Technology No.5 Yard Zhong Guan Cun South Street Haidian District Beijing 100081 China Department of Computer Science Beijing Institute of Technology No.5 Yard Zhong Guan Cun South Street Haidian District Beijing 100081 China

ISBN: (纸本)9784905166023

Usually ambiguous words contained in article appear several times. Almost all existing methods for unsupervised word sense disambiguation make use of information contained only in ambiguous sentence. This paper presents a novel approach by considering neighborhood knowledge. The approach can naturally make full use of the within-sentence relationship from the ambiguous sentence and cross-sentence relationship from the neighborhood knowledge. Experimental results indicate the proposed method can significantly outperform the baseline method. © 2011 by Huang Heyan, Yang Zhizhuo, Jian Ping.

关键词： information use

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：