{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T20:41:31Z","timestamp":1726173691495},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031152979"},{"type":"electronic","value":"9783031152986"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15298-6_7","type":"book-chapter","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T08:55:10Z","timestamp":1662627310000},"page":"105-122","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multityped Abstract Categorial Grammars and\u00a0Their Composition"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Ludmann","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Pogodalla","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"de Groote","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"key":"7_CR1","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland (1984)"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"C\u201322","author":"T Booth","year":"1973","unstructured":"Booth, T., Thompson, R.: Applying probability measures to abstract languages. IEEE Trans. Comput. C\u201322(5), 442\u2013450 (1973). https:\/\/doi.org\/10.1109\/T-C.1973.223746","journal-title":"IEEE Trans. Comput."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Chiang, D.: Statistical parsing with an automatically-extracted tree adjoining grammar. In: Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics, pp. 456\u2013463. Association for Computational Linguistics, Hong Kong (2000). https:\/\/doi.org\/10.3115\/1075218.1075276. acl anthology: P00-1058","DOI":"10.3115\/1075218.1075276"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"de Groote, P.: Towards abstract categorial grammars. In: Proceedings of 39th Annual Meeting of the Association for Computational Linguistics, pp. 148\u2013155 (2001). acl anthology: P01-1033","DOI":"10.3115\/1073012.1073045"},{"key":"7_CR5","unstructured":"de Groote, P.: Tree-adjoining grammars as abstract categorial grammars. In: Proceedings of the Sixth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+6), pp. 145\u2013150. Universit\u00e0 di Venezia (2002). acl anthology: W02-2220."},{"key":"7_CR6","series-title":"An EATCS Series","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01492-5_9","volume-title":"Handbook of Weighted Automata","author":"Z F\u00fcl\u00f6p","year":"2009","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. An EATCS Series, pp. 313\u2013403. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_9"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Joshi, A.K., Schabes, Y.: Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 69\u2013123. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_2. Chap. 2","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Kanazawa, M.: Abstract families of abstract categorial languages. Electron. Notes Theor. Comput. Sci. 165, 65\u201380 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2006.05.037. Proceedings of the 13th Workshop on Logic, Language, Information and Computation (WoLLIC 2006)","DOI":"10.1016\/j.entcs.2006.05.037"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Maletti, A., Satta, G.: Parsing algorithms based on tree automata. In: Proceedings of the 11th International Conference on Parsing Technologies (IWPT 2009), pp. 1\u201312. Association for Computational Linguistics, Paris, France (2009). acl anthology: W09-3801","DOI":"10.3115\/1697236.1697238"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Resnik, P.: Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In: COLING 1992 Volume 2: The 14th International Conference on Computational Linguistics (1992). https:\/\/doi.org\/10.3115\/992133.992135. acl anthology: C92-2065","DOI":"10.3115\/992133.992135"},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0019-9958(69)90554-3","volume":"15","author":"A Salomaa","year":"1969","unstructured":"Salomaa, A.: Probabilistic and weighted grammars. Inf. Control 15(6), 529\u2013544 (1969). https:\/\/doi.org\/10.1016\/S0019-9958(69)90554-3","journal-title":"Inf. Control"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511863226","volume-title":"An Introduction to Category Theory","author":"H Simmons","year":"2011","unstructured":"Simmons, H.: An Introduction to Category Theory. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511863226"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Steedman, M., Baldridge, J.: Combinatory categorial grammar. In: Borsley, R., B\u00f6rjars, K. (eds.) Non-Transformational Syntax: Formal and Explicit Models of Grammar, chap. 5. Wiley-Blackwell (2011)","DOI":"10.1002\/9781444395037.ch5"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15298-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T23:03:01Z","timestamp":1663023781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15298-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031152979","9783031152986"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15298-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ia\u015fi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28th","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2022.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"08 extra abstracts: 05 invited talks and 03 tutorials","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}