Thesis Details

Počítač jako inteligentní spoluhráč ve slovně-asociační hře Krycí jména

Bachelor's Thesis Student: Jareš Petr Academic Year: 2018/2019 Supervisor: Smrž Pavel, doc. RNDr., Ph.D.
English title
Computer as an Intelligent Partner in the Word-Association Game Codenames
Language
Czech
Abstract

This thesis solves a determination of semantic similarity between words. For this task is used a combination of predictive model fastText and count based method Pointwise Mutual Information. Thesis describes a system which utilizes semantic models for ability to substitue a player in a word association game Codenames. The system has implemented game strategy enabling use of context information from the game progression to benefit his own team. The system is able to substitue a player in both team roles.

Keywords

natural language processing, semantic similarity, Codenames, artificial player, fastText, Pointwise Mutual Information, Python

Department
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
10 June 2019
Reviewer
Committee
Smrž Pavel, doc. RNDr., Ph.D. (DCGM FIT BUT), předseda
Fučík Otto, doc. Dr. Ing. (DCSY FIT BUT), člen
Holík Lukáš, doc. Mgr., Ph.D. (DITS FIT BUT), člen
Szőke Igor, Ing., Ph.D. (DCGM FIT BUT), člen
Veselý Vladimír, Ing., Ph.D. (DIFS FIT BUT), člen
Citation
JAREŠ, Petr. Počítač jako inteligentní spoluhráč ve slovně-asociační hře Krycí jména. Brno, 2019. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2019-06-10. Supervised by Smrž Pavel. Available from: https://www.fit.vut.cz/study/thesis/21503/
BibTeX
@bachelorsthesis{FITBT21503,
    author = "Petr Jare\v{s}",
    type = "Bachelor's thesis",
    title = "Po\v{c}\'{i}ta\v{c} jako inteligentn\'{i} spoluhr\'{a}\v{c} ve slovn\v{e}-asocia\v{c}n\'{i} h\v{r}e Kryc\'{i} jm\'{e}na",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2019,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/21503/"
}
Back to top