THEORETICAL ASPECTS OF SYNTACTIC PATTERN-RECOGNITION

被引：33
|
作者：
TANAKA, E
机构：
[1] Department of Electrical and Electronics Engineering, Faculty of Engineering, Kobe University, Nada, Kobe
来源：
PATTERN RECOGNITION | 1995年 / 28卷 / 07期
关键词：
AUTOMATON; COMPUTATIONAL COMPLEXITY; ERROR-CORRECTING PARSING; LANGUAGE; PARSING; PROTOTYPE MATCHING; SYNTACTIC PATTERN RECOGNITION;
D O I：
10.1016/0031-3203(94)00182-L
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, a pessimistic view of syntactic pattern recognition is developed. This paper describes several aspects of syntactic pattern recognition from various points of view including the relation between the set of patterns and grammars, the semantics of a grammar, the expressive power of a grammar, grammatical inference, comparison between a syntactic method and a statistical method and a comparison of computing costs between a syntactic method and a prototype matching method. In every aspect a syntactic method faced with difficulties that are very hard to overcome.
引用
收藏
页码：1053 / 1061
页数：9
相关论文
共 50 条
12345