Definitions

Controlled vocabulary of concepts (FCSS)

First, some initial conventions, notations and definitions are introduced. The conventions for the naming of ontological Knowledge Entities and for the Graph Visualization are based on [Bens2014]. A Data Property (DP) is semantically synonym to an attribute and an Object Property (OP) is synonym to a relationship type. To avoid extra quoting of characters in words with blanks the underscore character _ is used to mark the place of the blank: ‘air pressure’ = air_pressure and (gauge, air pressure) ≡ (gauge, air_pressure). A Name of Pair (NoP) for a concept pair (x, y) can be easily synthesized by concatenation: NoP (x, y) = x_y ≡ ‘x y’, e.g., NoP(gauge, air pressure) = gauge_air_pressure  ≡ ‘gauge air pressure’. Names of DPs are prefixed with a dot, e.g., .Name, .URI. Names of OPs are prefixed with the symbol ◊, e.g., ◊iof, ◊Def, ◊Gen, ◊Dif, ◊subClassOf, ◊Subject, ◊Relation and ◊Object. Be ‘char’ a single character, then the set of all literals is defined by L = {char}*. A Basic Linguistic Symbol (BLS) ∈ BLS represents a prime or compound concept and contains literals for the different languages represented by the set LNG = {.EN, .DE, .FR, .ES, .IT, .CN, .RU, ...} of top level domain names. An ID of a bls ∈ BLS is prefixed by ‘>BLS-‘ and has the form SID(concept) = ’>BLS-concept’, e.g., SID(air_pressure) = ’>BLS-air_pressure’.

  Concept Binary Trees (CBT)
are binary trees which are composed from Semantic Primes (SP) and Semantic Compounds (SC) of the set of Basis Linguistic Symbols BLS. For CBTs we define two functions isSC() and Δz to compute the complete structure of a CBT as nested string expression. Please note that Δ as generic function can take one or two parameters as an argument. Be x, y, z ∈ BLS, »sub ∈ {»Subject, »Gen} and »obj ∈ {»Object, »Dif}. Using the pair (»Gen »Dif) for creating compounds from nouns forms a Genus-Differentiae Pattern (GDP). So, Δz = (x, y) is a GDP ⇔ ∃xyz : (z, »Gen, x) ∧(z, »Dif, y) → x, y are nouns. The function isSC(z): BLS → {T, F} assigns an element of the set of Basic Linguistic Symbols BLS the value T|TRUE|1, if it is compound, else F|FALSE|0:

{{definition:SC:isSC = is Semantic Compound:isSC(z) ← T ⇔ (∃x :(z, »subj, x) ∧ ∃y :(z, »obj, y)) or ∃x, y: (z = x_y), otherwise, isSC(z) ← F. }}

{{definition:CBT:Concept Binary Tree Expression: If isSC(z) then ∃x, y such that Δz ← (Δx, Δy), otherwise Δz ← z. }}
If the function is called with a parameter z and the concept z is a semantic prime, then z is returned as the result. Or, if z is not a semantic prime, the symbol Δ indicates a semantic compound. The function preposition ‘of’ is absorbed, for example, Δtooth_of_dog = (tooth, Δof_dog) = (tooth, Δdog) = (tooth, dog) , i.e., in general for a noun x we have Δof_x = Δx. For handling recursive definitions such as Δholonym = Δinv_meronym = (inv, meronym), Δmeronym = Δinv_holonym = (inverse, holonym) the function Δ uses a loop-detection mechanism and terminates when an argument appears a second time while rendering the tree structure. For compounds of nouns x and y where both represent semantic primes have the special condition Δ>BLS-x_y = (Δ>BLS-y, Δ>BLS-x) = (y, x) = Δy_x for example, Δ>BLS-air_pressure = (Δ>BLS-pressure, Δ>BLS-air) = (pressure, air) = Δair_pressure. If y is not a noun it holds that Δ>BLS-x_y = (Δ>BLS-x, Δ>BLS-y) = (x, y) = Δx_y. This means that in all compounds in which x and y are semantic primes but x is not a noun, the order (x, y) is retained, while in the case of noun pairs they are swapped to (y, x) to model a Genus Differentiae Pattern.

Concept Binary Trees (CBT) are not comparable to Derivation Trees that are otherwise used in Natural Language Processing (NLP). The latter are used to represent the grammatical structure of sentences and to determine the dependencies between the sentence components using LTAG Dependency Parsing. The main aspect of CBTs, on the other hand, is to represent lexical terms and phrases in such a way that semantically relevant sub-terms are arranged as high as possible in the CBT and less relevant terms as far down as possible.

Extension: deriver.app

Source: taoke.de — Definitions.