{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/126301"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/126301","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS","abstract":"In 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.","abstract_html":"In 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.","abstract_has_math":false,"creators":["Baniak, Annabel"],"institution":"Cornell University","degree_name":"M.S., Computer Science","degree_level":"Master of Science","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Foster, John"],"committee_members":["Velasco, Matthew"],"year":2026,"date_issued":"2026-05","date_published":"2026-05","updated_at":"2026-11-19T03:13:28Z","subjects":["Grammatical Inference"],"languages":["en"],"rights":["Attribution 4.0 International"],"rights_urls":["https://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/ha1k-sq56"],"render_values":[{"text":"https://doi.org/10.7298/ha1k-sq56","href":"https://doi.org/10.7298/ha1k-sq56","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["Baniak_cornell_0058O_12747","https://www.proquest.com/LegacyDocView/DISSNUM/32696229"],"render_values":[{"text":"Baniak_cornell_0058O_12747","href":null,"code":true},{"text":"https://www.proquest.com/LegacyDocView/DISSNUM/32696229","href":"https://www.proquest.com/LegacyDocView/DISSNUM/32696229","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/126301","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/126301","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F126301","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Foster, John"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Velasco, Matthew"]},{"key":"dc:creator","label":"Author","values":["Baniak, Annabel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-08-26T19:33:58Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-08-26T19:33:58Z"]},{"key":"dc:date.issued","label":"Date","values":["2026-05"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master of Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S., Computer Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Grammatical Inference"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/ha1k-sq56"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["Baniak_cornell_0058O_12747","https://www.proquest.com/LegacyDocView/DISSNUM/32696229"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/126301"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"d08962b4-6d5b-4508-977a-e20a84d694ae\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2026-05</PublicationDate> <DOI>https://doi.org/10.7298/ha1k-sq56</DOI> <Authors> <Author> <DisplayName>Baniak, Annabel</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>Grammatical Inference</Keyword> <Abstract>In 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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Baniak, Annabel"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["75 pages"]},{"key":"dc:description.abstract","label":"Abstract","values":["In 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."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810.2"]},{"key":"dc:title","label":"Title","values":["∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"d08962b4-6d5b-4508-977a-e20a84d694ae\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2026-05</PublicationDate> <DOI>https://doi.org/10.7298/ha1k-sq56</DOI> <Authors> <Author> <DisplayName>Baniak, Annabel</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>Grammatical Inference</Keyword> <Abstract>In 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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Baniak, Annabel"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Foster, John"],"dc:contributor.committeemember":["Velasco, Matthew"],"dc:creator":["Baniak, Annabel"],"dc:date.accessioned":["2026-08-26T19:33:58Z"],"dc:date.available":["2026-08-26T19:33:58Z"],"dc:date.issued":["2026-05"],"dc:description":["75 pages"],"dc:description.abstract":["In 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."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.doi":["https://doi.org/10.7298/ha1k-sq56"],"dc:identifier.other":["Baniak_cornell_0058O_12747","https://www.proquest.com/LegacyDocView/DISSNUM/32696229"],"dc:identifier.uri":["https://hdl.handle.net/1813/126301"],"dc:language.iso":["en"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["https://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Grammatical Inference"],"dcterms:license":["https://hdl.handle.net/1813/59810.2"],"dc:title":["∗-VADA: A CLASS OF GRAMMATICAL INFERENCE ACTIVE LEARNING ALGORITHMS"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Master of Science"],"thesis:degree_name":["M.S., Computer Science"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:13:28Z"}