{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:21Z","timestamp":1725664941471},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635765"},{"type":"electronic","value":"9783540696018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63576-9_98","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:31:52Z","timestamp":1330281112000},"page":"84-95","source":"Crossref","is-referenced-by-count":0,"title":["A variant of Earley parsing"],"prefix":"10.1007","author":[{"given":"Mark-Jan","family":"Nederhof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Satta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"4","key":"8_CR1","first-page":"205","volume":"11","author":"G. E. Barton Jr.","year":"1985","unstructured":"G. E. Barton, Jr. On the complexity of ID\/LP parsing. Computational Linguistics, 11(4):205\u2013218, 1985.","journal-title":"Computational Linguistics"},{"key":"8_CR2","unstructured":"J. Bear. A breadth-first parsing model. In Proc. of the Eighth International Joint Conference on Artificial Intelligence, volume 2, pages 696\u2013698, Karlsruhe, West Germany, August 1983."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"S. Billot and B. Lang. The structure of shared forests in ambiguous parsing. In Proc. of the 27 th ACL, pages 143\u2013151, Vancouver, British Columbia, Canada, 1989.","DOI":"10.3115\/981623.981641"},{"key":"8_CR4","series-title":"Technical Report No. 314","volume-title":"Practical unification-based parsing of natural language","author":"J. A. Carroll","year":"1993","unstructured":"J. A. Carroll. Practical unification-based parsing of natural language. Technical Report No. 314, University of Cambridge, Computer Laboratory, England, 1993. PhD thesis."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"J. Dowding, R. Moore, F. Andry, and D. Moran. Interleaving syntax and semantics in an efficient bottom-up parser. In Proc. of the 32 nd ACL, pages 110\u2013116, Las Cruces, New Mexico, 1994.","DOI":"10.3115\/981732.981748"},{"issue":"2","key":"8_CR6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"J. Earley. An efficient context-free parsing algorithm. Communications of the Association for Computing Machinery, 13(2):94\u2013102, 1970.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"8_CR7","unstructured":"D. Gardemann. Using restriction to optimize unification parsing. In International Workshop on Parsing Technologies, pages 8\u201317, Pittsburgh, 1989."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0065-2458(08)60451-9","volume-title":"Advances in Computers, volume 14","author":"S. L. Graham","year":"1976","unstructured":"S. L. Graham and M. A. Harrison. Parsing of general context free languages. In Advances in Computers, volume 14, pages 77\u2013185. Academic Press, New York, NY, 1976."},{"issue":"3","key":"8_CR9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/357103.357112","volume":"2","author":"S. L. Graham","year":"1980","unstructured":"S. L. Graham, M. A. Harrison, and W. L. Ruzzo. An improved context-free recognizes. ACM Transactions on Programming Languages and Systems, 2(3):415\u2013462, 1980.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR10","volume-title":"Natural Language Processing","author":"R. Kaplan","year":"1973","unstructured":"R. Kaplan. A general syntactic processor. In E. Rustin, editor, Natural Language Processing. Prentice-Hall, Englewood Cliffs, NJ, 1973."},{"key":"8_CR11","series-title":"Technical report CSL-80","volume-title":"Algorithm schemata and data structures in syntactic processing","author":"M. Kay","year":"1980","unstructured":"M. Kay. Algorithm schemata and data structures in syntactic processing. Technical report CSL-80, Xerox Palo Alto Research Center, Palo Alto, CA, 1980. Also in: B. J. Grosz, K. Sparck Jones and B. L. Webber, editors, Natural Language Processing, pages 35\u201370, Kaufmann, Los Altos, CA, 1986."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"R. Leermakers. How to cover a grammar. In Proc. of the 27 th ACL, pages 135\u2013142, Vancouver, British Columbia, Canada, 1989.","DOI":"10.3115\/981623.981640"},{"issue":"2","key":"8_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90260-3","volume":"41","author":"R. Leermakers","year":"1992","unstructured":"R. Leermakers. A recursive ascent Earley parser. Information Processing Letters, 41(2):87\u201391, February 1992.","journal-title":"Information Processing Letters"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(92)90127-2","volume":"104","author":"R. Leermakers","year":"1992","unstructured":"R. Leermakers. Recursive ascent parsing: from Earley to Marcus. Theoretical Computer Science, 104:299\u2013312, 1992.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"8_CR15","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1145\/88616.88637","volume":"12","author":"H. Leiss","year":"1990","unstructured":"H. Leiss. On Kilbury's modification of Earley's algorithm. ACM Transactions on Programming Languages and Systems, 12(4):610\u2013640, 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(91)90180-A","volume":"82","author":"J. M. I. M. Leo","year":"1991","unstructured":"J. M. I. M. Leo. A general context-free parsing algorithm running in linear time on every LR(\u03ba) grammar without using lookahead. Theoretical Computer Science, 82:165\u2013176, 1991.","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90877-3","volume-title":"Parsing","author":"S. Naumann","year":"1994","unstructured":"S. Naumann and H. Langer. Parsing. B.G. Teubner, Stuttgart, 1994."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"M. J. Nederhof. An optimal tabular parsing algorithm. In Proc. of the 32 nd ACL, pages 117\u2013124, Las Cruces, New Mexico, 1994.","DOI":"10.3115\/981732.981749"},{"issue":"1","key":"8_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S1351324996001234","volume":"2","author":"M. J. Nederhof","year":"1996","unstructured":"M. J. Nederhof. Efficient generation of random sentences. Natural Language Engineering, 2(1):1\u201313, 1996.","journal-title":"Natural Language Engineering"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"M. J. Nederhof and G. Satta. Efficient tabular LR parsing. In Proc. of the 34 th ACL, pages 239\u2013246, Santa Cruz, CA, 1996.","DOI":"10.3115\/981863.981895"},{"key":"8_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10245-0","volume-title":"Context-Free Grammars: Covers, Normal Forms, and Parsing, volume 93","author":"A. Nijholt","year":"1980","unstructured":"A. Nijholt. Context-Free Grammars: Covers, Normal Forms, and Parsing, volume 93. Springer-Verlag, Berlin, Germany, 1980."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"F. C. N. Pereira and D. H. D. Warren. Parsing as deduction. In Proc. of the 21 st ACL, pages 137\u2013144, Cambridge, MA, 1983.","DOI":"10.3115\/981311.981338"},{"key":"8_CR23","unstructured":"J. J. Schoorl and S. Belder. Computational linguistics at Delft: A status report. Report WTM\/TT 90-09, Delft University of Technology, Applied Linguistics Unit, 1990."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"P. Shann. Experiments with GLR and chart parsing. In M. Tomita, editor, Generalized LR Parsing. Kluwer Academic Publishers, 1991.","DOI":"10.1007\/978-1-4615-4034-2_2"},{"key":"8_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00630810","volume":"7","author":"S. M. Shieber","year":"1984","unstructured":"S. M. Shieber. Direct parsing of ID\/LP grammars. Linguistics and Philosophy, 7:135\u2013154, 1984.","journal-title":"Linguistics and Philosophy"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"S. M. Shieber. Using restriction to extend parsing algorithms for complex-feature-based formalisms. In Proc. of the 23 rd ACL, pages 145\u2013152, Chicago, IL, 1985.","DOI":"10.3115\/981210.981228"},{"issue":"1","key":"8_CR27","first-page":"1","volume":"15","author":"O. Stock","year":"1989","unstructured":"O. Stock. Parsing with flexibility, dynamic strategies, and idioms in mind. Computational Linguistics, 15(1):1\u201318, 1989.","journal-title":"Computational Linguistics"},{"key":"8_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00265077","volume":"5","author":"A. Wijngaarden van","year":"1975","unstructured":"A. van Wijngaarden et al. Revised report on the algorithmic language ALGOL 68. Acta Informatica, 5:1\u2013236, 1975.","journal-title":"Acta Informatica"},{"key":"8_CR29","unstructured":"T. G. Vosse. The Word Connection. PhD thesis, University of Leiden, 1994."},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"M. Wiren. A comparison of rule-invocation strategies in parsing. In Proc. of the 3 rd EACL, pages 226\u2013233, Copenhagen, Denmark, 1987.","DOI":"10.3115\/976858.976895"}],"container-title":["Lecture Notes in Computer Science","AI*IA 97: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63576-9_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:10Z","timestamp":1605629950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63576-9_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635765","9783540696018"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-63576-9_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}