Rules for names of concepts New concepts, also called kinds, that need to be added to the Gellish language and therefor are added to the Gellish Dictionary shall have a unique identifier (UID) that represents the concept ‘an sich’ throughout the language and one or more names, including synonyms, aliases, abbreviations and codes or translations by which the concept can be denoted, either in English or in other languages. Those names shall satisfy the rules below. 1. Uniqueness context Names, . . .
Archives: Wiki Pages
A wiki custom post type
Gellish Nederlands (in Dutch)
Gellish Nederlands (in Dutch) Gellish Nederlands is een variant van Gellish die gebruik maakt van dezelfde soorten relaties als Gellish Engels (Gellish English), dat wil zeggen de soorten relaties hebben dezelfde unieke identicatienummers (UIDs), maar van die soorten relaties worden nu de Nederlandse ‘namen’ en ‘frasen’ gebruikt. Bijvoorbeeld, relatietype 1190 heet in het Engels <is a part of> en diezelfde soort relatie heet in het Nederlands <is een deel van>. Dus in Gellish Nederlands kun je bijvoorbeeld het volgend feit . . .
Change management
Change Management 1. Unchangeable idea identifiers Gellish supports the management of change process on the lowest level of expressions of ideas by binary relations. Each idea is represented by a unique idea identifier (UID). An idea is only known in a Gellish environment when its idea UID is allocated. If there is no idea UID then we cannot say anything about it. A UID may not change and there may not be two different UIDs that represent the same idea. . . .
Automated translation
Automated Translation 1. Language independent UIDs Each thing/object is represented throughout the Gellish language by its own unique identifier (UID), which is a natural language independent string of characters. Each UID is related to at least one language dependent term (name) or phrase to enable human interpretation in the natural language and language community that is applicable. So, any object has only one UID, but it may have many ‘names’, being the terms, codes and synonyms or phrases by which . . .
Verification of requirements
Verification of requirents When specifications of requirements are expressed in Gellish and also design data about imaginary objects or measured data about observed real objects are expressed in Gellish then it becomes possible that software verifies whether design data or data about fabricated real objects satisfy those requirements. In other words, when requirements are expressed according to the Gellish Modeling Method and delivered information that intents to satisfy those requirements is delivered according to the Gellish Modeling Method as well, . . .
Gellish as a query language
Gellish as a query language 1. Queries, questions and dialogues Queries for conventional databases are usually expressed in a special query language, such as SQL. Gellish does not require a special query language, because queries are expressed in Gellish in the same way as ordinary statements are expressed. In natural languages there is no big difference between the structure of a sentence that expresses a question and a sentence that expresses a statement. That same principle is applied in Gellish. . . .
Distributed Gellish
Gellish Messages Exchange of data between computer systems can be done basically in two ways: Without meta data embedded in the message. With meta data embedded in the message. A Gellish Message without embedded meta data means that the message (or file) only consists of one or more Gellish expressions tables, whereas the information about the intention of sending the file is not part of the file itself or it should be interpreted from the Gellish content. In that case . . .
Dictionary development and Domain dictionaries
1. Dictionary Development and Domain Dictionaries The general purpose Gellish Taxonomic Dictionary will never be complete. When it does not contain concepts and definitions that are required in a particular application domain it should be extended. Or when an organization wants to use its own terminology, the dictionary needs to be extended as well. And when individual things are introduced as part of user data, then those individual concepts are also added to the dictionary. The Gellish language is therefore . . .
Universal semantic databases
1. Universal Semantic Databases Gellish English is a universally applicable language that covers any application domain or Universe of Discourse (UoD). The standardized structure or syntax of Gellish expressions is also universally applicable and system independent, thus allowing for the expression of ideas about any subject area. This implies that Gellish enabled databases or data exchange messages (interfaces) are in principle not constrained to a specific application domain and thus such databases do not require the development of dedicated data . . .
Gellish Syntax – Expression format
The Gellish Syntax – The Expression Format The Gellish Expression Format is a tabular format. It can be expressed as a Gellish file in various basic formats, such as CSV and JSON, using the UTF-8 encoding standard. It can also be created in spreadsheet formats, such as XLSX and then exported in CSV format. A Gellish file shall start with a file header line. The first field in that line shall contain the word ‘Gellish’. The following fields can contain . . .
The Communicator reference application
The Communicator reference application A project on GitHub (www.github.com/AndriesSHP/Gellish and https://github.com/AndriesSHP/Communicator-Web_version-) provides the source code of the Gellish Communicator reference application software. It demonstrates how Gellish expressions can be read, searched, interpreted, presented as well as generated. It also demonstrates capabilities of the language, provides testing of correctness of expressions and can be used as a basis for retrieval of source code. It also provides examples of information models that can be read by the software and searched through. 1. . . .
Gellish enabled software
Gellish enabled software Gellish enabled software implies software that can read and interpret as well as write Gellish expressions. Such expressions shall comply with the Gellish Syntax that is defined in the Gellish Syntax document, which specifies the flexible tabular Gellish expression format. Gellish enabled software may also include the development of mapping tables to convert non-Gellish data into and from Gellish expressions. This article describes basic characteristics of such software. It is assumed that readers are already familiar with . . .
Verification of expressions
Verification of Expressions Rules for correct Gellish Correct Gellish expressions satisfy a number of rules. A few very important ones are described below. Others are implemented in the Gellish Communicator software reference application that is available on GitHub. Rule 1: Ideas shall be expressed as binary relations between things Ideas, such as assertions, queries, etc. shall be expressed in Gellish as one or more binary relations, each of which shall relate two things, thus forming a Gellish expression that represent . . .
Product type modeling / product catalogues
Table of Contents of this page Modeling of product types What are product types Modeling of product types Determine the values Create definitions Quantification by numbers on scales (units of measure) 1. What are product types A product type is a kind of product that is manufacturer specific or is described in a product standard. Typically product types specify some of the values for characteristics whereas they leave degrees of freedom for values of other characteristics, possibly specified for more . . .
Knowledge Modeling
Knowledge Modeling is the modeling of possibilities and options for kinds of things. Such kinds of things can be kinds of physical objects, but also kinds of processes, activities and events. Possibilities for kinds should be regarded as suggestions or reminders for options e.g. to chose from during a design process. Possibilities for kinds are expressed in Gellish by relations that are denoted by phrases that start with ‘can be …’ or ‘can have …’. Such kinds of relations do . . .