Cornell University
∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS
Abstract
dc:description.abstractIn this Master’s Thesis, I outline a class of tree-based active learning grammatical inference algorithms referred to as *-VADA. I define necessary concepts, and then define three variants of the algorithm class, as well as giving proofs of soundness and completeness results for all three. The first algorithm covered in this thesis, ARVADA, originates from the 2021 paper ”Learning Highly Recursive Input Grammars” by Neil Kulkarni, Caroline Lemieux, and Koushik Sen. Their 2021 paper outlines the algorithm as wellas gives evaluation of heuristic performance. Using their definition of ARVADA as a launching point, I seek to formalize and strengthen soundness and completeness results by formalizing the ARVADA algorithm itself, as well as building off variants of the algorithm with formally proven correctness results.
Degree
thesis:*- Name thesis:degree_name
- M.S., Computer Science
- Level thesis:degree_level
- Master of Science
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- Cornell University
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Baniak, Annabel
- Chair dc:contributor.chair
-
- Foster, John
- Committee member dc:contributor.committeemember
-
- Velasco, Matthew
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Attribution 4.0 International
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
-
Baniak_cornell_0058O_12747
https://www.proquest.com/LegacyDocView/DISSNUM/32696229