The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The main goal of this paper is to explain important terms of the word sense disambiguation (WSD) in the Slovak language. A comprehensive survey of current approaches and evaluation methodologies is provided. Special attention is given to necessary language resources and tools. The paper deals with problems specific to Slovak language: missing language resources, rich morphology, free word order and...
The classification process of the Counter Propagation neural network (CPN) is investigated. The homogeneity distribution of the codebook vectors is a key element in the accuracy of the classification process. The paper defines an appropriate homogeneity measure that is strongly correlated with the optimal misclassification error. Based on this homogeneity value, the paper proposes three modification...
Experts should analyse systems in order to define would-be faults in systems. As a result of this analysis, there will be a set of priori known faults supporting off-line teaching of neural networks. Unfortunately, it is impossible to define all faults in the design phase. As a result, a priori unknown faults may appear in systems. A priori unknown faults modify the distribution of the input patterns...
Agglutinative languages, such as Hungarian, use inflection to modify the meaning of words. Inflection is a string transformation which describe how can a word converted into its inflected form. The transformation can be described by a transformational string. The words can be classified by their transformational string, so inflection is considered as a classification. Linear separability of clusters...
Grammatical inference (GI) of context free languages (CFG) is an actively researched area of computer science. There are some algorithm, based on different approaches, to induce CFGs and we are going to test and compare the standard CFG generation methods. The goal of the comparison is to develop a more efficient CFG induction method. In order to super the testing and comparison of algorithm, a GI...
Nowadays grammar induction is an intensively investigated area and it is a NP-hard problem. TBL [1] [2] and ITBL [3] [4] algorithm provide a way to generate context-free grammar (CFG) from positive and negative sentences. However these algorithms have huge time cost. This paper suggests a prereduction method which can make these algorithm faster. The proposed method performs grammar reduction in the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.