{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:38:27Z","timestamp":1740141507924,"version":"3.37.3"},"reference-count":15,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1093\/logcom\/ext013","type":"journal-article","created":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T06:37:27Z","timestamp":1370068647000},"page":"1167-1202","source":"Crossref","is-referenced-by-count":1,"title":["Polynomially parsable unification grammars"],"prefix":"10.1093","volume":"25","author":[{"given":"Hadas","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuly","family":"Wintner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,5,31]]},"reference":[{"key":"2015092802073454000_25.5.1167.1","unstructured":"Barton G. E. Jr Berwick R. C. Ristad E. S. The complexity of LFG. In: Barton G. E. Jr Berwick R. C. Ristad E. S. , editors. Computational Complexity and Natural Language, Computational Models of Cognition and Perception. MIT Press; 1987. p. 103-114. Chapter 4."},{"key":"2015092802073454000_25.5.1167.2","unstructured":"Bertsch E. Nederhof M.-J. Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001). Tsinghua University Press; 2001. On the complexity of some extensions of RCG parsing. ISBN 7-302-04925-4."},{"key":"2015092802073454000_25.5.1167.3","unstructured":"Boullier P. Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks. University of Pennsylvania; 1998a. A generalization of mildly context-sensitive formalisms; p. 17-20."},{"key":"2015092802073454000_25.5.1167.4","unstructured":"Boullier P. Research Report. 1998b. Proposal for a natural language processing syntactic backbones; p. 3342. INRIA-Rocquencourt."},{"key":"2015092802073454000_25.5.1167.5","doi-asserted-by":"crossref","unstructured":"Boullier P. Proceedings of the Ninth Conference on European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics; 1999. Chinese numbers, MIX, scrambling, and range concatenation grammars; p. 53-60. doi: http:\/\/dx.doi.org\/10.3115\/977035.977044 .","DOI":"10.3115\/977035.977044"},{"key":"2015092802073454000_25.5.1167.6","doi-asserted-by":"crossref","unstructured":"Boullier P. Range concatenation grammars. In: Harry Bunt J. C. Satta G. , editors. New Developments in Parsing Technology. Springer; 2000. p. 269-289.","DOI":"10.1007\/1-4020-2295-6_13"},{"key":"2015092802073454000_25.5.1167.7","doi-asserted-by":"crossref","unstructured":"Carpenter B. The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press; 1992.","DOI":"10.1017\/CBO9780511530098"},{"key":"2015092802073454000_25.5.1167.8","unstructured":"Copestake A. Implementing Typed Feature Structure Grammars. CSLI Publications; 2002. The (new) LKB system. Technical Report, Stanford University, 1999. [9] A. Copestake."},{"key":"2015092802073454000_25.5.1167.9","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-008-9062-9"},{"key":"2015092802073454000_25.5.1167.10","doi-asserted-by":"crossref","unstructured":"Francez N. Wintner S. Unification Grammars. Cambridge University Press; 2012.","DOI":"10.1017\/CBO9781139013574"},{"key":"2015092802073454000_25.5.1167.11","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-005-4511-1"},{"key":"2015092802073454000_25.5.1167.12","unstructured":"Johnson M. Attribute-Value Logic and the Theory of Grammar, Vol. 16 of CSLI Lecture Notes. CSLI; 1988."},{"key":"2015092802073454000_25.5.1167.13","doi-asserted-by":"crossref","unstructured":"Kallmeyer L. Maier W. Parmentier Y. Joint Conference of the 47th Annual Meeting of the Association for Computational Linguistics and the 4th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing (ACL-IJCNLP 2009). 2009. An Earley parsing algorithm for range concatenation grammars.","DOI":"10.3115\/1667583.1667587"},{"key":"2015092802073454000_25.5.1167.14","doi-asserted-by":"crossref","unstructured":"Keller B. Weir D. A tractable extension of linear indexed grammars. In: Abney S. P. Hinrichs E. W. , editors. Proceedings of the Seventh Conference on European Chapter of the Association for Computational Linguistics. Morgan Kaufmann Publishers Inc.; 1995. p. 75-82. doi: http:\/\/dx.doi.org\/10.3115\/976973.976985 .","DOI":"10.3115\/976973.976985"},{"key":"2015092802073454000_25.5.1167.15","unstructured":"Peled H. Polynomially-Parsable Unification Grammars. Department of Computer Science, University of Haifa; 2011. Master's Thesis."}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/25\/5\/1167\/5276330\/ext013.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T02:51:19Z","timestamp":1688266279000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/ext013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,31]]},"references-count":15,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2015,9,28]]},"published-print":{"date-parts":[[2015,10]]}},"alternative-id":["10.1093\/logcom\/ext013"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/ext013","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published":{"date-parts":[[2013,5,31]]}}}