2005
DOI: 10.1016/j.patrec.2004.09.056
|View full text |Cite
|
Sign up to set email alerts
|

Recent developments of the syntactic pattern recognition model based on quasi-context sensitive languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0
1

Year Published

2008
2008
2023
2023

Publication Types

Select...
6
3
1

Relationship

2
8

Authors

Journals

citations
Cited by 25 publications
(6 citation statements)
references
References 5 publications
0
5
0
1
Order By: Relevance
“…. , −1 }, and is the number of target patterns [42][43][44][45]. If it is assumed that there are obtained observation sequences = { − +1 , − +2 , .…”
Section: Pattern Recognition In Sa-ann Cognition Frameworkmentioning
confidence: 99%
“…. , −1 }, and is the number of target patterns [42][43][44][45]. If it is assumed that there are obtained observation sequences = { − +1 , − +2 , .…”
Section: Pattern Recognition In Sa-ann Cognition Frameworkmentioning
confidence: 99%
“…The most important decision concerning the implementation of the agent has been the choice of GDPLL(k) grammars [8] as a formal string grammar which is used to store knowledge about a component behaviour and to construct a control table for the parser. The definition of GDPLL(k) grammar and its brief characteristics are included in next section.…”
Section: Fig 1 a General Scheme Of A Syntactic Pattern Recognition-ba...mentioning
confidence: 99%
“…They are powerful enough to describe the syntax of programming languages [1] (almost all programming languages are defined via CFGs) and simple enough to allow the construction of efficient parsing algorithms. Additionally, general context-free methods are exploited today in various application domains, such as speech recognition, natural or programming language processing and image analysis, syntactic filtering, artificial intelligence [2,[4][5][6][7][8][9]. The large amount of data manipulated by those methods and today's requirement of conforming to very strict real-time constraints, turns the implementation of CFG-parsers that are optimized for performance more useful and imperative than ever.…”
Section: Introductionmentioning
confidence: 99%