Change search
ReferencesLink to record
Permanent link

Direct link
Modular Generation of Relational Query Paraphrases
Umeå University, Faculty of Science and Technology, Computing Science.
2006 (English)In: Research on Language and Computation: Formal Issues in Natural Language Generation, Vol. 4, no 1, 28- p.Article in journal (Refereed) Published
Abstract [en]

This article proposes a novel technique to generate natural language descriptions for a wide class of relational database queries. The approach to describing queries is phrasal and is restricted to a class of queries that return only whole schema tuples as answers. Query containment and equivalence are decidable for this class and this property is exploited in the maintenance and use of a phrasal lexicon. The query description mechanism is implemented within the STEP (Schema Tuple Query Processor) system.

Because the said query class is also closed over elementary set operations, it may be reasoned with in a relatively unrestricted manner. This enables a modular separation between a reasoning component and a `tactical' realization component. To demonstrate this modularity, this fragment is shown to be adequate for several cooperative reasoning techniques. Thus the cooperative information system serves as the `strategic' component, deciding what to say, while the generation system acts as the `tactical' component, deciding how to say it. Naturally expressions within the said query language are the interchange language between these two components.

Place, publisher, year, edition, pages
2006. Vol. 4, no 1, 28- p.
URN: urn:nbn:se:umu:diva-9535OAI: diva2:149206
Available from: 2008-04-18 Created: 2008-04-18 Last updated: 2011-01-11Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Minock, Michael
By organisation
Computing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 25 hits
ReferencesLink to record
Permanent link

Direct link