Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm | Sciact - Система учета научной деятельности ИМ СО РАН

Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm Научная публикация

Журнал

Studies in Computational Intelligence
ISSN: 1860-949X , E-ISSN: 1860-9503

Вых. Данные

Год: 2025,

Ключевые слова

Mathematical linguistics, Skolem functions, generalized quantifiers, negative concord, negative indefinites

Авторы

Zaitseva Ulyana ¹ , Stukachev Alexey ^1,2

Организации

1	Novosibirsk State University
2	Sobolev Institute of Mathematics

Информация о финансировании (1)

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0012

In linguistics and mathematics, the phenomenon of negative concord presents a challenge for analysis using the methods of formal semantics, particularly when relying on the principle of compositionality. For the Russian language, we propose a potential solution for formalizing sentences with negative concord. This solution involves a linguistic pre-processing of the sentences, followed by the application of a mathematical tool: Skolem functions. This paper presents an algorithm for the linguistic pre-processing of Russian sentences with canonical word order (subject-verb-object) and discusses how Skolem functions can be applied to formally represent negative concord. This approach allows for a more precise analysis and formalization of the semantic structure of certain linguistic phenomena in the Russian language.

Zaitseva U. , Stukachev A.
Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm
Studies in Computational Intelligence. 2025.

Нет идентификаторов

Пока нет цитирований