{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:54:37Z","timestamp":1743137677498,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642253232"},{"type":"electronic","value":"9783642253249"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25324-9_25","type":"book-chapter","created":{"date-parts":[[2011,11,21]],"date-time":"2011-11-21T13:04:10Z","timestamp":1321880650000},"page":"291-304","source":"Crossref","is-referenced-by-count":0,"title":["Modular Natural Language Processing Using Declarative Attribute Grammars"],"prefix":"10.1007","author":[{"given":"Rahmatullah","family":"Hafiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard A.","family":"Frost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Hudak, P., Peterson, J., Fasel, J.: A gentle introduction to haskell 98. Technical report (1999)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Pereira, F.C.N., Warren, D.: Definite clause grammars for language analysis. Artificial Intelligence\u00a013 (1980)","DOI":"10.1016\/0004-3702(80)90003-X"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Koster, C.H.A.: Affix grammars for natural languages. In: Attribute Grammars, Applications, and Systems, pp. 469\u2013484 (1991)","DOI":"10.1007\/3-540-54572-7_19"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Billot, S., Lang, B.: The structure of shared forests in ambiguous parsing. In: 27th ACL, BC, Canada, pp. 143\u2013151 (1989)","DOI":"10.3115\/981623.981641"},{"key":"25_CR5","unstructured":"Norvig, P.: Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics, 91\u201398 (1991)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P. Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, Springer, Heidelberg (1995)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Frost, R., Hafiz, R., Callaghan, P.: Parser combinators for ambiguous left-recursive grammars. In: ACM-PADL, pp. 167\u2013181 (2008)","DOI":"10.1007\/978-3-540-77442-6_12"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers (1986)","DOI":"10.1007\/978-1-4757-1885-0"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In: 2nd Colloquium on Automata, Languages and Programming, pp. 255\u2013269 (1974)","DOI":"10.1007\/3-540-06841-4_65"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-73351-5_2","volume-title":"Natural Language Processing and Information Systems","author":"R.A. Frost","year":"2007","unstructured":"Frost, R.A., Fortier, R.J.: An Efficient Denotational Semantics for Natural Language Database Queries. In: Kedad, Z., Lammari, N., M\u00e9tais, E., Meziane, F., Rezgui, Y. (eds.) NLDB 2007. LNCS, vol.\u00a04592, pp. 12\u201324. Springer, Heidelberg (2007)"},{"key":"25_CR11","first-page":"127","volume-title":"Theory of Computing Systems","author":"D. Knuth","year":"1968","unstructured":"Knuth, D.: Semantics of context-free languages. In: Theory of Computing Systems, vol.\u00a02, pp. 127\u2013145. Springer, New York (1968)"},{"key":"25_CR12","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Parsing. Prentice Hall (1972)"},{"key":"25_CR13","unstructured":"De Moor, O., Backhouse, K., Swierstra, D.: First-class attribute grammars. In: 3rd Workshop on AGs and their Applications (2000)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10250-7_31","volume-title":"Semantics-Directed Compiler Generation","author":"M. Tienari","year":"1980","unstructured":"Tienari, M.: On the definition of attribute grammar. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation. LNCS, vol.\u00a094, Springer, Heidelberg (1980)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Vogt, H.H., Swierstra, S.D., Kuiper, M.F.: Higher order attribute grammars. In: PLDI, pp. 131\u2013145. ACM (1989)","DOI":"10.1145\/74818.74830"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Wadler, P.: How to replace failure by a list of successes. In: FP Languages and Computer Architecture, vol.\u00a0201, pp. 113\u2013128 (1985)","DOI":"10.1007\/3-540-15975-4_33"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Frost, R., Launchbury, J.: Constructing natural language interpreters in a lazy functional language. The Computer Journal\u00a032(2) (1989)","DOI":"10.1093\/comjnl\/32.2.108"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Hafiz, R., Frost, R.A.: Lazy combinators for executable specifications of general attribute grammars. In: ACM-PADL, pp. 167\u2013182 (2010)","DOI":"10.1007\/978-3-642-11503-5_15"},{"key":"25_CR19","unstructured":"Shieber, S.: An introduction to unification-based theories of grammar. CSLI Lecture Notes Series. University of Chicago Press (1986)"},{"key":"25_CR20","first-page":"73","volume":"8","author":"N. Correa","year":"1993","unstructured":"Correa, N.: Attribute and unification grammar: A review and analysis of formalisms. Annals of Mathematics and AI\u00a08, 73\u2013105 (1993)","journal-title":"Annals of Mathematics and AI"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? NL Parsing, Cambridge Uni. (1985)","DOI":"10.1017\/CBO9780511597855.007"},{"issue":"6","key":"25_CR22","first-page":"511","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Theory of Computing Systems\u00a027(6), 511\u2013546 (1994)","journal-title":"Theory of Computing Systems"},{"issue":"6","key":"25_CR23","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1023\/B:LING.0000004545.49963.94","volume":"26","author":"M. Kudlek","year":"2003","unstructured":"Kudlek, M., Mart\u2019in-Vide, C., Mateescu, A., MitranaSource, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy\u00a026(6), 703\u2013725 (2003)","journal-title":"Linguistics and Philosophy"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25324-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T20:50:11Z","timestamp":1593291011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25324-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642253232","9783642253249"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25324-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}