Towards grammatical inferencing of GDPLL(k) grammars for applications in syntactic pattern recognition-based expert systems

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The recent results of the research into construction of syntactic pattern recognition-based expert systems are presented. The model of syntactic pattern recognition has been defined with the use of GDPLL(k) grammars and parsers, and the model has been successfully applied as an efficient tool for inference support in several expert systems. Nevertheless, one of the main problems of practical application of GDPLL(k) grammars consists in difficulties in defining the grammar from the sample of a pattern language. In the paper we present the first achievement in the field of grammatical inferencing of GDPLL(k) grammars: an algorithm of automatic construction of a GDPLL(k) grammar from a so-called polynomial specification of the language.

Cite

CITATION STYLE

APA

Jurek, J. (2004). Towards grammatical inferencing of GDPLL(k) grammars for applications in syntactic pattern recognition-based expert systems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 604–609). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free