Pallel parsing of tree languages for syntactic pattern recognition

摘要

Several software engineering techniques are proposed for the implementation of a more efficient Error-Correcting Tree Automata (ECTA). The production rules of a tree grammar are transformed into suitable internal codes by a lexical analyzer during the preprocessing phase, thus, several more efficient searching algorithms such as binary search, hashing techniques or table-lookup can then be used to improve the parsing efficiency. A parallel parsing algorithm of tree languages is then introduced. Comparisons of speed gain vs overhead of parallel algorithms are presented. Illustrative examples include the application of the proposed parallel algorithms to the interpretation of LANDSAT data and the discrimination of textures. Simulation results of the proposed parallel algorithm are presented.