| { |
| "paper_id": "J88-2011", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T02:56:11.694950Z" |
| }, |
| "title": "", |
| "authors": [ |
| { |
| "first": "Fernando", |
| "middle": [ |
| "C N" |
| ], |
| "last": "Pereira", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Stanford University", |
| "location": { |
| "postCode": "1987", |
| "settlement": "Stanford, viii + 260 pP", |
| "region": "CA" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Stuart", |
| "middle": [ |
| "M" |
| ], |
| "last": "Shieber", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Stanford University", |
| "location": { |
| "postCode": "1987", |
| "settlement": "Stanford, viii + 260 pP", |
| "region": "CA" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "", |
| "pdf_parse": { |
| "paper_id": "J88-2011", |
| "_pdf_hash": "", |
| "abstract": [], |
| "body_text": [ |
| { |
| "text": "I have often met linguists and computational linguists willing to read a short, simple, and well-documented textbook about the use of Prolog for natural-language understanding. I feel that this well-written book mainly devoted to Prolog and logic grammars to a large extent meets the challenge. I will here summarize and comment on each chapter, and conclude by pointing out aspects I would have liked to see included in this introductory book.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Besides the presentation of concepts and examples, each chapter contains several exercises left to the reader and exhaustive bibliographic notes. I only regret that no answers to the exercises are provided as is usually the case for textbooks. These exercises are often nontrivial for the beginner and commented answers would have made them much more attractive and useful. Another interesting point is the internal structure of each chapter: two themes (Prolog and logic grammars) are tackled in a parallel and progressive way.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Chapter 1 is a very short introduction to logic pro= gramming, Prolog, and natural language. It also includes a list of prerequisites (which does not constitute a real constraint for a novice in the area) and some general historical material about the field and related fields.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Chapter 2 begins with an introduction to Prolog, viewed as a means to encode knowledge in a declarative way. The presentation is simple and classical. Section 2.3, about the logic of Prolog, is probably the best presentation of the topic I have ever seen, apart from the excellent book The Art of Prolog (Sterling and Shapiro 1986) . To conclude this brief introduction, a problem section deals with the representation of semantic networks. This chapter ends by the development of an implementation method for context-free grammars in Prolog. A trace of the parsing of a short sentence helps the user to understand how the proof procedure of Prolog is used as a parsing mechanism.", |
| "cite_spans": [ |
| { |
| "start": 304, |
| "end": 331, |
| "text": "(Sterling and Shapiro 1986)", |
| "ref_id": "BIBREF2" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Chapter 3, entitled \"Pure Prolog: Theory and application,\" observes the same structure as the previous chapter. It first introduces more complex concepts, techniques, and data-structures of Prolog, illustrated by typical short programs, most of them belonging to the classics of the field. Then, more material about formal aspects of Prolog (e.g., substitutions and unification, resolution and the semantics of Prolog) is given. Finally, definite-clause grammars (DCGs) are introduced. They constitute the basic form of logic grammars from which several formalisms have been developed, motivated either by linguistic considerations or by the need of providing grammar writers with more transparent formulations of grammars. DCGs have themselves partly emerged from metamorphosis grammars (Colmerauer 1978) , which is a general framework to deal with type-0 grammars. Besides a basic implementation of DCGs, the authors introduce fundamental techniques to build parsing trees, to deal with PP-attachment and to express different kinds of agreements.", |
| "cite_spans": [ |
| { |
| "start": 788, |
| "end": 805, |
| "text": "(Colmerauer 1978)", |
| "ref_id": "BIBREF0" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Chapter 4 is divided into two parts: some very basic principles for semantic interpretation are given, and then the syntactic coverage of the grammar given in the previous chapter is extended. The first section of this chapter shows how the basic principles of computational semantics are dealt with in Prolog by means of logical variables. The authors then focus on quantified noun phrases and quantifier scoping. Although the programming techniques given in this latter section are of much interest, the idea of generating all possible quantifier scopings without any further refinements seems to me to be a little too superficial, given the actual state of the art. Next, the syntactic coverage of the previous grammar is extended. Of particular interest is the way filler-gap dependencies are expressed in an efficient way for simple linguistic constructions. The technique of difference lists is then introduced to permit an efficient treatment of those dependencies. The implementation of simple island constraints is also given to emphasize the relevance of the difference-list technique. Finally, the problem section addresses grammar extensions such as noun complements and modifiers. This chapter is the central part of the book and provides a good basis for the reader who is willing to write his own grammar. However, I feel that the semanticinterpretation section should have been a little more developed, since I. the main goal of language processing is to understand a sentence or a text via its semantic representation, and 2. the semantic interpretation of other constructions like modifiers requires improvements of the basic construction method presented here and would be worth presenting at this levee The probable reason for this lack of development is that relatively few works have been undertaken in the area of semantic representation and interpretation Using Prolog.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Chapter 5 introduces metalogical facilities offered by standard Prolog (e.g., built-in predicates like call, cut, set 03') and then proposes a simple dialogue program. Chapter 6 is entirely devoted to the construction of interpreters for DCGs. Interpreters mainly permit one to circumvent computational problems like left-recursion in grammar rules, implementing parsing strategies different from the strategy imposed by Prolog, and partly automating the writing of rules. For example, arguments having a regular and predictable structure (parse tree building, logical form construction, etc.) can be automatically included in grammar rules. Such interpreters are written in Prolog and they transform a Prolog-like program into one that is directly executable. Fundamental techniques are proposed and illustrated for DCGs, such as automated construction of proof trees, interpretation of filler-gap dependencies, partial execution, and tabular parsing (i.e., chart parsing). The book ends with annotated sample programs that integrate most of the material presented in the preceding chapters. The bibliography is relevant and comprehensive, given the aims of the book.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "To conclude, I feel that this book includes most of the material one would wish to see in an introductory book. By a small number of linguistic concepts and constructions, the authors present the main techniques a grammar writer can use in a large number of situations. There are, however, some points I would have liked to see included in this book. Very few parsers directly use the linguistic framework proposed here but rather are inspired by GPSGs, LFGs, HPSGs, UGs, etc. Thus it would have been of particular interest to have guidelines on Prolog techniques useful to such computational-linguistics frameworks. Some aspects, like feature percolation and control in GPSGs, are probably not trivial to deal with.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "In spite of these nonessential restrictions, I feel that this book should be read by everyone in the field having a minimum interest in Prolog. This very convincing book also suggests the reading of more complex publications in the field like Dahl and St.-Dizier (1985, 1988) and JLP (1986) .", |
| "cite_spans": [ |
| { |
| "start": 243, |
| "end": 251, |
| "text": "Dahl and", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 252, |
| "end": 275, |
| "text": "St.-Dizier (1985, 1988)", |
| "ref_id": null |
| }, |
| { |
| "start": 280, |
| "end": 290, |
| "text": "JLP (1986)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Patrick Saint-Dizier was one of the organizers of the Workshop on Natural-Language Understanding and Logic Programming, and is editor of the forthcoming proceedings, to be published by North-Holland. In 1987, he was a visitor at Simon Fraser University. Saint-Dizier's address is: Institut de recherche en informatique et syst~mes al~atoires, Campus Universitaire de Beaulieu, Avenue du G~n6ral Leclerc, 35042--Rennes C6dex, France.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Patrick Saint-Dizier IRISA-INRIA", |
| "sec_num": null |
| }, |
| { |
| "text": "Masaru Tomita (Carnegie-Mellon University, Pittsburgh, PA) Boston, MA: Kluwer Academic Publishers, 1986, xviii + 201 pp. ISBN 0-89838-202-5, $39.95 (hb) ", |
| "cite_spans": [ |
| { |
| "start": 67, |
| "end": 152, |
| "text": "MA: Kluwer Academic Publishers, 1986, xviii + 201 pp. ISBN 0-89838-202-5, $39.95 (hb)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "EFFICIENT PARSING FOR NATURAL LANGUAGE: A FAST ALGORITHM FOR PRACTICAL SYSTEMS (THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE: NATURAL-LANGUAGE PROCESSING AND MACHINE TRANSLATION)", |
| "sec_num": null |
| }, |
| { |
| "text": "This book introduces a context-flee parsing algorithm that is intended to be particularly useful in naturallanguage processing. Practical applications of the algorithm are discussed, including on-line parsing, interactive machine translation, and a technique to disambiguate a sentence by consulting the user interactively. The book opens with a diagnosis of the current state of work on parsing context-flee languages. Two kinds of\" algorithms for context-flee languages are available: specific algorithms for programming languages, and general algorithms intended to handle any contextfree grammar. Neither of them, however, is suitable for natural languages. The former are very fast but not powerful enough to cope with some syntactic phenomena of natural languages; the latter are even too powerful, and therefore not so efficient as they could be. Tomita's solution to the problem is to find something in between: an algorithm that would be nongeneral in the class of context-flee languages yet still powerful enough to handle the great many ambiguities inherent in any natural language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Miroslaw Batiko Warsaw University", |
| "sec_num": null |
| }, |
| { |
| "text": "The algorithm described can be viewed as an extension of the LR parsing algorithm, which is used for programming languages (Aho and Ullman 1977) . Like the LR algorithm, it works strictly from left to right and is entirely table-driven; unlike the LR algorithm, however, it is intended to parse ambiguous sentences, and does it most efficiently, using the data structures that have been specially designed for it. The current state of parsing is represented in the form of a directed acyclic graph, and no part of an input sentence is parsed more than once in the same way. All the possible parses of an ambiguous sentence are produced in parallel and stored in a packed shared forest (PSF) for later computation. While the number of parses grows exponentially, the size of the PSF increases polynomially. The only other algorithm that produces a polynomial-sized parse forest without requiring a grammar to be in Chomsky Normal Form is Earley's (1970) general algorithm intended to handle any type of context-flee grammar. Tomita shows, however, that Earley's original algorithm has a", |
| "cite_spans": [ |
| { |
| "start": 123, |
| "end": 144, |
| "text": "(Aho and Ullman 1977)", |
| "ref_id": null |
| }, |
| { |
| "start": 937, |
| "end": 952, |
| "text": "Earley's (1970)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Reviewed by Miroslaw Batiko Warsaw University", |
| "sec_num": null |
| }, |
| { |
| "text": "Computational Linguistics, Volume 14, Number 2, June 1988", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Metamorphosis Grammars", |
| "authors": [ |
| { |
| "first": "A", |
| "middle": [], |
| "last": "Colmerauer", |
| "suffix": "" |
| } |
| ], |
| "year": 1978, |
| "venue": "In Lecture Notes in Computer Science", |
| "volume": "63", |
| "issue": "", |
| "pages": "133--189", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Colmerauer, A. 1978. Metamorphosis Grammars. In Lecture Notes in Computer Science, 63: 133-189, L. Bolc, (ed.). Springer-Verlag.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Natural Language Understanding and Logic Programming I and H", |
| "authors": [ |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Dahl", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Saint-Dizier", |
| "suffix": "" |
| } |
| ], |
| "year": 1985, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dahl, V. and Saint-Dizier, P. (Eds.) 1985, 1988. Natural Language Understanding and Logic Programming I and H. North-Holland.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "The Art of Prolog", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Sterling", |
| "suffix": "" |
| }, |
| { |
| "first": "E", |
| "middle": [], |
| "last": "Shapiro", |
| "suffix": "" |
| } |
| ], |
| "year": 1986, |
| "venue": "Special Issue of the Journal of Logic Programming on Natural Language Understanding", |
| "volume": "3", |
| "issue": "4", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sterling, L. and Shapiro, E. 1986. The Art of Prolog. MIT Press, Cambridge, MA. JLP 1986. Special Issue of the Journal of Logic Programming on Natural Language Understanding 3(4), December 1986.", |
| "links": null |
| } |
| }, |
| "ref_entries": {} |
| } |
| } |
