Vladislav Kubon

A Prototype of a Grammar Checker for Czech

This paper describes the implementation of a prototype of a grammar based grammar checker for Czech and the basic ideas behind this implementation. The demo is implemented as an independent program cooperating with Microsoft Word. The grammar checker uses specialized grammar formalism which generally enables to check errors in languages with a very high degree of word order freedom.

A Comparison of MT Methods for Closely Related Languages: a Case Study on Czech - Slovak Language Pair

This paper describes an experiment comparing results of machine translation between two closely related languages, Czech and Slovak. The comparison is performed by means of two MT systems, one representing rule-based approach, the other one representing statistical approach to the task. Both sets of results are manually evaluated by native speakers of the target language. The results are discussed both from the linguistic and quantitative points of view.

On formalization of word order properties

This paper contains an attempt to formalize the degree of word order freedom for natural languages. It exploits the mechanism of the analysis by reduction and defines a measure based on a number of shifts performed in the course of the analysis. This measure helps to understand the difference between the word order complexity (how difficult it is to parse sentences with more complex word order) and word order freedom in Czech (to which extent it is possible to change the word order without causing a change of individual word forms, their morphological characteristics and/or their surface dependency relations). We exemplify this distinction on a pilot study on Czech sentences with clitics.

Parsing of Free-Word-Order Languages

This paper introduces a new type of grammars, suitable for parsing of free-word-order (natural) languages. It shows CYK-like algorithms based on such grammars for parsing and introduces a natural restriction on it, to achieve an essential speed-up, and a more adequad parsing for natural languages.