Arithmetic networks consist of neural, Boolean and fuzzy ones. Supposing the acyclic structure, decomposition of arithmetic network is possible. There are three results of our analysis: node unification, edge unification and network decomposition. We obtain only 14 node types and 4 edge types for realization of a wide class of traditional arithmetic networks from literature. The main result of our work is the splitting of the competitive neurons (nodes) to distance and soft extreme nodes. The side result of analysis is using the group of nodes instead of layer. It enables grouping the nodes of the same type but with the possibility of long interconnections. The main aiin of our work was to realize the system of arithmetic networks in the SQL language on any SQL server. The database realization enables not only saving, watching and editing the network structures and parameters but also studying the response of archived networks. The learning process was not included because of being iterative in general and unrealizable without loops on database server at that time.
ForFun is a database of linguistic forms and their syntactic functions built with the use of the multi-layer annotated corpora of Czech, the Prague Dependency Treebanks. The purpose of the Prague Database of Forms and Functions (ForFun) is to help the linguists to study the form-function relation, which we assume to be one of the principal tasks of both theoretical linguistics and natural language processing.
A prototypical question to be asked is "What purposes does a preposition 'po' serve for" or "What are the linguistic means in the sentence that can express the meaning 'a destination of an action'?". There are almost 1500 distinct forms (besides the 'po' preposition) and 65 distinct functions (besides the 'destination').
Source code of the first full and running version for the Malach Center User Interface, does not contain data or metadata fo the digital objects and resources.