Structure-Preserved Error-Correcting Tree Automata for Syntactic Pattern Recognition,

Abstract

An error-correcting syntax analyzer for tree languages with substitution errors, called structure-preserved error-correcting tree automaton (ECTA), is studied. Substitution errors are defined in terms of transformation which can easily be accommodated to linguistic notion. Let L be a tree language, for a tree beta not in L, the essence of ECTA is to search for a tree alpha in L such that the cost sequence of error transformations needed to transform alpha to beta is the minimum among all the sentences in L. A LANDSAT data interpretation problem is used as an example to illustrate the operation of ECTA. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1976
Accession Number
ADA034061

Entities

People

  • King Sun Fu
  • S. Y. Lu

Organizations

  • Purdue University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Air Force
  • Automata
  • Automata Theory
  • Classification
  • Computers
  • Decoding
  • Electrical Engineering
  • Engineering
  • Formal Languages
  • Grammars
  • Language
  • Pattern Recognition
  • Probabilistic Models
  • Probability
  • Probability Distributions
  • Recognition
  • Symbols

Readers

  • Artificial Intelligence
  • Computer Programming and Software Development.
  • Powder metallurgy of Titanium alloys.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation