Main content

Inducing Grammar from Sparse Data Sets

Show full item record

Title: Inducing Grammar from Sparse Data Sets
Author: Khan, Labeeb
Department: School of Computer Science
Program: Computer Science
Advisor: Kremer, StefanAntonie, Luiza
Abstract: This thesis proposes new tools and methods for identifying a regular language based on a finite set of example strings. There have been a number of different approaches proposed for grammar induction. Current state-ofthe-art solutions leverage a depth-first search strategy, which is an evidencebased state merging strategy or a breadth-first search strategy. We propose two solutions. The first uses a simulation-based approach that samples the set of deterministic finite state automata that represent the example strings and can recognize the language generated by an unknown grammar. The second is a genetic algorithm approach that generates and evolves a population of automata to learn the example strings labelled by an unknown grammar.
Date: 2020-09
Terms of Use: All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.

Files in this item

Files Size Format View
Khan_Labeeb_202101_MSc.pdf 2.861Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record