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

Accessing world knowledge: Evidence from N400 and reaction time priming

COGNITIVE BRAIN RESEARCH 2005年第3期25卷 589-606页

作者： Chwilla, DJ Kolk, HHJ Radboud Univ Nijmegen Nijmegen Inst Cognit & Informat NL-6500 HE Nijmegen Netherlands

How fast are we in accessing world knowledge? In two experiments, we tested for priming for word triplets that described a conceptual script (e.g., DIRECTOR-BRIBE-DISMISSAL) but were not associatively related and did not share a category relationship. Event-related brain potentials were used to track the time course at which script information becomes available. In Experiment 1, in which participants made lexical decisions, we found a facilitation for script-related relative to unrelated triplets, as indicated by (i) a decrease in both reaction time and errors, and (ii) an N400-like priming effect. In Experiment 2, we further explored the locus of script priming by increasing the contribution of meaning integration processes. The participants' task was to indicate whether the three words presented a plausible scenario. Again, an N400 script priming effect was obtained. Directing attention to script relations was effective in enhancing the N400 effect. The time course of the N400 effect was similar to that of the standard N400 effect to semantic relations. The present results show that script priming can be obtained in the visual modality, and that script information is immediately accessed and integrated with context. This supports the view that script information forms a central aspect of word meaning. The RT and N400 script priming effects reported in this article are problematic for most current semantic priming models, like spreading activation models, expectancy models, and task-specific semantic matching/integration models. They support a view in which there is no clear cutoff point between semantic knowledge and world knowledge. (c) 2005 Elsevier B.V. All rights reserved.

关键词： language semantic priming ERP N400 semantic knowledge world knowledge postlexical integration model spreading activation distributed memory model

来源：评论

学校读者我要写书评

暂无评论

Sentiment Classification System of Twitter Data for US Airline Service Analysis 42

Sentiment Classification System of Twitter Data for US Airli...

引用

42nd Annual IEEE-Computer-Society Computers, Software and Applications (COMPSAC) Conference - Staying Smarter in a Smartening World

作者： Rane, Ankita Kumar, Anand BITS Pilani Comp Sci & Engn Dubai Campus Dubai U Arab Emirates BITS Pilani Elect & Elect Engn Dubai Campus Dubai U Arab Emirates

ISBN: (纸本)9781538626672

The airline industry is a very competitive market which has grown rapidly in the past 2 decades. Airline companies resort to traditional customer feedback forms which in turn are very tedious and time consuming. This is where Twitter data serves as a good source to gather customer feedback tweets and perform a sentiment analysis. In this paper, we worked on a dataset comprising of tweets for 6 major US Airlines and performed a multi-class sentiment analysis. This approach starts off with pre-processing techniques used to clean the tweets and then representing these tweets as vectors using a deep learning concept (Doc2vec) to do a phrase-level analysis. The analysis was carried out using 7 different classification strategies: Decision Tree, Random Forest, SVM, K-Nearest Neighbors, Logistic Regression, Gaussian Naive Bayes and AdaBoost. The classifiers were trained using 80% of the data and tested using the remaining 20% data. The outcome of the test set is the tweet sentiment (positive/negative/neutral). Based on the results obtained, the accuracies were calculated to draw a comparison between each classification approach and the overall sentiment count was visualized combining all six airlines.

关键词： Machine Learning Classification techniques Deep Learning distributed memory model

来源：评论

学校读者我要写书评

暂无评论

An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer

引用

Parallel Algorithms and Applications 1995年第1-2期5.0卷 15-35页

作者： Kim, Myung-Ho Jeong, Chang-Sung Department of Computer Science Pohang Kyungbuk Province 790-784 POSTECH San 31 Hyoja-dong South Korea Department of Electronics Engineering Korea University Sungbuk-ku Seoul 136 1 5-ka Anam-dong South Korea

In this paper, we address the problem of finding a maximum matching for a convex bipartite graph on a mesh-connected computer (MCC). We shall show that this can be done in optimal time on MCC by designing the efficient merge and division schemes in bottom-up and top-down approach respectively. © 1995, Taylor & Francis Group, LLC. All rights reserved.

关键词： Convex bipartite graph distributed memory model Maximum matching Mesh-connected computer Parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer*

引用

Parallel Algorithms and Applications 1995年第2-3期6卷 129-141页

作者： Kim, Myung-Ho Jeong, Chang-Sung Parallel Programming Section ETRI TaeJon 305-350 161 Kajong-Dong Yusong-Gu South Korea Department of Electronics Engineering Korea University Sungbuk-Ku Seoul 136 15-Ka Anam-dong South Korea

关键词： Convex bipartite graph distributed memory model Maximum matching Mesh-connected computer Parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：