Search results for keyword `applic.NL'

[27]

Zoltan Alexin, Tibor Gyimóthy, Tamas Horváth, and Karoly Fábricz. Attribute grammar specification for a natural language understanding interface. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 313-326. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[294]

R. A. Frost and S. Karamatos. Supporting the Attribute Grammar Programming Paradigm in a Lazy Functional Programming Language, volume 693 of Lecture Notes in Computer Science, pages 278-295. Springer Verlag, 1993.

Attribute grammars were introduced in the late 60's. In the 70's they found use in compiler work, a use that is continuing to grow. A more recent development is that of the ``attribute grammar programming paradigm''. A number of environments have been built to support this paradigm. W/AGE is one such environment. It consists of several functions that extend the standard environment of the pure lazy functional programming language Miranda. W/AGE has been used in the construction of various types of program including natural language interpreters, database front-ends, file-processors, theorem provers, and VLSI specification transformers.

[295]

R. A. Frost and W. S. Saba. A database interface based on montague's approach to the interpretation of natural language. International Journal of Man-Machine Studies, 33(2):149-176, 1990.

In this paper we describe a database interface that is loosely based upon some of the concepts proposed by Richard Montague in his approach to the interpretation of natural language. The system is implemented as an executable attribute grammar specified in a higher order, lazy, pure functional programming language. The attribute grammar formalism provides a simple means of implementing Montague's notion of "semantic rule to syntactic rule correspondence" and the higher order functional language in which the attributes grammar is constructed provides an appropriate vehicle for implementing Montague's higher order semantics. The purpose of the paper is two-fold: (i) to demonstrate that many of Montague's ideas can be used to advantage in creating natural language interfaces to databases, and (ii) to introduce a method for implementing attribute grammars in functional languages that is suitable for investigating both grammars and semantic theories of language.

[301]

R. A. Frost. Guarded attribute grammars. Software - Practice and Experience, 23(10):1139-1156, 1993.

Contrary to a widely-held belief it is possible to construct executable specifications of language processors that use a top-down parsing strategy and which have structures that directly reflect the structure of grammars containing left-recursive productions. A novel technique has been discovered by which the non-termination that would otherwise occur is avoided by 'guarding' top-down left-recursive language processors by non-left-recursive recognizers. The use of a top-down parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations. A combination of the two is of significant practical value because it results in modular and expressively clear executable specifications of language processors. The new approach has been tested in an attribute grammar programming environment that has been used in a number of projects including the development of natural language interfaces, SQL processors and circuit design transformers within a VLSI design package.

[372]

Tibor Gyimóthy. Natural languages interface construction using attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 460-468. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

Natural language interfaces represent one of the most common applications of natural language processing. In the eighties, not only a considerable increase in natural language interface refinement has been achieved, but also methods for design and evaluation have been worked out. One might think that a natural language interface of the nineties would be properly described in terms of three parameters, viz. begin itemize item transportability item modifiability by the user item generality end itemize We have implemented a software package for plane geometry constructions called THALES footnote THALES is a product of Cogito Co., Ltd, Hungary supplied with a natural language interface. Our experience with THALES shows that none of these features is attainable in the near future. Rather, natural language interfaces based on well-defined subsets of languages and supplemented with possibly full semantics appear to be real candidates for applications in the following years.

[553]

John Kontos. Natural language processing of scientific/technical data, knowledge and text bases. In Artint Workshop, Luxembourg, 1985. Re'fe'rence a` comple'ter.

[617]

Michael Levison and Gregory Lessard. Application of attribute grammars to natural language sentence generation. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 298-312. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[819]

J. V. Pitt and R. J. Cunningham. Attributed translation and the semantics of natural language. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 284-297. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[820]

Jeremy Pitt and Jim Cunningham. Attribute grammars and the semantics of natural language. Technical report, 1990.

When Knuth introduced attribute grammars, he observed that although ``oriented primarily towards programming languages, the same methods appear to be relevant also in the study of natural languages''. We demonstrate that his intuition is computationally justifiable, based on the algebraic equivalence of attribute grammars and Montague's theory of Universal Grammar. We discuss the relationship between attribute grammars, axiomatic theories and logic programming. We find that attribute grammars can be used to encode an algebraic specification of a natural language, attributed translation used to compute representations of the `meaning' of a sentence at different levels of abstraction, and that the specifications can be implemented as logic programs. We illustrate the application of non-deterministic attributed translation to natural language by the specification of a subset of Montague's PTQ, including a treatment of some semantic ambiguities