{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T04:33:06Z","timestamp":1712896386837},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0020-0190(92)90260-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"87-91","source":"Crossref","is-referenced-by-count":9,"title":["A recursive ascent Earley parser"],"prefix":"10.1016","volume":"41","author":[{"given":"Ren\u00e9","family":"Leermakers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0020-0190(92)90260-3_BIB1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(92)90260-3_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90061-0","article-title":"On a recursive ascent parser","volume":"29","author":"Kruseman Aretz","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90260-3_BIB3","doi-asserted-by":"crossref","DOI":"10.3115\/977180.977192","article-title":"Non-deterministic recursive ascent parsing","author":"Leermakers","year":"1991","journal-title":"Proc. 5th Conf. of the European Chapter of the Association of Computational Linguistics"},{"key":"10.1016\/0020-0190(92)90260-3_BIB4","doi-asserted-by":"crossref","unstructured":"R. Leermakers, I. Augusteijn and F.E.J. Kruseman Aretz, A functional LR-parser, Theoret. Comput. Sci., accepted for publication.","DOI":"10.1016\/0304-3975(92)90128-3"},{"key":"10.1016\/0020-0190(92)90260-3_BIB5","series-title":"Efficient Parsing for Natural Language, A Fast Algorithm for Practical Systems","author":"Tomita","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092902603?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092902603?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:11Z","timestamp":1555129571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092902603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0020019092902603"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90260-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}