In this paper we study the connection between the structure and properties of the so-called free association network of the English language, and the solution of psycholiguistical Remote Association Tests (RATs). We show that average hardness of individual RATs is largely determined by the relative positions of the test words (stimuli and response) on the free association network. We argue that  solution of RATs can be interpreted as a first passage search problem on a free association network and study a variety of different search algorithms. We demonstate that in easy RATs (those solved by more than 64 \% subjects in 15 seconds) there are strong links directly connecting stimuli and response, and thus an efficient strategy consist in activating these direct links. In turn, the most efficient mechanism of solving medium and hard RATs consists of preferentially following what we call "moderately weak" associations. \\%DIF > subjects) the solution is governed by "strong" network links (i.e. strong associations) directly connecting stimuli and response, and thus the efficient strategy consist in activating such strong links. In turn, the most efficient mechanism of solving medium and hard RATs consists of preferentially following sequence of "moderately weak" associations.
We study correlations between the structure and properties of a free association network of the English language, and solutions of psycholinguistic Remote Association Tests (RATs). We show that average hardness of individual RATs is largely determined by relative positions of test words (stimuli and response) on the free association network. We argue that the solution of RATs can be interpreted as a first passage search problem on a network whose vertices are words and links are associations between words. We propose different heuristic search algorithms and demonstrate that in "easily-solving" RATs (those that are solved in 15 seconds by more than 64 \\%DIF > subjects) the solution is governed by "strong" network links (i.e. strong associations) directly connecting stimuli and response, and thus the efficient strategy consist in activating such strong links. In turn, the most efficient mechanism of solving medium and hard RATs consists of preferentially following sequence of "moderately weak" associations.
R
In this paper we study the connection
We study correlations
R
the so-called
a
R
the solution of psycholiguistical
solutions of psycholinguistic
D
the
D
the
A
the
R
free association network and study a variety of different search algorithms. We demonstate that in easy
network whose vertices are words and links are associations between words. We propose different heuristic search algorithms and demonstrate that in "easily-solving"
R
solved
that are solved in 15 seconds
D
\% subjects in 15 seconds) there are strong links directly connecting stimuli and response, and thus an efficient strategy consist in activating these direct links. In turn, the most efficient mechanism of solving medium and hard RATs consists of preferentially following what we call "moderately weak" associations.