文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Running Head Word Association Spaces 1 Word Association Spaces Semantic Spaces based on Fre
侵权投诉

Running Head Word Association Spaces 1 Word Association Spaces Semantic Spaces based on Fre

Running Head Word Association Spaces 1 Word Association Spaces Semantic Spaces based on Free Association that Predict Memory Performance Send correspondence to

Semantic Spaces based on Free Association Norms: Predicting Memory Performance

An increasingly common assumption of theories of memory is that the meaning of a word

can be represented by a vector which places a word as a point in a multidimensional semantic

space (Bower, 1967; Landauer & Dumais, 1997; Lund & Burgess, 1996; Morton, 1970; Norman,

& Rumelhart, 1970; Osgood, Suci, & Tannenbaum, 1957; Underwood, 1969; Wickens, 1972).

The main requirement of such spaces is that words that are similar in meaning are represented by

similar vectors. Representing words as vectors in a multidimensional space allows simple

geometric operations such as the Euclidian distance or the angle between the vectors to compute

the semantic (dis)similarity between arbitrary pairs or groups of words. This representation

makes it possible to make predictions about performance in psychological tasks where the

semantic distance between pairs or groups of words is assumed to play a role.

One recent framework for placing words in a multidimensional space is Latent Semantic

Analysis or LSA (Derweester, Dumais, Furnas, Landauer, & Harshman, 1990; Landauer &

Dumais, 1997; Landauer, Foltz, & Laham, 1998). The main assumption is that similar words

occur in similar contexts with context defined as any connected set of text from a corpus such as

an encyclopedia, or samples of texts from textbooks. For example, a textbook with a paragraph

about “cats” might also mention “dogs”, “fur”, “pets” etc. This knowledge can be used to

assume that “cats” and “dogs” are related in meaning. However, some words are clearly related

in meaning such as “cats” and “felines” but they might never occur simultaneously in the same

context. Such words are related primarily through indirect links because they share similar

contexts. The technique of singular value decomposition (SVD) can be applied to the matrix of

word-context co-occurrence statistics. In this procedure, the direct and indirect relationships

between words and contexts in the matrix are analyzed with simple matrix-algebraic operations

上一页第3页

你可能喜欢

热门文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email