{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:35:49Z","timestamp":1773455749522,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,9]],"date-time":"2013-03-09T00:00:00Z","timestamp":1362787200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10044-013-0322-1","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T04:10:57Z","timestamp":1362715857000},"page":"465-480","source":"Crossref","is-referenced-by-count":12,"title":["Fundamental methodological issues of syntactic pattern recognition"],"prefix":"10.1007","volume":"17","author":[{"given":"Mariusz","family":"Flasi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janusz","family":"Jurek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,9]]},"reference":[{"key":"322_CR1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"AV Aho","year":"1968","unstructured":"Aho AV (1968) Indexed grammars\u2014an extension of context-free grammars. J Assoc Comput Mach 15:647\u2013671","journal-title":"J Assoc Comput Mach"},{"key":"322_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0201022","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho AV, Peterson TG (1972) A minimum distance error-correcting parser for context-free languages. SIAM J Comput 1:305\u2013312","journal-title":"SIAM J Comput"},{"key":"322_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0031-3203(96)00056-8","volume":"30","author":"R Alquezar","year":"1997","unstructured":"Alquezar R, Sanfeliu A (1997) Recognition and learning of a class of context-sensitive languages described by augmented regular expressions. Pattern Recogn 30:163\u2013182","journal-title":"Pattern Recogn"},{"key":"322_CR4","unstructured":"Brandenburg FJ (1983) On the complexity of the membership problem of graph grammars. Proc. Int. Workshop on Graphtheoretic Concepts in Computer Sci. WG\u201983, June 16-18 1983, Osnabr\u00fcck, Germany, Trauner Verlag, pp 40\u201349"},{"key":"322_CR5","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-52292-1_10","volume":"411","author":"HO Bunke","year":"1990","unstructured":"Bunke HO, Haller B (1990) A parser for context free plex grammars. Lecture Notes Comput Sci 411:136\u2013150","journal-title":"Lecture Notes Comput Sci"},{"key":"322_CR6","doi-asserted-by":"crossref","unstructured":"Bunke HO, Sanfeliu A, eds (1990) Syntactic and structural pattern recognition\u2014theory and applications. World Scientific, Singapore","DOI":"10.1142\/0580"},{"key":"322_CR7","doi-asserted-by":"crossref","unstructured":"Casta\u00f1o JM (2003) GIGs: Restricted context-sensitive descriptive power in bounded polynomial-time. In: Proceedings of conference on intelligent text processing and computational linguistics (CICLing \u201903)","DOI":"10.1007\/3-540-36456-0_3"},{"key":"322_CR8","doi-asserted-by":"crossref","unstructured":"Dassow J, P\u0103un G (1990) Regulated rewriting in formal language theory. Springer, New York","DOI":"10.1007\/978-3-642-74932-2"},{"key":"322_CR9","doi-asserted-by":"crossref","unstructured":"Dassow J (2004) Grammars with regulated rewriting. In: Martin-Vide C, Mitrana V, P\u0103un G (eds) Formal languages and applications. Springer, Berlin","DOI":"10.1007\/978-3-540-39886-8_13"},{"issue":"2","key":"322_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1093\/logcom\/exm009","volume":"18","author":"J Eijck van","year":"2008","unstructured":"Eijck van J (2008) Sequentially indexed grammars. J Logic Comput 18(2):205\u2013228","journal-title":"J Logic Comput"},{"key":"322_CR11","unstructured":"Ferruci F, Tortora G, Tucci M, Vitiello G (1994) A predictive parser for visual languages specified by relational grammars. Proceedings of the IEEE symposium on visual languages-VL\u201994: 245\u2013252"},{"key":"322_CR12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/0031-3203(88)90034-9","volume":"21","author":"M Flasi\u0144ski","year":"1988","unstructured":"Flasi\u0144ski M (1988) Parsing of edNLC-graph grammars for scene analysis. Pattern Recogn 21:623\u2013629","journal-title":"Pattern Recogn"},{"key":"322_CR13","doi-asserted-by":"crossref","unstructured":"Flasi\u0144ski M (1989) Characteristics of edNLC\u2014graph grammars for syntactic pattern recognition. Comput Vision Graphics Image Process. CGIP-47: 1\u201321","DOI":"10.1016\/0734-189X(89)90050-9"},{"key":"322_CR14","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0031-3203(90)90099-7","volume":"23","author":"M Flasi\u0144ski","year":"1990","unstructured":"Flasi\u0144ski M (1990) Distorted pattern analysis with the help of Nodel Label Controlled graph languages. Pattern Recogn 23:765\u2013774","journal-title":"Pattern Recogn"},{"key":"322_CR15","doi-asserted-by":"crossref","unstructured":"Flasi\u0144ski (1991) Some notes on a problem of constructing the best matched graph. Pattern Recogn 24:1223\u20131224","DOI":"10.1016\/0031-3203(91)90147-W"},{"key":"322_CR16","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/0031-3203(91)90098-P","volume":"24","author":"M Flasi\u0144ski","year":"1991","unstructured":"Flasi\u0144ski M, Lewicki G (1991) The convergent method of constructing polynomial discriminant functions for pattern recognition. Pattern Recogn 24:1009\u20131015","journal-title":"Pattern Recogn"},{"key":"322_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0031-3203(93)90083-9","volume":"26","author":"M Flasi\u0144ski","year":"1993","unstructured":"Flasi\u0144ski M (1993) On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recogn 26:1\u201316","journal-title":"Pattern Recogn"},{"key":"322_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0304-3975(97)00212-0","volume":"201","author":"M Flasi\u0144ski","year":"1998","unstructured":"Flasi\u0144ski M (1998) Power properties of NLC graph grammars with a polynomial membership problem. Theoret Comput Sci 201:189\u2013231","journal-title":"Theoret Comput Sci"},{"key":"322_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/S0031-3203(98)00115-0","volume":"32","author":"M Flasi\u0144ski","year":"1999","unstructured":"Flasi\u0144ski M, Jurek J (1999) Dynamically programmed automata for quasi context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems. Pattern Recogn 32:671\u2013690","journal-title":"Pattern Recogn"},{"key":"322_CR20","first-page":"1","volume":"71","author":"M Flasi\u0144ski","year":"2006","unstructured":"Flasi\u0144ski M, Jurek J (2006) On the analysis of fuzzy string patterns with the help of extended and stochastic GDPLL(k) grammar. Fundam Inf 71:1\u201314","journal-title":"Fundam Inf"},{"key":"322_CR21","first-page":"379","volume":"80","author":"M Flasi\u0144ski","year":"2007","unstructured":"Flasi\u0144ski M (2007) Inference of parsable graph grammars for syntactic pattern recognition. Fundam Inf 80:379\u2013413","journal-title":"Fundam Inf"},{"key":"322_CR22","doi-asserted-by":"crossref","first-page":"2249","DOI":"10.1016\/j.patcog.2010.01.004","volume":"43","author":"M Flasi\u0144ski","year":"2010","unstructured":"Flasi\u0144ski M, My\u015bli\u0144ski S (2010) On the use of graph parsing for recognition of isolated hand postures of Polish Sign Language. Pattern Recogn 43:2249\u20132264","journal-title":"Pattern Recogn"},{"key":"322_CR23","first-page":"83","volume":"4","author":"KS Fu","year":"1971","unstructured":"Fu KS, Swain PH (1971) Stochastic programmed grammars for syntactic pattern recognition. Pattern Recogn 4:83\u2013100","journal-title":"Pattern Recogn"},{"key":"322_CR24","unstructured":"Fu KS (1982) Syntactic pattern recognition and applications. Prentice Hall, Englewood Cliffs"},{"key":"322_CR25","doi-asserted-by":"crossref","unstructured":"Gazdar G (1988) Applicability of indexed grammars to natural languages. In: Reyle U, Rohrer C (eds) Natural language parsing and linguistic theories. D. Reidel Publ. Comp., Englewood Cliffs, NJ","DOI":"10.1007\/978-94-009-1337-0_3"},{"key":"322_CR26","unstructured":"Goldfarb L (2004) Pattern representation and the future of pattern recognition. Proceedings of the ICPR-2004 workshop, August 22, 2004, Cambridge"},{"key":"322_CR27","unstructured":"Gonzales RC, Thomason MG (1978) Syntactic pattern recognition: an introduction. Addison-Wesley, Reading"},{"key":"322_CR28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-36456-0_17","volume":"2588","author":"K Harbusch","year":"2003","unstructured":"Harbusch K (2003) An efficient online parser for contextual grammars with at most contextufree selectors. Lecture Notes Comput Sci 2588:168\u2013179","journal-title":"Lecture Notes Comput Sci"},{"key":"322_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/34.824819","volume":"22","author":"AK Jain","year":"2000","unstructured":"Jain AK, Duin RPW, Mao J (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal Mach Intell 22:4\u201337","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"322_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D Janssens","year":"1980","unstructured":"Janssens D, Rozenberg G (1980) On the structure of node-label-controlled graph languages. Inf Sci 20:191\u2013216","journal-title":"Inf Sci"},{"key":"322_CR31","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"AK Joshi","year":"1975","unstructured":"Joshi AK, Levy LS, Takahashi M (1975) Tree adjunct grammars. J Comput Syst Sci 10:136\u2013163","journal-title":"J Comput Syst Sci"},{"key":"322_CR32","unstructured":"Joshi AK (1985) How much context-sensivity is necessary for characterizing structural descriptions\u2014tree adjoining grammars. In: Dowty D et\u00a0al. (eds) Natural language processing\u2014theoretical, computational and psychological perspective. Cambridge University Press, New York"},{"key":"322_CR33","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-8655(99)00145-2","volume":"21","author":"J Jurek","year":"2000","unstructured":"Jurek J (2000) On the linear computational complexity of the parser for quasi context sensitive languages. Pattern Recognit Lett 21:179\u2013187","journal-title":"Pattern Recognit Lett"},{"key":"322_CR34","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1007\/978-3-540-24844-6_91","volume":"3070","author":"J Jurek","year":"2004","unstructured":"Jurek J (2004) Towards grammatical inferencing of GDPLL(k) grammars for applications in syntactic pattern recognition-based expert systems. Lecture Notes Comput Sci 3070:604\u2013609","journal-title":"Lecture Notes Comput Sci"},{"key":"322_CR35","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.patrec.2004.09.056","volume":"26","author":"J Jurek","year":"2005","unstructured":"Jurek J (2005) Recent developments of the syntactic pattern recognition model based on quasi-context sensitive languages. Pattern Recognit Lett 26:1011\u20131018","journal-title":"Pattern Recognit Lett"},{"key":"322_CR36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D Knuth","year":"1971","unstructured":"Knuth D (1971) Semantics of context-free languages. Math Syst Theory 2:127\u2013145","journal-title":"Math Syst Theory"},{"key":"322_CR37","first-page":"1525","volume":"14","author":"S Marcus","year":"1969","unstructured":"Marcus S (1969) Contextual grammars. Rev Roum Math Pures Appl 14:1525\u20131534","journal-title":"Rev Roum Math Pures Appl"},{"key":"322_CR38","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/11872436_12","volume":"4201","author":"T Oates","year":"2006","unstructured":"Oates T, Armstrong T, Becerra-Bonache L, Atamas M (2006) Inferring grammars for mildly context sensitive languages in polynomial time. Lecture Notes Comput Sci 4201:137\u2013147","journal-title":"Lecture Notes Comput Sci"},{"key":"322_CR39","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ijinfomgt.2011.11.016","volume":"32","author":"MR Ogiela","year":"2012","unstructured":"Ogiela MR, Ogiela U (2012) DNA-like linguistic secret sharing for strategic information systems. Int J Inf Manag 32:175\u2013181","journal-title":"Int J Inf Manag"},{"key":"322_CR40","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin A (2001) Conjunctive grammars. J Autom Lang Comb 6:519\u2013535","journal-title":"J Autom Lang Comb"},{"key":"322_CR41","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A Okhotin","year":"2004","unstructured":"Okhotin A (2004) Boolean grammars. Inf Comput 194:19\u201348","journal-title":"Inf Comput"},{"key":"322_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88304-0","volume-title":"Structural pattern recognition","author":"T Pavlidis","year":"1977","unstructured":"Pavlidis T (1977) Structural pattern recognition. Springer, New York"},{"key":"322_CR43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0031-3203(90)90026-H","volume":"23","author":"KJ Peng","year":"1990","unstructured":"Peng KJ, Yamamoto T, Aoki Y (1990) A new parsing scheme for plex grammars. Pattern Recogn 23:393\u2013402","journal-title":"Pattern Recogn"},{"key":"322_CR44","unstructured":"Pfaltz JL, Rosenfeld A (1969) Web grammars. Proceedings of the first international conference on artificical intelligence, Washington DC, pp 609\u2013619"},{"key":"322_CR45","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0146-664X(72)80015-7","volume":"1","author":"JL Pfaltz","year":"1972","unstructured":"Pfaltz JL (1972) Web grammars and picture description. Comput Graph Image Process 1:193\u2013220","journal-title":"Comput Graph Image Process"},{"key":"322_CR46","unstructured":"Pollard C (1984) Generalized phrase structure grammars, head grammars, and natural language. PhD thesis, Stanford University, CA"},{"key":"322_CR47","first-page":"307","volume":"7","author":"A Rosenfeld","year":"1972","unstructured":"Rosenfeld A, Milgram DL (1972) Web automata and web grammars. Mach Intell 7:307\u2013324","journal-title":"Mach Intell"},{"key":"322_CR48","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"DJ Rosenkrantz","year":"1969","unstructured":"Rosenkrantz DJ (1969) Programmed grammars and classes of formal languages. J Assoc Comput Mach 16:107\u2013131","journal-title":"J Assoc Comput Mach"},{"key":"322_CR49","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"DJ Rosenkrantz","year":"1970","unstructured":"Rosenkrantz DJ, Stearns RE (1970) Properties of deterministic top-down grammars. Inf Control 17:226\u2013256","journal-title":"Inf Control"},{"key":"322_CR50","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TPAMI.1983.4767426","volume":"5","author":"QY Shi","year":"1983","unstructured":"Shi QY, Fu KS (1983) Parsing and translation of attributed expansive graph languages for scene analysis. IEEE Trans Pattern Anal Mach Intell 5:472\u2013485","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"322_CR51","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","volume":"14","author":"AO Slisenko","year":"1982","unstructured":"Slisenko AO (1982) Context-free grammars as a tool for describing polynomial-time subclasses of hard problems. Inform Proc Lett 14:52\u201356","journal-title":"Inform Proc Lett"},{"key":"322_CR52","doi-asserted-by":"crossref","unstructured":"Staudacher P (1993) New frontiers beyond context-freeness: DI-grammars and DI-automata. In: Proceedings of the sixth conference on European chapter of the association for computational linguistics (EACL \u201993).","DOI":"10.3115\/976744.976786"},{"key":"322_CR53","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF00134555","volume":"5","author":"M Steedman","year":"1987","unstructured":"Steedman M (1987) Combinatory grammars and parasitic gaps. Nat Lang Ling Theory 5:403\u2013439","journal-title":"Nat Lang Ling Theory"},{"key":"322_CR54","doi-asserted-by":"crossref","unstructured":"Tadeusiewicz R, Ogiela MR (2004) Medical image understanding technology. Springer, Berlin-Heidelberg-New York","DOI":"10.1007\/978-3-540-40997-7"},{"key":"322_CR55","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/0031-3203(94)00182-L","volume":"28","author":"E Tanaka","year":"1995","unstructured":"Tanaka E (1995) Theoretical aspects of syntactic pattern recognition. Pattern Recogn 28:1053\u20131061","journal-title":"Pattern Recogn"},{"key":"322_CR56","unstructured":"Turan G (1982) On the complexity of graph grammars. Rep. Automata Theory Research Group. Szeged, 1982"},{"key":"322_CR57","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker K, Weir DJ (1994) The equivalence of four extensions of context-free grammars. Math Syst Theory 27:511\u2013546","journal-title":"Math Syst Theory"},{"key":"322_CR58","doi-asserted-by":"crossref","unstructured":"Wittenburg K (1992) Earley-style parsing for relational grammars. Proceedings of the IEEE symposium on visual languages -VL\u201992:192\u2013199","DOI":"10.1109\/WVL.1992.275765"},{"key":"322_CR59","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1093\/comjnl\/44.3.186","volume":"44","author":"DQ Zhang","year":"2001","unstructured":"Zhang DQ, Zhang K, Cao J (2001) A context-sensitive graph grammar formalism for the specification of visual languages. Comput J 44:186\u2013200","journal-title":"Comput J"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-013-0322-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-013-0322-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-013-0322-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T16:46:40Z","timestamp":1562777200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-013-0322-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,9]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s10044-013-0322-1","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,9]]}}}