Wyniki wyszukiwania - BazTech

1

Automated Creation of Parallel Bible Corpora with Cross-Lingual Semantic Concordance

Dörpinghaus Jens, Düing Carsten

Annals of Computer Science and Information Systems

|

2021

|

Vol. 25

111--114

EN

Here we present a novel approach for automated creation of parallel New Testament corpora with cross-lingual semantic concordance based on Strong's numbers. There is a lack of available digital Biblical resources for scholars. We present two approaches to tackle the problem, a dictionary-based approach and a CRF model and a detailed evaluation on annotated and non-annotated translations. We discuss a proof-of-concept based on English and German New Testament translations. The results presented in this paper are novel and according to our knowledge unique. They present promising performance, although further research is necessary.

2

Zastosowanie binarnego kodowania kategorii gramatycznych w badaniach związanych z typologiczną klasyfikacją języków naturalnych

Gajer M.

Informatyka Teoretyczna i Stosowana

|

2007

|

R. 7, nr 11

33-53

PL

Przedstawiono propozycję zastosowania sztucznych sieci neuronowych typu Kohonena oraz techniki algorytmów ewolucyjnych w badaniach nad pochodzeniem oraz klasyfikacją języków naturalnych. Zaproponowano również zastosowanie binarnej metody kodowania zjawisk gramatycznych, którą zilustrowano obszernie na przykładzie kodowania systemów deklinacyjnych wybranych języków świata, należących do różnych rodzin językowych. Zaproponowane przez autora podejście może służyć do podjęcia próby rekonstrukcji drogi, jaką podczas swego historycznego rozwoju przebył dany język naturalny, zanim uzyskał występującą obecnie postać. Ponadto rozważane techniki obliczeniowe mogą dostarczyć dodatkowych argumentów przemawiających za zaliczeniem danego języka do tej czy innej rodziny językowej.

EN

In the paper there was proposed the application of Kohonen neural networks and evolutionary algorithms in the research on the origin and classification of natural languages. The binary coding method of grammatical catego-ries was also proposed. It was illustrated on the example of binary coding of declination systems of the selected natural languages that belong to different families of languages. The approach proposed by this author can be used in the trials or reconstruction of the path along which the given language moved during its historical development in order to achieve its contemporary form. The computational techniques described by the author tan deliver the additional arguments for classification of the given language to some family of languages.

3

On some properties of grounding simple modalities

Katarzyniak R. P.

Systems Science

|

2005

|

Vol. 31, no 3

59-86

EN

An original model of grounding simple modalities is presented and some of its properties are formally proved and discussed. The language of simple modalities is given as the set of atom formulas extended with modal operators of possibility, belief and knowledge. The artificial cognitive agent is organized into working and long term memory that correspond to conscious and non-conscious subspaces of natural cognition, respectively. The so called epistemic satisfaction relation is introduced that defines states of artificial cognition in which simple modalities can be treated as well grounded and satisfied in the epistemic sense. The idea of epistemic satisfaction is interpreted as complementary to the Tarskian and Kripke definitions for truth and its relation to the idea of semiotic triangle is discussed. The resulting correspondence between natural language behavior and artificial grounding is analyzed. In particular, desirable possibility of designing artificial cognitive agents with the ability of simultaneous grounding of particular sets of simple modalities is proved.

4

Natural languages and graphs

Skowron M.

Image Processing & Communications

|

2003

|

Vol. 9, no 3-4

27-43

EN

This paper introduces the Graphs Description Language. This language is similar to the natural one and makes it possible to communicate between a system and a user in the form of questions and answers. The Graphs Description Language can be applied to the interactive graph grammar - the grammar with a user's demands controlled derivation.