Description Usage Arguments Details Value Author(s) References See Also Examples
Computes vectors for complex expressions of type PREDICATE[ARGUMENT] by applying the method of Kintsch (2001) (see Details).
1  Predication(P,A,m,k,tvectors=tvectors,breakdown=TRUE,norm="none")

P 
Predicate of the expression, a single word (character vector) 
A 
Argument of the expression, a single word (character vector) 
m 
number of nearest words to the Predicate that are initially activated 
k 
size of the 
tvectors 
the semantic space in which the computation is to be done (a numeric matrix where every row is a word vector) 
breakdown 
if 
norm 
whether to 
The vector for the expression is computed following the Predication Process by Kintsch (2001):
The m
nearest neighbors to the Predicate are computed. Of those, the k
nearest neighbors to
the Argument are selected. The vector for the expression is then computed as the sum of
Predicate vector, Argument vector, and the vectors of those k
neighbors (the k
neighborhood).
An object of class Pred
: This object is a list consisting of:

The vector for the complex expression as described above 

The vector for Predicate plus the kneighborhoodvectors without the Argument vector 

The words in the kneighborhood. 

The Predicate given as input 

The Argument given as input 
Fritz G?nther
Kintsch, W. (2001). Predication. Cognitive science, 25, 173202.
cosine
,
neighbors
,
multicos
,
compose
1 2 3  data(wonderland)
Predication(P="mad",A="hatter",m=20,k=3,tvectors=wonderland)

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.