Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sublanguage
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{more citations needed|date=September 2009}} A '''sublanguage''' is a [[subset]] of a [[language]]. Sublanguages occur in [[natural language]], computer [[programming language]], and [[relational database]]s. ==In natural language== In [[Informatics (academic field)|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".<ref>{{cite book |last1=Harris |first1=Zellig |title=Language and Information |date=1988 |publisher=Columbia University Press |location=New York}}</ref><ref>{{cite book |last1=Kittredge |first1=Richard |last2=Lehrberger |first2=John |title=Sublanguage: Studies of language in restricted semantic domains |date=1982 |publisher=Walter de Gruyter |location=Berlin}}</ref><ref>{{cite book |last1=Sager |first1=Naomi |last2=NhΓ n |first2=NgΓ΄ Thanh |editor1-last=Nevin |editor1-first=Bruce E |editor2-last=Johnson |editor2-first=Stephen M |title=The Legacy of Zellig Harris |date=2002 |publisher=John Benjamins |location=Amsterdam/Philadelphia |pages=79β120 |url=https://cs.nyu.edu/sager/Computability_2002.pdf |accessdate=22 September 2020 |chapter=The computability of strings, transformations, and sublanguage}}</ref> This is a specific term for what in most linguistic study is referred to a language variety or register.<ref>{{cite journal |last1=Karlgren |first1=Jussi |title=Sublanguages and Registers β A Note On Terminology |journal=Interacting with Computers |date=1993 |volume=5 |issue=3 |pages=348β350 |doi=10.1016/0953-5438(93)90015-L |url=http://eprints.sics.se/54/1/registerIWCrevised.pdf |accessdate=22 September 2020}}</ref> ==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,<ref>[[SQL-92]], 4.22 SQL-statements, 4.22.1 Classes of SQL-statements "There are at least five ways of classifying SQL-statements:", 4.22.2, SQL statements classified by function "The following are the main classes of SQL-statements:"; [[SQL:2003]] 4.11 SQL-statements, and later revisions.</ref> 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).<ref>{{cite book |title=Structured Query Language By Example - Volume I: Data Query Language |first=Mark |last=Chatham |year=2012 |isbn=978-1-29119951-2 |page=[https://books.google.com/books?id=64MBBAAAQBAJ&pg=PA8 8] }}</ref> ==In relational database theory== In [[relational database]] theory, the term "sublanguage", first used for this purpose by [[Edgar F. Codd|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 RDBMS's are [[Query by Example|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.<ref>{{cite news |last1=Codd |first1=E |title=Computer World |work=Is Your DBMS Really Relational? |date=October 14, 1985}}</ref><ref>{{cite news |last1=Codd |first1=E |title=Computer World |work=Does Your DBMS Run By The Rules? |date=October 21, 1985}}</ref> 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)'' :* ''Integrity constraints'' :* ''Authorization'' :* ''Transaction boundaries (begin, commit, and rollback)'' ==References== {{Reflist}} [[Category:Relational model]] [[Category:Language]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Cite book
(
edit
)
Template:Cite journal
(
edit
)
Template:Cite news
(
edit
)
Template:More citations needed
(
edit
)
Template:Reflist
(
edit
)