|Title:||A Precise Definition of RRA - a Reshaped Relational Algebra which Follows Natural Language Constructs
|Abstract:||RRA - the Reshaped Relational Algebra is equivalent to the regular Relational Algebra (RA), ,but has different operators. Its operators, a modification of the RA's ones, are intendetd to follow the semantics of queries phrased in Natural English Language (NL). For each operator there is an appropriate elementary syntactical construct of natural language. These elementary constructs can be combined to form complex sentences (queries), having semantics given by algebraic expressions composed of respective operators. As such, the RRA is useful both in defining semantics for Natural Language subsets or languages alike, and in implementing efficiently NL translators for interfaces to relational databases. A precise definition of RRA is given and its connection to Natural Language is explained. It is also shown that RRA is equivalent to RA.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0405), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion