title: Cooperative game theory methods for determining text complexity
metadata.name: dc.contributor.author
metadata.value: Khitryi, Andrei V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Mazalov, Vladimir V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Bure, Natalia A.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Drobnaya, Polina V.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2024-02-19T13:52:18Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2024-02-19T13:52:18Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2023-12
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Khitryi A. V., Mazalov V. V., Bure N. A., Drobnaya P. V. Cooperative game theory methods for determining text complexity. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2023, vol. 19, iss. 4, pp. 509–521. https://doi.org/10.21638/11701/spbu10.2023.407 (In Russian)
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2023.407
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/44908
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: We propose a method for estimating the complexity of texts based on the methods of cooperative
  game theory. The players in this game are the lengths of words in the text. The
  game itself is represented as a voting game in which the value of a player is determined by
  the number of coalitions in which the player is key. The ranks of the players are formed by
  computing the Shepley—Schubik value or the Banzaf index in a voting game with a given
  voting threshold. Thus, a vector of Shepley—Schubik or Banzaf values is assigned to each
  text. After that, the vector space is used to rank the texts in terms of complexity based on
  the expert evaluations obtained in this domain.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This work was founded by the Russian Science Foundation (project N 22-11-00051,
  https://rscf.ru/project/22-11-00051/).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 19; Issue 4
metadata.lang: -
metadata.name: dc.subject
metadata.value: text processing
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: voting game
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Shepley—Schubik value
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Banzaf power index
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: klasterization
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Cooperative game theory methods for determining text complexity
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 07.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/44908/1/07.pdf
resources.format: Adobe PDF
resources.size: 277,42 kB