https://elib.bsu.by:443/handle/123456789/53898 Mon, 20 Apr 2026 01:12:26 GMT 2026-04-20T01:12:26Z https://elib.bsu.by:443/handle/123456789/53904 Заглавие документа: Document clusterization based on its topic-oriented representation Авторы: Voronkov, N. Аннотация: The article addresses the problem of document clusterization. The author describes a technology for automatic topic extraction from documents and application of the topics as document representation in clusterization task. The topics are understood as noun phrase-based main themes of documents. The suggested algorithm can also be used to improve the quality of automatic multidocument text summarization. Wed, 01 Jan 2003 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/53904 2003-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/53903 Заглавие документа: Effective implementation of word-based regular expressions notation in natural language processing Авторы: Postanogov, D. Аннотация: This paper introduces a technique that allows to build deterministic finite-state automata from word-based regular expressions that are described in [1]. The automata obtained by this technique can be used in automatic analysis of natural language sentences without any loss of algorithmic deterministic automata efficiency. The paper shows the difference between traditional and word-based regular expressions and explains the need for additional transformation of word-based regular grammar in order to build deterministic finite-state automaton. Wed, 01 Jan 2003 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/53903 2003-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/53902 Заглавие документа: Hidden Markov model approach for non-sequential data in word sense disambiguation task Авторы: Olonichev, S. Аннотация: Hidden Markov Models (HMMs) have been successfully used in many fields of science and have a variety of applications. Traditionally, HMMs have been applied to sequential data. But there are tasks (a word sense disambiguation in Natural Language Processing is one of them) when observation data are not sequential. In this article we present an adaptation algorithm for an HMM usage with data represented in the form of a directed acyclic graph. Wed, 01 Jan 2003 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/53902 2003-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/53901 Заглавие документа: The word-based regular expressions in computational linguistics Авторы: Cheusov, A. V. Аннотация: In this paper we propose a unified notation for representing rules in the natural language processing (NLP) and information retrieval (IR) systems. Our notation is both flexible and compact and can be used in a wide variety of tasks. This technique was successfully used in different NLP and IR modules such as input text preformatter, sentence boundary disambiguation, set phrase extraction, constraint grammar, rule based part-of-speech tagging, case sensitive tagging, shallow parsing, transformational grammar, noun phrase normalization, uninformative noun phrase filter, word sense disambiguation, anaphora resolution and others. Wed, 01 Jan 2003 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/53901 2003-01-01T00:00:00Z