An algorithm for the inference of tree grammars
Date Issued
December 1974
Author(s)
Edwards, James J.
Advisor(s)
R. C. Gonzalez
Additional Advisor(s)
Michael G. Thomason
Sara R. Jordon
Abstract
The purpose of this work is to present an algorithm for the inference of tree grammars and its application to syntactic pattern recognition. The algorithm takes each sample tree of a pattern class and expresses it as a set of expansive form productions capable of generattng only that sample tree. The procedure is then generalized by making combtnations of nonterminals within each set based on the properties of self embedding, regularity, and equivalence. Experimental results whtch show the capabilitles of the algorithm under nontrivial pattern recognition tasks are also presented and discussed.
Degree
Master of Science
Major
Computer Science
File(s)![Thumbnail Image]()
Name
Thesis74.E394.pdf
Size
4.36 MB
Format
Adobe PDF
Checksum (MD5)
59bc5bfde3cb5b6cb03b76b92884e85b