Jump to content

Controlled natural language: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Steguru (talk | contribs)
43 edits
GreenC bot (talk | contribs)
Bots
2,521,420 edits
 
(86 intermediate revisions by 50 users not shown)
Line 1: Line 1:
{{short description|Subset of a natural language}}
'''Controlled natural languages''' (CNLs) are subsets of natural languages, obtained by
'''Controlled natural languages''' ('''CNLs''') are subsets of [[natural language]]s that are obtained by restricting the grammar and vocabulary in order to reduce or eliminate [[ambiguity]] and complexity. Traditionally, controlled languages fall into two major types: those that improve readability for human readers (e.g. non-native speakers),
restricting the grammar and vocabulary in order
and those that enable reliable automatic [[Semantic analysis (linguistics)|semantic analysis]] of the language.<ref>{{Cite web |title=A Survey and Classification of Controlled Natural Languages |url=https://direct.mit.edu/coli/article/40/1/121/1455/A-Survey-and-Classification-of-Controlled-Natural |access-date=2024-03-27 |website=direct.mit.edu}}</ref><ref>{{Cite web |title=Controlled Natural Languages for language generation in artificial cognition |url=https://ieeexplore.ieee.org/document/6907843 |access-date=2024-03-27 |website=[[IEEE]]}}</ref>
to reduce or eliminate [[ambiguity]] and complexity.
Traditionally, controlled languages fall into two major types:
those that improve readability for human readers (e.g. non-native speakers),
and those that enable reliable automatic semantic analysis of the language.


The first type of languages (often called "simplified" or "technical" languages), for example [[ASD Simplified Technical English]], Caterpillar Technical English, [[IBM]]'s Easy English, are used in the industry to increase the quality of technical documentation, and possibly simplify the [[Computer-assisted translation|semi-automatic translation]] of the documentation. These languages restrict the writer by general rules such as "Keep sentences short", "Avoid the use of [[pronoun]]s", "Only use dictionary-approved words", and "Use only the [[active voice]]".<ref>{{cite conference |url=http://www.mt-archive.info/CLT-2003-Obrien.pdf |title=Controlling Controlled English – An Analysis of Several Controlled Language Rule Sets |first=Sharon |last=O'Brien |year=2003 |book-title=Proceedings of EAMT-CLAW |access-date=2011-12-30 |archive-date=2016-03-03 |archive-url=https://web.archive.org/web/20160303181833/http://www.mt-archive.info/CLT-2003-Obrien.pdf |url-status=dead }}</ref>
The first type of languages (often called "simplified" or "technical" languages),
for example ASD Simplified Technical
English,
Caterpillar Technical English, IBM's Easy English,
are used in the industry to increase the quality of technical documentation,
and possibly simplify the (semi-)automatic translation of the documentation.
These languages restrict the writer by general rules such as "Keep sentences short",
"Avoid the use of pronouns", "Only use dictionary-approved words", and "Use only the active voice".<ref>{{cite conference |url=http://www.mt-archive.info/CLT-2003-Obrien.pdf |title=Controlling Controlled English - An Analysis of Several Controlled Language Rule Sets |author=Sharon O'Brien |date=2003 |booktitle=Proceedings of EAMT-CLAW }}</ref>


The second type of languages have a formal syntax and [[formal semantics (natural language)|formal semantics]], and can be mapped to an existing [[formal language]], such as [[first-order logic]]. Thus, those languages can be used as [[knowledge representation language]]s,<ref>Schwitter, Rolf. "[http://staff.um.edu.mt/mros1/cnl2010/TALKS/schwitter_tutorial.pdf Controlled natural languages for knowledge representation]." Proceedings of the 23rd International Conference on Computational Linguistics: Posters. Association for Computational Linguistics, 2010.</ref> and writing of those languages is supported by fully automatic [[consistency]] and redundancy checks, [[query answering]], etc.
The second type of languages have a formal logical basis, i.e. they have a formal syntax
and semantics, and can be mapped to an existing formal language, such as [[first-order logic]].
Thus, those languages can be used as [[knowledge representation|knowledge-representation]] languages, and writing of
those languages is supported by fully automatic consistency and redundancy checks, query answering, etc.


==Languages==
==Languages==
Existing logic-based controlled natural languages include<ref name="Pool2006">Jonathan Pool [http://utilika.org/pubs/etc/ambigcl/clweb.html Can Controlled Languages Scale to the Web?] (2006)</ref>:
Existing controlled natural languages include:<ref>{{Cite journal|doi = 10.1162/COLI_a_00168|title = A Survey and Classification of Controlled Natural Languages|year = 2014|last1 = Kuhn|first1 = Tobias|journal = Computational Linguistics|volume = 40|pages = 121–170|s2cid = 14586568|doi-access = free|arxiv = 1507.01701}}</ref><ref name="Pool2006">{{cite journal | first = Jonathan | last = Pool | url = http://utilika.org/pubs/etc/ambigcl/clweb.html | title = Can Controlled Languages Scale to the Web? | year = 2006 | url-status = dead | archive-url = https://web.archive.org/web/20090815035716/http://utilika.org/pubs/etc/ambigcl/clweb.html | archive-date = 2009-08-15 }}</ref>


{{div col}}
* [[Attempto Controlled English]]
* [[Common Logic Controlled English]] (CLCE)
* [[ASD Simplified Technical English]]
* [[Attempto Controlled English]]<ref>{{cite conference |author1=Norbert E. Fuchs |author2=Kaarel Kaljurand |author3=Gerold Schneider | title = Attempto Controlled English Meets the Challenges of Knowledge Representation, Reasoning, Interoperability and User Interfaces | book-title = FLAIRS 2006 | date = 2006 | url = http://attempto.ifi.uzh.ch/site/publications/papers/FLAIRS0601FuchsN.pdf }}</ref>
* [[Pseudo Natural Language]] (PNL)
* [[Rabbit (language)|Rabbit]]
* [[Aviation English]]
* [[Basic English]]<ref>{{cite book|last1=Ogden|first1=Charles Kay|title=Basic English: A General Introduction with Rules and Grammar|date=1930|publisher=Paul Treber & Co., Ltd.|location=London}}</ref>
* [[PENG (language)|PENG]] (Processable ENGlish)
* [[Restricted Natural Language Statements]] (RNLS)<ref name="Breaux">T.D. Breaux, A.I. Anton, J. Doyle, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.128.2949&rep=rep1&type=pdf "Semantic parameterization: a process for modeling domain descriptions"], ''ACM Transactions on Software Engineering Methodology'', vol. 18, no. 2, Article 5, 2008.</ref>
⚫
* [[Semantics of Business Vocabulary and Business Rules]]
* [[ClearTalk]]
* [[ClearTalk]]
* [[Common Logic]] Controlled English<ref>{{cite web|url=http://www.jfsowa.com/clce/specs.htm|title=Common Logic Controlled English|website=www.jfsowa.com|access-date=27 August 2017}}</ref>

* [[Distributed Language Translation]] Esperanto
Other existing controlled natural languages include:
* [[Easy Japanese]]
* [[ASD Simplified Technical English]]
⚫
* [[Basic English]]
* [[E-Prime]]
* [[E-Prime]]
* [[Gellish]]
* [[Français fondamental]]
* [[Gellish|Gellish Formal English]]
⚫
* [[Newspeak]]
* Interlingua-IL sive [[Latino sine flexione]] ([[Giuseppe Peano]])
* [[Controlled Language Optimized for Uniform Translation]] (CLOUT)
* Logical English<ref>Kowalski, R., Dávila, J., Sartor, G. and Calejo, M., 2023. Logical English for law and education. In Prolog: The Next 50 Years (pp. 287-299). Cham: Springer Nature Switzerland.</ref>
* ModeLang<ref>{{cite journal|last1=Wasik|first1=Szymon|last2=Prejzendanc|first2=Tomasz|last3=Blazewicz|first3=Jacek|title=ModeLang: A New Approach for Experts-Friendly Viral Infections Modeling|journal=Computational and Mathematical Methods in Medicine|date=2013|volume=2013|page=320715|doi=10.1155/2013/320715|pmid=24454531|pmc=3878415|doi-access=free }}</ref>
⚫
* [[Newspeak]] (fictional)
* Processable English (PENG)<ref>{{cite journal|last1=Schwitter|first1=Rolf|last2=Tilbrook|first2=M|title=PENG: Processable ENGlish|journal=Technical Report, Macquarie University, Australia|date=2004}}</ref>
* [[Seaspeak]]
⚫
* [[Semantics of Business Vocabulary and Business Rules]]
* [[Special English]]
* [[Special English]]
{{div col end}}
* [[Simplified Technical Russian]]

* [[EasyEnglish]]
==Encoding==
[[IETF]] has reserved {{code|simple}} as a [[BCP 47]] [[IETF language tag|variant subtag]] for simplified versions of languages.<ref name="Everson">{{cite web |last1=Everson |first1=Michael |author1-link=Michael Everson |title=Registration form for 'simple' |url=https://www.iana.org/assignments/lang-subtags-templates/simple.txt |publisher=IANA |access-date=22 April 2021 |language=en}}</ref>


==See also==
==See also==
{{div col}}
* [[Constructed language]]
* [[Constructed language]]
* [[Knowledge representation and reasoning]]
* [[Knowledge representation and reasoning]]
Line 50: Line 43:
* [[Controlled language in machine translation]]
* [[Controlled language in machine translation]]
* [[Structured English]]
* [[Structured English]]
* [[Word-sense disambiguation]]
⚫
* [[Simple English Wikipedia]]
{{div col end}}


==References==
==References==
Line 55: Line 51:


==External links==
==External links==
* [http://sites.google.com/site/controllednaturallanguage/ Controlled Natural Languages]
*[https://sites.google.com/site/controllednaturallanguage/ Controlled Natural Languages] {{Webarchive|url=https://web.archive.org/web/20210308080234/https://sites.google.com/site/controllednaturallanguage/ |date=2021-03-08 }}
* [http://asd-ste100.net/ ASD-STE100 Simplified Technical English]


{{DEFAULTSORT:Controlled Natural Language}}
{{DEFAULTSORT:Controlled Natural Language}}
[[Category:Controlled natural languages| ]]
[[Category:Controlled natural languages| ]]
[[Category:Natural language processing]]
[[Category:Natural language processing]]

[[be-x-old:Кантраляваная мова]]
[[de:Kontrollierte Sprache]]
[[es:Lengua controlada]]
[[eo:Reguligita lingvo]]
[[fr:Langue contrôlée]]
[[it:Linguaggio controllato]]
[[ru:Контролируемый язык]]
[[simple:Controlled language]]
[[sv:Kontrollerat språk]]

Latest revision as of 03:21, 31 July 2024

Controlled natural languages (CNLs) are subsets of natural languages that are obtained by restricting the grammar and vocabulary in order to reduce or eliminate ambiguity and complexity. Traditionally, controlled languages fall into two major types: those that improve readability for human readers (e.g. non-native speakers), and those that enable reliable automatic semantic analysis of the language.[1][2]

The first type of languages (often called "simplified" or "technical" languages), for example ASD Simplified Technical English, Caterpillar Technical English, IBM's Easy English, are used in the industry to increase the quality of technical documentation, and possibly simplify the semi-automatic translation of the documentation. These languages restrict the writer by general rules such as "Keep sentences short", "Avoid the use of pronouns", "Only use dictionary-approved words", and "Use only the active voice".[3]

The second type of languages have a formal syntax and formal semantics, and can be mapped to an existing formal language, such as first-order logic. Thus, those languages can be used as knowledge representation languages,[4] and writing of those languages is supported by fully automatic consistency and redundancy checks, query answering, etc.

Languages

[edit]

Existing controlled natural languages include:[5][6]

Encoding

[edit]

IETF has reserved simple as a BCP 47 variant subtag for simplified versions of languages.[13]

See also

[edit]

References

[edit]
  1. ^ "A Survey and Classification of Controlled Natural Languages". direct.mit.edu. Retrieved 2024-03-27.
  2. ^ "Controlled Natural Languages for language generation in artificial cognition". IEEE. Retrieved 2024-03-27.
  3. ^ O'Brien, Sharon (2003). "Controlling Controlled English – An Analysis of Several Controlled Language Rule Sets" (PDF). Proceedings of EAMT-CLAW. Archived from the original (PDF) on 2016-03-03. Retrieved 2011-12-30.
  4. ^ Schwitter, Rolf. "Controlled natural languages for knowledge representation." Proceedings of the 23rd International Conference on Computational Linguistics: Posters. Association for Computational Linguistics, 2010.
  5. ^ Kuhn, Tobias (2014). "A Survey and Classification of Controlled Natural Languages". Computational Linguistics. 40: 121–170. arXiv:1507.01701. doi:10.1162/COLI_a_00168. S2CID 14586568.
  6. ^ Pool, Jonathan (2006). "Can Controlled Languages Scale to the Web?". Archived from the original on 2009-08-15. {{cite journal}}: Cite journal requires |journal= (help)
  7. ^ Norbert E. Fuchs; Kaarel Kaljurand; Gerold Schneider (2006). "Attempto Controlled English Meets the Challenges of Knowledge Representation, Reasoning, Interoperability and User Interfaces" (PDF). FLAIRS 2006.
  8. ^ Ogden, Charles Kay (1930). Basic English: A General Introduction with Rules and Grammar. London: Paul Treber & Co., Ltd.
  9. ^ "Common Logic Controlled English". www.jfsowa.com. Retrieved 27 August 2017.
  10. ^ Kowalski, R., Dávila, J., Sartor, G. and Calejo, M., 2023. Logical English for law and education. In Prolog: The Next 50 Years (pp. 287-299). Cham: Springer Nature Switzerland.
  11. ^ Wasik, Szymon; Prejzendanc, Tomasz; Blazewicz, Jacek (2013). "ModeLang: A New Approach for Experts-Friendly Viral Infections Modeling". Computational and Mathematical Methods in Medicine. 2013: 320715. doi:10.1155/2013/320715. PMC 3878415. PMID 24454531.
  12. ^ Schwitter, Rolf; Tilbrook, M (2004). "PENG: Processable ENGlish". Technical Report, Macquarie University, Australia.
  13. ^ Everson, Michael. "Registration form for 'simple'". IANA. Retrieved 22 April 2021.
[edit]
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Controlled_natural_language&oldid=1237705240"