Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Modular generation of relational query paraphrases
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS. University of Umeå.ORCID iD: 0000-0001-7088-3070
2006 (English)In: Research on Language & Computation, ISSN 1570-7075, E-ISSN 1572-8706, Vol. 4, no 1, 9-37 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 Schema Tuple Query Processor (STEP) system (http://www.cs.umu.se/ ~mjm/step). 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, 9-37 p.
Keyword [en]
Cooperative information systems, Logical form equivalence, Modularity, Natural language generation, Paraphrasing SQL, Relational databases, Tuple relational calculus
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-66386DOI: 10.1007/s11168-006-9009-8Scopus ID: 2-s2.0-33744784602OAI: oai:DiVA.org:kth-66386DiVA: diva2:483840
Note

QC 20120229

Available from: 2012-01-26 Created: 2012-01-26 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Minock, Michael

Search in DiVA

By author/editor
Minock, Michael
By organisation
Theoretical Computer Science, TCS
In the same journal
Research on Language & Computation
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf