Wyniki wyszukiwania - BazTech

1

Re-research.pl : where Humanities Meet Computer Science

Dzienisiewicz D., Borchmann Ł., Wierzchoń P., Graliński F.

Computational Methods in Science and Technology

|

2018

|

Vol. 24, No. 1

7--19

EN

The article discusses selected projects from the field of digital humanities realised by the Re-research.pl group. The group consists of researchers from the Institute of Linguistics and the Department of Natural Language Processing at Adam Mickiewicz University, Pozna´n, Poland. The projects discussed include National Photocorpus of Polish, Discovermat, Korea, Koreans and ‘Koreanity’ in the digitised Polish press of the 20th century, Biography of the Nation, 100,000 ministories, Gonito.net and 50,000 words. Domain and chronologisation index. However, the main focus of the article is the interdisciplinary popular-scientific blog Re-research.pl. The daily blog posts include texts on a variety of subjects, ranging from linguistics, history and folklore to computer science. Selected posts and categories of posts are discussed, such as chronologisational challenges, texts devoted to folklore and materials on the structure of text files. Apart from providing daily analyses, the blog promotes other projects and serves as a dialogue platform for representatives of various fields.

2

Linguistic aspects of text normalization in a polish text-to-speech system

Graliński F., Jassem K., Wagner A., Wypych M.

Systems Science

|

2006

|

Vol. 32, no 4

7-15

EN

The paper addresses linguistic problems of text normalization for the Polish language. Text normalization, which converts the written form of a text into the spoken form, is one of the preprocessing steps in text-to-speech systems. Normalization of texts in analytic languages like English does not necessarily require deep linguistic analysis. However, it is shown here that for synthetic languages, like Polish, linguistic analysis is crucial for the normalization process. Existing Polish text-to-speech systems, even though highly estimated for the naturalness of output, do not solve main normalization problems. The authors’ team aims at developing a text-to-speech system that will include a strong text normalization module. The idea is to design the module using linguistic resources and mechanisms developed for a Machine Translation system, Translatica. Progress of research may be followed at www.poleng.pl, where the user may input a source Polish text in the written form and obtain its "translation" after normalization.

3

Reinterpreting DCG for free word order languages

Vetulani Z., Graliński F.

Archives of Control Sciences

|

2005

|

Vol. 15, no. 4

691-702

EN

The DCG rules are context-free rules with non-terminal symbols allowing arbitrary terms as parameters. Because of that the DCG-like formalisms are considered particularly well suited to encode NL grammars. This observation is however only partially true for languages withfree word and possibilities of discontinuous constructions, e.g. for Slavonic and Germanic languages. What seems interesting is that a minor formal modification in The DCG formalism makes it flexible enough to cover word-order related problems. What we explore here is the idea of reinterpretation of the concept of defference list. This implies a non-standard interpretation of DCG rules, in which the ordering of the right-hand-side symbols does not necessarily correspond to the surface ordering of corresponding expressions and the non-terminals may represent discontinuous categories. In this paper we propose a solution in which both non-standard interpretations of DCG rules co-exist.

4

A simple CF formalism and free word order

Graliński F.

Archives of Control Sciences

|

2005

|

Vol. 15, no. 4

541-554

EN

The first objective of this paper is to present a simple grammatical formalism named treegenerating Binary Grammar. The formalism is weakly equivqlent to CFGs, yet it is capable of generating various kinds of syntactic trees, including dependency trees. Its strong equivalence to some other grammatical formalisms is discussed. The second objective is to show how some free word order phenomena in Polish can be captured within the proposed formalism.