PARALLEL PARSING OF TREE LANGUAGES FOR SYNTACTIC PATTERN-RECOGNITION

被引：8

作者：

CHANG, NS

FU, KS

机构：

[1] School of Electrical Engineering, Purdue University, West Lafayette

来源：

PATTERN RECOGNITION | 1979年 / 11卷 / 03期

关键词：

Error-correcting tree automation; Parallel parsing; Simulation; Syntactic pattern recognition; Tree languages;

D O I：

10.1016/0031-3203(79)90008-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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. © 1979.

引用

页码：213 / 222

页数：10

共 16 条

[1]

BEAR JL, 1973, COMPUT SURV, V5, P31

[2]

Brodatz P., 1966, BRODATZ DATASET

[3]

CHANG NS, 1978, 11TH P ANN SIM S TAM, P271

[4]

CHANG NS, 1978, STUDY PARALLEL PARSI

[5]

FISHMAN GS, 1973, CONCEPTS METHODS DIS, P385

[6]

Fu K., 1977, PATTERN RECOGN, P257

[7]

FU KS, 1973, IEEE T COMPUT, VC 22, P1087, DOI 10.1109/T-C.1973.223654

[8]

FU KS, 1974, SYNTACTIC METHODS PA, P295

[9]

KUCK DJ, 1977, COMPUT SURV, V9, P29, DOI 10.1145/356683.356686

[10]

Lu S. Y., 1976, Proceedings of the 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes, P413

← 1 2 →