Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm Full article
| Journal |
Studies in Computational Intelligence
ISSN: 1860-949X , E-ISSN: 1860-9503 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2026, Volume: 1280, Pages: 113-125 Pages count : 13 DOI: 10.1007/978-3-032-21143-9_6 | ||||
| Tags | Mathematical linguistics, Skolem functions, generalized quantifiers, negative concord, negative indefinites | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0012 |
Abstract:
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.
Cite:
Zaitseva U.
, Stukachev A.
Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm
Studies in Computational Intelligence. 2026. V.1280. P.113-125. DOI: 10.1007/978-3-032-21143-9_6
Skolem Functions for Russian Negative Concord: Developing Preprocessing Algorithm
Studies in Computational Intelligence. 2026. V.1280. P.113-125. DOI: 10.1007/978-3-032-21143-9_6
Dates:
| Published online: | May 24, 2026 |
Identifiers:
No identifiers