We introduce the notion of admissible transfomations which is related to the Hungarian method for solving assignment problems. Admissible transformations are stated for linear, quadratic and multi-index assignment problems. Their application to find good lower bounds and/or to solve the problem, respectively, is outlined. Finally it is shown that admissible transformations can also be applied t...

This paper presents a novel semi-automatic translation method for the Phaistos Disk that had no convincing translation for over a century. The method uses for a recently discovered connection between the Phaistos Disk symbols and other ancient scripts, including the Old Hungarian alphabet. The connection between the Phaistos Disk script and the Old Hungarian alphabet suggested the possibility t...

The paper presents an approach for the topology design of a Hungarian public ATM network on top of the Hungarian SDH network with STM-4 rings on the lower level, and STM-16 mesh on the higher level. The approach is being implemented in the XPLANET tool developed for the support of the network planning activities of the Hungarian Telecommunications Company Ltd. Based on the planning approach the...

We implement and revise Kornai’s grammar of Hungarian NPs [11] to create a parser that identifies noun phrases in Hungarian text. After making several practical amendments to our morphological annotation system of choice, we proceed to formulate rules to account for some specific phenomena of the Hungarian language not covered by the original rule system. Although the performance of the final p...

Hungarian is a stereotype of morphologically rich and non-configurational languages. Here, we introduce results on dependency parsing of Hungarian that employ a 80K, multi-domain, fully manually annotated corpus, the Szeged Dependency Treebank. We show that the results achieved by state-of-the-art data-driven parsers on Hungarian and English (which is at the other end of the configurational-non...

In this paper, we address a new type of coverage problem in mobile sensor network, named Line K-Coverage. It guarantees that any line cutting across a region of interest will be detected by at least K sensors. We aim to schedule an efficient sensor movement to satisfy the line K-coverage while minimize the total sensor movements for energy efficiency, which is named as LK-MinMovs problem. We pr...

In this paper we present a Hungarian sentiment corpus manually annotated at aspect level. Our corpus consists of Hungarian opinion texts written about different types of products. The main aim of creating the corpus was to produce an appropriate database providing possibilities for developing text mining software tools. The corpus is a unique Hungarian database: to the best of our knowledge, no...

This paper gives an overview of the design and development of an experimental restricted domain corpus-based unit selection text-tospeech (TTS) system for Hungarian. The experimental system generates weather forecasts in Hungarian. 5260 sentences were recorded creating a speech corpus containing 11 hours of continuous speech. A Hungarian speech recognizer was applied to label speech sound bound...

The aim of the paper is to offer a critical evaluation of previous LFG accounts of Hungarian DPs containing derived complex event nominals and, by combining some aspects of some of these accounts, to propose a new and more principled analysis. My main assumptions and claims are as follows. There are two possessor forms and two [-o,-r] grammatical functions in the Hungarian DP: (SUBJ) and (POSS)...

In this paper we introduce a statistical Named Entity recognizer (NER) system for the Hungarian language. We examined three methods for identifying and disambiguating proper nouns (Artificial Neural Network, Support Vector Machine, C4.5 Decision Tree), their combinations and the effects of dimensionality reduction as well. We used a segment of Szeged Corpus [7] for training and validation purpo...