Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Larisa S. Modina

dblp:97/5239 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
context-free languages		 0.011977
On Three Types of Unambiguity of Context-Free Languages · ICALP 1977
Automata and formal languages › context-free languages
unambiguity		 0.011977
On Three Types of Unambiguity of Context-Free Languages · ICALP 1977
YearPublicationVenuePosition
1994 The JaRAP Experimental System Of Japanese-Russian Automatic Translation
Larisa S. Modina, Zoya M. Shalyapina
 COLING1
1977 On Three Types of Unambiguity of Context-Free Languages
Alexandre Ja. Dikovsky, Larisa S. Modina
 ICALP2
1975 On Some Formal Grammars Generating Dependency Trees
Larisa S. Modina
 MFCS1