{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:40Z","timestamp":1725559000484},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422532_18","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T22:15:43Z","timestamp":1278972943000},"page":"271-286","source":"Crossref","is-referenced-by-count":3,"title":["Linguistic Facts as Predicates over Ranges of the Sentence"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Sagot","sequence":"first","affiliation":[]}],"member":"297","reference":[{"unstructured":"Dahl, V., Tarau, P., Huang, Y.-N.: Datalog Grammars. In: GULP-PRODE, vol.\u00a02, pp. 268\u2013282 (1994)","key":"18_CR1"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Grammars and NLP","author":"P. Blache","year":"2001","unstructured":"Blache, P.: Parsing with Constraint Graphs: a Flexible Representation for Robust Parsing. In: Di Sciullo, A.M. (ed.) Grammars and NLP. LNCS, Springer, Heidelberg (2001)"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/1-4020-2295-6_13","volume-title":"New developments in parsing technology","author":"P. Boullier","year":"2004","unstructured":"Boullier, P.: Range Concatenation Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds.) New developments in parsing technology, pp. 269\u2013289. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0304-3975(01)00353-X","volume":"293","author":"P. Boullier","year":"2003","unstructured":"Boullier, P.: Counting with range concatenation grammars. Theoretical Computer Science\u00a0293, 391\u2013416 (2003)","journal-title":"Theoretical Computer Science"},{"unstructured":"Sagot, B., Boullier, P.: Les RCG comme formalisme grammatical pour la linguistique. In: Proceedings of TALN 2004, Fez, Marocco, pp. 403\u2013412 (2004)","key":"18_CR5"},{"unstructured":"Pollard, C., Sag, I.A.: Head-Driven Phrase Structure Grammar. University of Chicago Press and CSLI Publications (1994)","key":"18_CR6"},{"doi-asserted-by":"crossref","unstructured":"Barth\u00e9l\u00e9my, F., Boullier, P., Deschamp, P., de La Clergerie, \u00c9.V.: Guided Parsing of Range Concatenation Languages. In: Proceedings of ACL 2001, Toulouse, France, pp. 42\u201349 (2001)","key":"18_CR7","DOI":"10.3115\/1073012.1073019"},{"unstructured":"Danlos, L., Laurens, O.: Pr\u00e9sentation du Projet Eurotra et des grammaires d\u2019Eurotra-France. Technical Report no. 1, Universit\u00e9 Paris 7 - Talana\/LISH (1991)","key":"18_CR8"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:53:51Z","timestamp":1558281231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11422532_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}