Differences

This shows you the differences between two versions of the page.

--- basic_principles [2018/09/20 12:22]
andries Comparison with natural language improved
+++ basic_principles [2018/11/10 22:32] (current)
andries [6. Use of synonyms, phrases and inverse phrases]
@@ Line 1: / Line 1: @@
-====== Basic Principles of Gellish =======
+====== How to start writing Gellish =======
-This page describes a number of basic principles that are applied in Gellish English.\\
+Using Gellish can start in two ways: \\
-Gellish enabled software is not intended to become natural language interpreters, but Gellish is oriented towards databases and the export and import of data exchange messages from and to computers. Conventionally information analysts, data modelers and programmers use 'data models' to define the structure of data. Data models are usually not called 'languages' and input or output is usually not called 'expressions'. However, conventional data models define expressions structures and terminology, which together in fact define some form of dedicated languages. The formal languages of the Gellish family are a step further towards natural languages. In Gellish, information is expressed as collections of expressions with a structure that is in essence a binary relation that is expressed as a row in table. The core elements of each line in such a table can be read as a (nearly) normal natural language expression. However, those expressions do not have the free form that natural languages have.\\
+. Starting by expressing information in Gellish and \\
+. Starting by building software that can produce or read and interpret Gellish expressions. \\
+Understanding the first is required for starting the second. Therefore this section gives guidance on how to start making Gellish expressions. At the same time it describes a number of basic principles that are applied in Gellish.\\
+The easiest way to start is by copying a Gellish expression format table from an existing table. For example, by copying one of the tables that are available in the download area or from the tables available in the Gellish project on GitHub. Such a table can be extended or simplified according to the options that are described in the document 'Gellish Syntax and Contextual Facts', which is [[http://wiki.gellish.net/gellish_expression_format|summarized in this wiki]]. Another option is to copy the full Gellish expression format table definition from the Expr_Table_Def.py module source code software, written in Python on GitHub.\\
-Gellish can thus be described starting from a conventional data model and generalizing such a model towards the flexibility and capabilities of natural languages. But it can also be described starting from natural languages and adopting simplifications and constraints on the allowed expressions to a level that computer software is able to interpret the meaning of the expressions, apply logic and to act accordingly.\\
+====== 1. Expression of ideas by relations ======
-Starting from a natural language, Gellish adopted the following simplifications:
-  * Split expressions in collections of binary relations ('//basic semantic units//'), because in the target language usage (business and technical data processing) every idea can be expressed as a collection of one or more binary relations between related objects.
-  * Each binary relation shall be classified by a kind of relation that is predefined in the formal dictionary. The meaning of a kind of relation is independent of the sequence in which the related objects are arranged in the expression (at the left or at the right hand of the kind of relation). Because kinds of relations are usually denoted by a phrases in natural language, each expression has a reading direction. Because the inverse relation is equivalent, there are always two 'phrase types'': a base phrase and an inverse phrase for cases where the related objects appear in the reverse order. As a consequence, the kind of relation defines the first kind of role and the second kind of role, but allows for base phrases as well as inverse phrases for expressing an idea. (N.B. The phrase type UID represents this order in a language independent way).
-  * Thus the core of each binary relation consists of two related objects, a kind of relation, a phrase type and optionally the two roles or kinds of roles that are played by the related objects.
-  * Separate concepts from terminology. This means that each idea, relation, related object or role and each of their kinds is represented throughout the family of languages by a natural language independent unique identifier (UID), whereas multiple names, aliases and translations may denote those UIDs in various 'language communities'. This enables the unambiguous use of synonyms as well as homonyms.
-  * Make intentions of expressions explicit by separating the theme of an expression from the explicit intention with which an idea is expressed. This means that grammatical variations in expressions between questions, statements, confirmations, denials, etc. are largely eliminated, while maintaining the variety of expressions. This supports computer dialogues instead of the common limitation to statements and facts (this follows from the 'Speech act theory' of John Searl).
-  * Replace past and future tenses by a uniform expression accompanied by explicit expression of time indications where necessary. These largely reduce that grammatical variety of expressions about was has been the case and what may become the case.
-  * Use only concepts that are selected from the taxonomic dictionary of the formal language, or add them and/or their aliases according to the rules for extension of the dictionary.
-  * Replace plural names, through using singular terms where possible in combination with explicit cardinalities and numbers of items in collections. This eliminates nearly all plural terms from the dictionary of the formal language.
-  * Add explicit contextual information to each basic semantic unit. This eliminates the problem of context dependence of interpretations.
-====== 1. Expression of facts by relations ======
+A core principle of the Gellish language is the observation that any idea can be expressed as a collection of one or more binary relations, being relations between two objects. This is the ORO principle: the Object-Relation_type-Object principle (where 'Object' is interpreted in its widest sense). That principle is supported by the observation that simple as well as complex ideas can be expressed as collections of binary relations, while taking into account that complex ideas are objects in their own right. For example, activities and processes are 'objects' that are interactions between multiple objects, whereas those interactions can be modeled by a collection of binary involvement relations, each of which expresses the role that an object plays, or the way in which it is involved, in the activity or process. \\
+Thus expressing information in Gellish begins with chopping the information in binary relations, each relating two objects, and selecting the appropriate kind of relation.\\
+Examples are:\\
+^ //Name of left hand object//^ //Name of the kind of relation//^ //Name of right hand object//^
+|House-1 |has as part| Kitchen-1|\\
+|The Eiffel tower |is located in| Paris|\\
+|Paris |is classified as a| city|\\
-A core principle of the Gellish language is the observation that any idea can be expressed as a collection of one or more binary relations, being relations between two objects. This is the ORO principle: the Object-Relation_type-Object principle (where 'Object' is interpreted in its widest sense). That principle is supported by the observation that complex ideas can be expressed as collections of binary relations, while adopting that a complex idea is an object in its own right. For example, activities and processes are 'objects' that are interactions between multiple objects, whereas they can be modeled by a collection of binary involvement relations, each of which expresses the way in which an object is involved in the activity or process. \\
+Searching for the proper kinds of relations in the various expressions implies searching the [[:Gellish English Dictionary|Gellish Dictionary]] for kinds of relations and their subtypes and the phrases by which they are denoted. Therefore it is advisable that users shall have access to a tool that enables searching the Dictionary. There are a large number of standard kinds of relations defined in the Gellish language. Those kinds of relations form the basic grammar of Gellish and the fact that they are standardized make that software can build on their meaning. This makes the language computer interpretable and system independent and it enables making the software reusable.
-Furthermore, it is recognized that in a binary relation each of the related objects plays a particular role of a particular kind. Therefore, an extended expression of a fact in Gellish includes those (kinds of) roles and thus becomes: Object-First_role-Relation_type-Second_role-Object. For example, the fact that ‘the Eiffel tower is located in Paris’ is expressed as relation between the Eiffel tower and Paris, which relation is classified by the standard Gellish relation type called <is located in>. Furthermore, the Eiffel tower plays the role of //located// and Paris plays the role of //location// in that relation.\\
+The number of kinds of relations and other concepts is not limited to the current dictionary, because the [[:Gellish Modeling Methodology]] includes a specification of how the dictionary can be extended with additional concepts and relation types. For example, if the Eiffel tower or Paris or an appropriate relation type would not yet exist in the Gellish English Dictionary, then they can be added in a Domain Dictionary or as proprietary extensions. All the Gellish expressions can be stored and exchanged using the standard [[:Gellish Databases|Gellish Expression]] format.
-There are a large number of such standard kinds of relations (or 'relation types') defined in the Gellish language. Those kinds of relations form the basic grammar of Gellish and the fact that they are standardized make that software can build on their meaning, which makes the language computer interpretable and system independent. The standard relation types are defined in the [[:Gellish English Dictionary]], together with the other dictionary concepts and terms. The number of kinds of relations and other concepts is not limited to the current dictionary, because the [[:Gellish Modeling Methodology]] includes a specification of how the dictionary can be extended with additional concepts and relation types. For example, if the Eiffel tower or Paris or an appropriate relation type would not yet exist in the Gellish English Dictionary, then they can be added in a Domain Dictionary or as proprietary extensions. All the Gellish expressions can be stored and exchanged using the standard [[:Gellish Databases|Gellish Expression]] format.
-The principle that each idea can be expressed as a collection of binary relations is shared with e.g. the NIAM and the Object Role Modeling (ORM) methods. A difference between NIAM, ORM and Gellish is that Gellish classifies the relation and distinguishes the relation from the two roles of the related objects, whereas ORM only recognizes the two roles and does not recognize the relation as a separate object. Furthermore, a more important difference is that neither NIAM nor ORM define standard kinds of roles (or kinds of relations).
+Furthermore, it is recognized that in a binary relation each of the related objects plays a particular role of a particular kind. Therefore, an extended expression of a fact in Gellish includes those (kinds of) roles and thus becomes: Object-First_role-Relation_type-Second_role-Object. For example, the fact that ‘the Eiffel tower is located in Paris’ is expressed as relation between the Eiffel tower and Paris, which relation is classified by the standard Gellish relation type called <is located in>. Furthermore, the Eiffel tower plays the role of //located// and Paris plays the role of //location// in that relation.\\
+The principle that each idea can be expressed as a collection of binary relations is shared with e.g. the NIAM and the Object Role Modeling (ORM) methods. A difference between NIAM, ORM and Gellish is that Gellish classifies the relation and distinguishes the relation from the two roles of the related objects, whereas ORM only recognizes the two roles and does recognize the relation as a separate object only when it is 'objectified'. Furthermore, a more important difference is that neither NIAM nor ORM define standard kinds of roles nor kinds of relations not standard kinds of things. Thus they do not include a dictionary and do not define a user language.
 ====== 2. Use of a standard dictionary ======
-Conventional methods for data modeling leave it in the freedom of developers to create their own entity types, attribute types or object types and relation types and to allocate their own names to them. Developers usually put more constraints on the (names of) allowed values that may be entered as 'instances' when the data models are populated by data entry in the systems. However, those allowed values are usually not coordinated across multiple systems, so that also the content does not comply with some standard formalized language.\\
+Conventional methods for data modeling leave it in the freedom of developers to create their own entity types, attribute types or object types and relation types and to allocate their own names to them. Developers usually put constraints on the (names of) allowed values that may be entered as 'instances' when the data models are populated by data entry in the systems. However, those allowed values are usually not coordinated across multiple systems, so that their content does not comply with some standardized and formalized language.\\
 This implies that those methods in fact encourage everybody to create his or her own language (dictionary as well as grammar). This is the root cause of the difficulties with exchanging data between systems and with integrating data that originate from different databases. \\
-To address this issue, a basic principle of Gellish is that all Gellish users shall in principle select their concepts from the predefined Gellish English Dictionary and also use the predefined names, or specify their aliases explicitly. This common use of the same concept definitions, together with a proper management of unique identifiers, enable that collections of Gellish expressions from different sources can be integrated without conversion and enables that data that originate from one system can be generated or interpreted by any other system that is Gellish enabled. \\
-Furthermore, in addition to the common use of the same dictionary, every user can create his own individual objects (conventionally referred to as 'instances') and whenever concepts that are needed by user are missing in the Gellish English Dictionary it is recommended to create proprietary subtype kinds of objects or relation types . Users are also recommended to propose definitions of new concepts as extensions of the formal Gellish English Dictionary, so that more concepts definitions become shared between Gellish users.
+This means that knowledge, requirements or definitions of kinds of things shall be expressed as relations between concepts that are already present in the taxonomic dictionary or those concepts shall be added by defining them as subtypes of existing concepts.\\
+For example, assume that the concept 'capital' is required and is not yet included in the dictionary. Then the concept is defined by a specialization relation (denoted by the phrase 'is a kind of'), followed by a textual definition as follows:\\
+^ //Name of left hand object//^ //Name of the kind of relation//^ //Name of right hand object//^ //Partial textual definition//^
+|capital |is a kind of| role |of a city when it ...|
+|capital |is by definition a role of a| city| |\\
+This common use of the same concept definitions and vocabulary, together with a proper management of unique identifiers (which is discussed later), enable that collections of Gellish expressions from different sources can be integrated without conversion. It also enables that data that originate from one system can be generated or interpreted by any other system that is Gellish enabled. \\
+Furthermore, in addition to the common use of the same dictionary, every user can create his own individual objects (conventionally referred to as 'instances') and whenever concepts that are needed by user are missing in the Gellish Dictionary it is recommended to create proprietary subtype kinds of objects or kinds of relations. Users are also recommended to give feedback by proposing definitions of new concepts as extensions of the formal Gellish Dictionary, so that more concepts definitions become shared between Gellish users.
 Thus Gellish English is not just a modeling method, like e.g. NIAM, ORM, ER and other methods, but it is a complete formal language, including a normal, although enhanced, electronic English (taxonomic) dictionary.
@@ Line 35: / Line 41: @@
 ====== 3. Explicit classification of individual things (instances) ======
-Another core concept of Gellish is that every //individual// thing (or instance) that is used in Gellish expressions needs to be classified by an explicit classification relation with an existing concept (class) in the Gellish English Dictionary or by a concept that is defined as a proprietary extension of that dictionary. If it is required for such a classification to define a proprietary extension of the Gellish English dictionary, then such a new //concept// should be added according to the rules for a [[:Proper definition of a concept|proper definition]], which includes defining the concept as a subtype of an existing supertype concept.
+Another core concept of Gellish is that every //individual// thing (or instance) that is used in Gellish expressions needs to be classified by an explicit classification relation with an existing concept (kind of thing or class) in the Gellish Dictionary or by a concept that is defined as a proprietary extension of that dictionary. If it is required for such a classification to define a proprietary extension of the Gellish dictionary, then such a new //concept// should be added according to the rules for a [[:Proper definition of a concept|proper definition]], which includes defining the concept as a subtype of an existing supertype concept (as is described above).
-This concept for Gellish Databases is different from conventional databases. In conventional databases every instance is implicitly classified by the definition of the attribute type (the definition of a database table column) of which it is an instance. Thus, the kinds of instances that can be stored in a conventional database is limited by the (fixed) number of entity types and attribute types or object types that are defined in its data model. In Gellish English the explicit classification implies that anything can be stored in a Gellish Database, because every concept in the Gellish English dictionary can be used to classify an instance and missing concepts can be added without modifying the database. This means that Gellish English is equivalent to an unlimited large data model.
+This concept for Gellish expressions differs from the requirements in conventional databases. In conventional databases every instance is implicitly classified by the definition of the attribute type (the definition of a database table column) of which it is an instance. Thus, the kinds of instances that can be stored in a conventional database is limited by the (fixed) number of entity types and attribute types or object types that are defined in its data model. In Gellish the explicit classification implies that anything can be stored in a Gellish Database, because every concept in the Gellish dictionary can be used to classify an instance, whereas missing concepts can be added without modifying the database. This means that Gellish is equivalent to an unlimited large data model.
 ====== 4. Standard data structure: the Gellish Expression format ======
-The structure of Gellish expressions (its syntax) is intended to enable the expression of ideas of any kind. The development process of various ISO standards has revealed that there appears to be a generic structure that is suitable for expressing any kind of idea. Thus, every expression has basically the same generic structure, although there are a large number of optional elements. Furthermore, it appears to be possible to model that structure in a single table. As a result, the Gellish Expression format consists of only one precisely defined table. The core of the structure is illustrated by the examples in Table 1.
+The structure of Gellish expressions (its syntax) is intended to enable the expression of ideas of any kind. It was discovered that it is possible to express ideas as collections of binary relations, whereas such relations follows always a basic semantic pattern. As a consequence there appears to be a generic structure that is suitable for expressing ideas of any kind. This means that every expression has basically the same generic structure, although there are a large number of optional elements within that structure. Furthermore, it appears to be possible to model that structure in a single table with a number of optional columns. As a result, the Gellish Expression format consists of only one precisely defined table. The core of the structure of that table is illustrated by the examples in Table 1.
 ^ //Name of left hand object//^ //Name of the kind of relation//^ //Role of the right hand object//^ //Name of right hand object//^ //Unit of measure//^
@@ Line 54: / Line 60: @@
-Table 1, The [[:Gellish Databases|Gellish Expression]] format with example expressions of ideas
+Table 1, Core of the Gellish Expression format with example expressions of ideas
-Each line in Table 1 is the expression of a single idea by a binary relation or a combination of binary relations. By default the expressions are interpreted as statements. Each related object plays a particular role or kind of role in a relation of the specified kind. That role or kind of role is determined by the definition of the kind of relation and may be further defined by the related objects. In most cases the roles and kinds of roles remain implicit. For example, in Table 1, the Eiffel tower and Paris are objects that play different roles in the relations of the various kinds. \\
+Each line in Table 1 is the expression of a single idea by a binary relation or a combination of binary relations. By default the expressions are interpreted as assertions (statements). Each related object plays a particular role or kind of role in a relation of the specified kind. That role or kind of role is determined by the definition of the kind of relation and may be further defined by the related objects. In most cases the roles and kinds of roles can remain implicit. For example, in Table 1, the Eiffel tower and Paris are objects that play different roles in the relations of the various kinds. \\
-For example the Eiffel tower and Paris play respectively the (implicit) roles 'located' and 'location' in the third relation. That relation is classified by a kind that is denoted by the phrase ‘is located in’. The Gellish language contains proper definitions of standard relation types, such as 'is located in'. Those definitions of kinds of relations include the proper definition of those kinds of roles as well as what kind of things may play roles of such kinds. These definitions enable software to some extent to execute semantic verification of the semantic correctness of the expressions.\\
+For example the Eiffel tower and Paris play respectively the (implicit) roles 'located' and 'location' in the third relation. That relation is classified by a kind that is denoted by the phrase ‘is located in’. The Gellish language contains proper definitions of standard kinds of relations, such as 'is located in'. Those definitions of kinds of relations include the proper definition of those kinds of roles as well as what kind of things may play roles of such kinds. These definitions enable software to some extent to execute semantic verification of the semantic correctness of the expressions.\\
 The lines that classify ‘Eiffel tower’ as a ‘tower’ and ‘Paris’ as a ‘city’, are examples of classification relations, which relate individual things to known concepts (kinds of things) in the Gellish dictionary. Those classification relations add those individual things as new concepts to the dictionary.\\
@@ Line 63: / Line 69: @@
 The line that specifies that the Eiffel tower <has as aspect a> height, called 'the height of the Eiffel tower' shows the use of an additional column in the table to introduce the intrinsic aspect. It should be noted that this statement can be expressed without the need to also have the statement on the fourth line that states that a tower can have a height (meaning that it can have a value for a height in an information model; in reality it has by definition some height). The language definition does not put any constraints on which object can have which kind of aspect. \\
-On the last line the (intrinsic) aspect is is quantified on a scale by an approximate value, whereas the relation is classified not only as an approximate equality of a scale, but is also classified by the quantification method, being the meter scale.\\
+On the last line the (intrinsic) aspect is quantified on a scale by an approximate value, whereas the relation is classified not only as an approximate equality on a scale, but the relation is also classified by the quantification method, being the quantification on a meter scale.\\
-Note that the usage of separate lines for quantification of aspects enables to allocate different values for different moments in time, and in different units or different measurement accuracies or various kinds of relations, such as equality, greater than, less than, etc.
+Note that the usage of separate lines for quantification of aspects enables to allocate different values for different moments in time, and in different units or different measurement accuracies or by constraining the quantification by various kinds of relations, such as greater than, less than, greater than or equal, etc.
-The Gellish expression format defines a number of other contextual binary relations that can be represented in additional column on the same line in the standard table. For example about the author, date of creation etc. The whole format is defined in the document [[http://gellish.net/index.php/downloads/file/1-formal-english-syntax-and-contextual-facts.html|The Gellish Syntax and Contextual Facts]]. The definition of the syntax/format allows for the usage of user defined subsets of binary relations and thus of subsets of columns in expression format tables. It also does not prescribe a particular encoding, although Unicode (utf-8) and CSV or JSON are recommended.\\
+The Gellish expression format defines UIDs for the above names of concepts and defines a number of other contextual binary relations that can be represented in additional column on the same line in the standard table. For example about the author, date of creation, etc. See for more details [[gellish_expression_format|the appropriate page in this wiki]]. The format is defined in the document [[http://www.gellish.net/downloads/gellish-syntax-and-contextual-facts-definition-of-universal-semantic-databases-and-data-exchange-messages.html|The Gellish Syntax and Contextual Facts]]. The definition of the syntax/format allows for the usage of user defined subsets of binary relations and thus of subsets of columns in expression format tables. It also does not prescribe a particular encoding, although Unicode (utf-8) and CSV or JSON are recommended.\\
 Note that Gellish does not prescribe the use of the Gellish Expression format. The separate binary relations that are combine on one line in such a table can also be expressed in other formats, such as RDF or XML.
 ====== 5. Use of standardized kinds of relations ======
-The various kinds of relationships are standardized in the Gellish Dictionary and the kinds of relations are the core elements that determine the expression power of the formal language. Expression in Gellish are only correct Gellish expressions if the use kinds of relations that are selected from the Gellish Taxonomic Dictionary. The kinds of relations form a specialization hierarchy (subtype-supertype hierarchy) of kinds of relations to ensure consistency of the language. That hierarchy enables that software can also search for expressions that use more specialized subtypes of kinds of relations. For example, software can automatically search for things that are connected to each other by any kind of connection, but it can also search for welded connections only. The kinds of relations are further defined in the dictionary (ontology) by the kinds of roles that they require. Those roles are also explicitly defined and arranged in a specialization hierarchy that is compliant with the hierarchy of the kinds of relations. Finally it is defined which kind of objects can play roles of those kinds, whereas those role players are also defined and arranged in a specialization hierarchy. Together these definitions and hierarchies enable Gellish powered software to verify the correctness of Gellish expressions and the consistency of the use of the language and it enables the application of logic reasoning during the search to answer questions and queries. \\
+The various kinds of relationships are standardized in the Gellish Dictionary and the kinds of relations are the core elements that determine the expression power of the formal language. Expression in Gellish are only correct Gellish expressions if they use kinds of relations that are selected from the Gellish Taxonomic Dictionary. The kinds of relations form a specialization hierarchy (subtype-supertype hierarchy) of kinds of relations to ensure consistency of the language. That hierarchy enables that software can also search for expressions that use more specialized subtypes of kinds of relations for expressing meanings more precisely. For example, software can automatically search for things that are connected to each other by any kind of connection, but it can also search for welded connections only. The kinds of relations are defined further in the dictionary (ontology) by the specification of the kinds of roles that they require. Those roles are also explicitly defined and arranged in a specialization hierarchy that is compliant with the hierarchy of the kinds of relations. Finally it is defined which kind of objects can play roles of those kinds, whereas those role players are also defined and arranged in a specialization hierarchy. Together these definitions and hierarchies enable Gellish powered software to verify the use of kinds of relations in Gellish expressions is consistent with the definition of the formal language and it enables the application of logic reasoning during the search to answer questions and queries. \\
 Some examples of important binary kinds of relations with rather trivial kinds of roles are:
   * A composition relationship, with the roles ‘part’ and ‘whole’.
@@ Line 108: / Line 114: @@
 ====== 6. Use of synonyms, phrases and inverse phrases ======
-Gellish enables the definition of synonyms, abbreviations, codes, etc. for names of concepts as well as for names of kinds of relationships. Each term and each alias is defined to belong to the vocabulary of either 'international', being the international community, or to a natural language and within that to a 'language community' such as a discipline, a standard or an organization. Standard synonyms are defined in the Gellish Dictionary, but users can define their own terminology as alias that is specific for and the preferred term for their organization. This means that their organization is specified as the language community where the term has its base. The same holds for kinds of relations, which are denoted by natural language ‘phrases’, such as the phrases in the column 'name of kind of relation' in Table 3. \\
+The Gellish dictionary contains terms as well as synonyms, abbreviations, codes, etc. for names of concepts as well as for names of kinds of relationships. Each term and each alias is defined to belong to the vocabulary of a natural language and within that to a **language community** such as a discipline, a standard or a particular organization. A special 'language' is called 'international', being reserved for terms that are used internationally, such as units of measure, chemical formulas, codes, etc. Users can define their own terminology as aliases that are preferred terms for their organization. In the latter case the organization should be specified as the 'language community' where the term has its base. \\
-The way in which synonym phrases are defined for the relation types in the Gellish English dictionary is illustrated on row 5 in Table 3. Gellish English has also defined inverse Gellish phrases that imply that the left hand and the right hand related objects are inversed. Row 6 of Table 3 shows an example.\\
+Kinds of relations have names, but are usually denoted by natural language **phrases**, such as the phrases in the column 'name of kind of relation' in Table 3. Note that the phrases have a particular reading direction, which means that the left hand and the right hand object have different roles in the relation. In order to make expressions in which the left and right hand objects are switched, Gellish also defined **inverse phrases**. Whether a phrase or an inverse phrase is used (with switched related objects) has no impact on the meaning of an expression. Phrases and inverse phrases are aliases for the names of kinds of relations
-Translations can be defined in the same way as aliases, but for the definition of bulk translations, the Gellish Expression format allows for additional columns with special IDs that are reserved for terms in a specified language.
+The way in which the synonym phrases are defined for the relation types in the Gellish dictionary is illustrated on row 5 in Table 3. Row 6 of Table 3 shows an example of the definition of an inverse phrase for denoting the kind of relation with the name assembly relation.\\
+Translations can be defined in the same way as aliases, but for the definition of bulk translations, the Gellish Expression format allows for additional columns that are dedicated for terms in a particular language. Such columns have column IDs that are the UIDs of those languages.

Gellish Wiki

User Tools

Site Tools

Differences

Page Tools