An algorithm for the inference of tree grammars |
| |
| Authors: | R. C. Gonzalez J. J. Edwards M. G. Thomason |
| |
| Affiliation: | (1) Electrical Engineering Department, University of Tennessee, Knoxville, Tennessee;(2) Computer Science Department, University of Tennessee, Knoxville, Tennessee;(3) Present address: Union Carbide Corporation, Oak Ridge, Tennessee |
| |
| Abstract: | An algorithm for the inference of tree grammars from sample trees is presented. The procedure, which is based on the properties of self-embedding and regularity, produces a reduced tree grammar capable of generating all the samples used in the inference process as well as other trees similar in structure. The characteristics of the algorithm are illustrated by experimental results.Work supported by the Office of Naval Research, Arlington, Virginia, under contract N00014-71-A-0121-0005. |
| |
| Keywords: | Tree grammars algorithm grammatical inference syntactic pattern recognition |
| 本文献已被 SpringerLink 等数据库收录！ |
|
