Back

ⓘ Sublanguage




                                     

ⓘ Sublanguage

In informatics, natural language processing, and machine translation, a sublanguage is the language of a restricted domain, particularly a technical domain. In mathematical terms, "a subset of the sentences of a language forms a sublanguage of that language if it is closed under some operations of the language: e.g., if when two members of a subset are operated on, as by and or because, the resultant is also a member of that subset".

                                     

1. In computer languages

The term sublanguage has also sometimes been used to denote a computer language that is a subset of another language. A sublanguage may be restricted syntactically it accepts a subgrammar of the original language, and/or semantically the set of possible outcomes for any given program is a subset of the possible outcomes in the original language.

Examples

For instance, ALGOL 68S was a subset of ALGOL 68 designed to make it possible to write a single-pass compiler for this sublanguage.

SQL Structured Query Language statements are classified in various ways, which can be grouped into sublanguages, commonly: a data query language DQL, a data definition language DDL, a data control language DCL, and a data manipulation language DML.

                                     

2. In relational database theory

In relational database theory, the term "sublanguage", first used for this purpose by E. F. Codd in 1970, refers to a computer language used to define or manipulate the structure and contents of a relational database management system RDBMS. Typical sublanguages associated with modern RDBMSs are QBE Query by Example and SQL Structured Query Language. In 1985, Codd encapsulated his thinking in twelve rules which every database must satisfy in order to be truly relational. The fifth rule is known as the Comprehensive data sublanguage rule, and states:

A relational system may support several languages and various modes of terminal use for example, the fill-in-the-blanks mode. However, there must be at least one language whose statements are expressible, per some well-defined syntax, as character strings, and that is comprehensive in supporting all of the following items:
  • Data definition
  • View definition
  • Data manipulation interactive and by program
  • Authorization
  • Transaction boundaries
  • Integrity constraints
                                     
  • In mathematical logic, various sublanguages of set theory are decidable. These include: Sets with Monotone, Additive, and Multiplicative Functions. Sets
  • database approach. It was defined in Codd s 1971 paper A Data Base Sublanguage Founded on the Relational Calculus Alpha influenced the design of QUEL
  • to convert sublanguage texts into suitable data formats for retrieval. This was one of the first major practical applications of sublanguage analysis.
  • Source is a family of sublanguages of JavaScript, developed for the textbook Structure and Interpretation of Computer Programs, JavaScript Adaptation SICP
  • a rich pattern specification sublanguage a graph transformation sublanguage and a high level control - flow sublanguage It has been designed to address
  • The book describes computer science concepts using Source, a series of sublanguages of JavaScript. It also uses a virtual register machine and assembler
  • interrogation as they apply to the regular data. Rule 5: The comprehensive data sublanguage rule: A relational system may support several languages and various modes
  • That year Sakizaya language was designated both as a Chilai and Amis sublanguage Both are included in the family of Austronesian languages. On 17 January
  • science of sublanguage analysis Kittredge Lehrberger 1982 culminating in a demonstration of the informational structures in texts of a sublanguage of science
  • decomposition lattices algebraic structures in language, operator grammar, sublanguage grammar, a theory of linguistic information, and a principled account
  • ogranichennogo podyazyka Methods of Semantic Investigation of a Restricted Sublanguage 414 pp. Moscow University Press, 1971 with B. Gorodetsky Slovari