{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:30:11Z","timestamp":1725892211638},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388708"},{"type":"electronic","value":"9783540388722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841883_11","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T11:29:11Z","timestamp":1158665351000},"page":"138-152","source":"Crossref","is-referenced-by-count":0,"title":["String Generating Hypergraph Grammars with Word Order Restrictions"],"prefix":"10.1007","author":[{"given":"Martin","family":"Riedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingrid","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-30203-2_25","volume-title":"Graph Transformations","author":"S. Seifert","year":"2004","unstructured":"Seifert, S., Fischer, I.: Parsing String Generating Hypergraph Grammars. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 352\u2013367. Springer, Heidelberg (2004)"},{"key":"11_CR2","volume-title":"Computational Linguistics, and Speech Recognition","author":"D. Jurafsky","year":"2000","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing. In: Computational Linguistics, and Speech Recognition. Prentice Hall, Englewood Cliffs (2000)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-25959-6_12","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"I. Fischer","year":"2004","unstructured":"Fischer, I.: Modelling Discontinuous Constituents with Hypergraph Grammars. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 163\u2013169. Springer, Heidelberg (2004)"},{"key":"11_CR4","unstructured":"Seifert, S: Ein Earley-Parser f\u00fcr Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl f\u00fcr Informatik 2, Universit\u00e4t Erlangen-N\u00fcrnberg (2004)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An Efficient Context\u2013Free Parsing Algorithm. Communications of the ACM\u00a013(2), 94\u2013102 (1970)","journal-title":"Communications of the ACM"},{"key":"11_CR6","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol.\u00a0643. Springer, Heidelberg (1992)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge Replacement Graph Grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol.\u00a0I, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences\u00a043, 328\u2013360 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01178504","volume":"29","author":"J. Engelfriet","year":"1992","unstructured":"Engelfriet, J., Heyker, L.: Context\u2013free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica\u00a029, 161\u2013210 (1992)","journal-title":"Acta Informatica"},{"key":"11_CR10","volume-title":"Generalized Phrase Structure Grammar","author":"G. Gazdar","year":"1985","unstructured":"Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalized Phrase Structure Grammar. Harvard University Press, Cambridge (1985)"},{"key":"11_CR11","unstructured":"Riedl, M.: Wortstellungsrestriktionen f\u00fcr Zeichenketten generierende Hypergraphgrammatiken. Studienarbeit, Lehrstuhl f\u00fcr Informatik 2, Universit\u00e4t Erlangen-N\u00fcrnberg (2005)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00630810","volume":"7","author":"S.M. Shieber","year":"1984","unstructured":"Shieber, S.M.: Direct Parsing of ID\/LP Grammars. Linguistics and Philosophy\u00a07(2), 135\u2013154 (1984)","journal-title":"Linguistics and Philosophy"},{"key":"11_CR13","first-page":"205","volume":"11","author":"G.E. Barton","year":"1985","unstructured":"Barton, G.E.: On the Complexity of ID\/LP Parsing. Computational Linguistics\u00a011, 205\u2013218 (1985)","journal-title":"Computational Linguistics"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Barton, G.E.: The Computational Difficulty of ID\/LP Parsing. In: Proceedings of the 23rd conference on Association for Computational Linguistics, July 08-12, pp. 76\u201381 (1985)","DOI":"10.3115\/981210.981220"},{"issue":"2","key":"11_CR15","first-page":"209","volume":"2","author":"S. M\u00fcller","year":"2004","unstructured":"M\u00fcller, S.: Continuous or discontinuous constituents? a comparison between syntactic analyses for constituent order and their processing systems. Research on Language and Computation, Special Issue on Linguistic Theory and Grammar Implementation\u00a02(2), 209\u2013257 (2004), \n                    \n                      http:\/\/www.cl.uni-bremen.de\/~stefan\/Pub\/discont.html","journal-title":"Research on Language and Computation, Special Issue on Linguistic Theory and Grammar Implementation"},{"key":"11_CR16","unstructured":"Barta, C., Dormeyer, R., Spiegelhauer, T., Fischer, I.: Word Order and Discontinuities in a Dependency Grammar for Hungarian. In: Zoltan, A., Csendes, D. (eds.) Proceedings of the 2nd Conf. on Hungarian Computational Linguistics (MSZNY), Szeged Hungary, Juhasz Nyomda, pp. 19\u201327 (2004)"},{"key":"11_CR17","unstructured":"Mark-Jan Nederhof, G.S., Shieber, S.: Partially Ordered Multiset Context-Free Grammars And Free-Word-Order Parsing. In: 8th International Workshop of Parsing Technologies (IWPT), Nancy, France (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841883_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:19Z","timestamp":1619507839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841883_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388708","9783540388722"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11841883_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}