{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:10:24Z","timestamp":1740798624466,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230496"},{"type":"electronic","value":"9783540301202"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30120-2_24","type":"book-chapter","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T23:19:47Z","timestamp":1293059987000},"page":"187-194","source":"Crossref","is-referenced-by-count":0,"title":["Discriminative Models of SCFG and STSG"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Rozenknop","sequence":"first","affiliation":[]},{"given":"Jean-C\u00e9dric","family":"Chappelier","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Rajman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"613","volume":"24","author":"M. Johnson","year":"1998","unstructured":"Johnson, M.: PCFG models of linguistic tree representations. Computational Linguistics\u00a024, 613\u2013632 (1998)","journal-title":"Computational Linguistics"},{"key":"24_CR2","unstructured":"Bonnema, R., Buying, P., Scha, R.: A new probabilitymodel for Data Oriented Parsing. In: Dekker, P., Kerdiles, G. (eds.) Proc. of the 12th Amsterdam Colloquium (1999)"},{"key":"24_CR3","volume-title":"Proc. Text, Speech and Dialogue 2002","author":"A. Rozenknop","year":"2002","unstructured":"Rozenknop, A.: Gibbsian Context-Free Grammar for parsing. In: Sojka, P., Kope\u010dek, I., Pala, K. (eds.) Proc. Text, Speech and Dialogue 2002, Springer, Heidelberg (2002)"},{"key":"24_CR4","unstructured":"Rozenknop, A., Chappelier, J.C., Rajman, M.: Gibbsian Tree Substitution Grammars. In: J\u00e4ger, G., Monachesi, P., Wintner, S. (eds.) Proc. of Formal Grammar 2003, pp. 137\u2013148 (2003)"},{"key":"24_CR5","unstructured":"Rozenknop, A.: Mod\u00e8les syntaxiques probabilistes non-g\u00e9n\u00e9ratifs. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland, 3 This phenomenon has been clearly observed in experiments with the lexicalized version of the treebanks (2003)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Geman, S., Johnson, M.: Dynamic programming for parsing and estimation of Stochastic Unification-Based Grammars. In: Proc. ACL 2002, pp. 279\u2013286 (2002)","DOI":"10.3115\/1073083.1073130"},{"key":"24_CR7","unstructured":"Miyao, Y., Tsujii, J.: Maximum entropy estimation for feature forests. In: Proc. of Human Language Technology Conference, HLT 2002 (2002)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Clark, S., Curran, J.R.: Log-Linear Models for Wide-Coverage CCG Parsing. In: Proc. of EMNLP 2003, Sapporo, Japan, pp. 97\u2013104 (2003)","DOI":"10.3115\/1119355.1119368"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Clark, S., Curran, J.R.: Parsing the WSJ using CCG and log-linear models. In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL 2004), Barcelona, Spain (2004)","DOI":"10.3115\/1218955.1218969"},{"key":"24_CR10","unstructured":"Chappelier, J.C., Rajman, M., Rozenknop, A.: Polynomial TSG: Characterization and new examples. In: Proc. of 7th Conf. on Formal Grammar, pp. 29\u201339 (2002)"},{"key":"24_CR11","first-page":"313","volume":"19","author":"M.P. Marcus","year":"1994","unstructured":"Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of English: The Penn treebank. Computational Linguistics\u00a019, 313\u2013330 (1994)","journal-title":"Computational Linguistics"},{"key":"24_CR12","first-page":"370","volume":"27","author":"J. Lafferty","year":"1996","unstructured":"Lafferty, J.: Gibbs-Markov models. Computing Science and Statistics\u00a027, 370\u2013377 (1996)","journal-title":"Computing Science and Statistics"},{"key":"24_CR13","volume-title":"Beyond Grammar, An Experience-Based Theory of Language","author":"R. Bod","year":"1998","unstructured":"Bod, R.: Beyond Grammar, An Experience-Based Theory of Language. CSLI Publications, Stanford (1998)"},{"key":"24_CR14","unstructured":"Chappelier, J.C., Rajman, M.: Polynominal TSG: an efficient framework for Data-Oriented Parsing. In: Proc. of RANLP 2001 (2001)"},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"M.M. Dempster","year":"1977","unstructured":"Dempster, M.M., Laird, N.M., Jain, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistics Society\u00a039, 1\u201338 (1977)","journal-title":"Journal of the Royal Statistics Society"},{"key":"24_CR16","unstructured":"Goodman, J.: Parsing Inside-Out. Ph.D. thesis, Harvard University (1998)"},{"key":"24_CR17","first-page":"25","volume-title":"Data-Oriented Parsing","author":"R. Bonnema","year":"2002","unstructured":"Bonnema, R., Scha, R.: Reconsidering the probability model of Data-Oriented Parsing. In: Bod, R., Scha, R., Sima\u2019an, K. (eds.) Data-Oriented Parsing, pp. 25\u201341. CSLI Publications, Stanford (2002)"},{"key":"24_CR18","volume-title":"Foundations of Statistical Natural Language Processing","author":"C. Manning","year":"1999","unstructured":"Manning, C., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Bod, R.: An efficient implementation of a new DOP model. In: Proc. EACL 2003 (2003)","DOI":"10.3115\/1067807.1067812"},{"key":"24_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine: A Users\u2019 Guide and Tutorial for Networked Parallel Computing","author":"A. Geist","year":"1994","unstructured":"Geist, A., et al.: PVM: Parallel Virtual Machine: A Users\u2019 Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge (1994)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Sima\u2019an, K.: Computational complexity of probabilistic disambiguation by means of tree grammars. In: Proc. of COLING 1996 (1996)","DOI":"10.3115\/993268.993392"}],"container-title":["Lecture Notes in Computer Science","Text, Speech and Dialogue"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30120-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T01:59:34Z","timestamp":1740794374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30120-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230496","9783540301202"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30120-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}