Elitsa Yotkova
MSc student, Information Retrieval & Knowledge Discovery · Sofia University
Hi! I'm Elitsa. I'm interested in the robustness of LLM judges, evaluation, and the broader questions of frontier AI safety.
At Sofia University I work with Dr. Dimitar Dimitrov, Prof. Ivan Koychev and Prof. Preslav Nakov (MBZUAI). Previously a software engineering intern at Google (Zurich) and Uber (Amsterdam & Sofia).
I also collaborate with Violeta Kastreva (ETH Zurich) on recent research.
- LLM-as-a-Judge
- Agent-as-a-Judge
- Robustness of evaluators
- Benchmark design
Publications
-
How Correct Is Your Answer? A Semantic Correctness Framework for Open QA Evaluation
Findings of Empirical Methods in Natural Language Processing (EMNLP 2026)
Free-form answers from LLMs can be correct in many surface forms, and they can fail in very different ways: they may be incomplete, contradict the reference, add hallucinated content, or go along with a false premise. Standard judge-based and similarity-based metrics tend to blur these cases together. We propose a semantic correctness taxonomy with eight ordered classes that, for example, separates answers that are verbose but correct from answers that also contain hallucinations. We release CAP-Correctness, an 8.8k-example benchmark built from widely used QA datasets, and CAP-Statements, an 11k-example dataset for turning question–answer pairs into declarative statements for NLI. Finally, we introduce CAP (Context-Aware Precision), a reference-based metric that scores question-conditioned statements with bidirectional NLI. In a monotonicity test that checks whether a metric respects the taxonomy's ordering, CAP outperforms established baselines.* Equal contribution
-
Lightweight Detection of LLM-Generated Code via Stylometric Signals
International Workshop on Semantic Evaluation (SemEval 2026)
Women in Machine Learning Workshop (WiML @ NeurIPS 2026), non-archival
SemEval-2026 Task 13 asks systems to detect machine-generated code across programming languages and application scenarios, including languages and domains not seen during training. For Subtask A (binary classification), we compare pretrained code encoders with lightweight feature-based approaches. We design ratio-based stylometric features that are less sensitive to snippet length, and use parsers and a programming-language classifier to extract signals about how descriptive the code is. We also train a separate line-level classifier that finds natural-language text embedded in code samples. A shallow decision tree combined with rules derived from data analysis produces the final predictions. The approach trains on CPU only and runs inference almost instantly, making it a lightweight alternative to large pretrained models.* Equal contribution
Teaching
-
Intelligent Systems / Artificial Intelligence · Sofia University, FMI
Final-year BSc- Search
- A*
- ML
- NLP
-
Information Retrieval · Sofia University, FMI
MSc, Information Retrieval & Knowledge Discovery
Experience
-
Software Engineering Intern · Google, Search · Zurich
Jun – Aug 2026Working on Google Search
- Autoraters, Autorater reliability evaluation
- Benchmarking, Empirical proofs
-
Research Assistant · Sofia University, SUMMIT project
Nov 2025 – May 2026- Accepted paper @ EMNLP Findings 2026
- Accepted paper @ SemEval 2026
-
Software Engineering Intern · Uber · Amsterdam & Sofia
Feb – Aug 2025- Built an end-to-end observability dashboard with a Go API (95%+ test coverage) and data pipeline processing 7.3M records.
-
Teaching Assistant · Sofia University, FMI
2022 – present775+ students across seven courses. I also supervise student NLP projects.
- Artificial Intelligence (Python & C++)
- Information Retrieval (Python, Master's course)
- Algorithm Design & Analysis Lab (C++)
- Data Structures (C++)
- Object-Oriented Programming (C++)
- Object-Oriented Programming Lab (C++)
- Introduction to Programming (C++)
Honors
-
Women in Tech Scholarship · Progress Software
2023