|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Testsстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 1 сентября 2021 г.
- Авторы: Valba Olga, Gorsky Alexander, Nechaev Sergei, Tamm Mikhail
- Журнал: PLoS ONE
- Том: 16
- Номер: 4
- Год издания: 2021
- Издательство: Public Library of Science
- Местоположение издательства: United States
- Номер статьи: e0248986
- DOI: 10.1371/journal.pone.0248986
- Аннотация: 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% 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.
- Добавил в систему: Тамм Михаил Владимирович
Прикрепленные файлы
| № | Имя | Описание | Имя файла | Размер | Добавлен |
|---|---|---|---|---|---|
| 1. | Полный текст | journal.pone.0248986.pdf | 1,5 МБ | 31 августа 2021 [thumm.m] |