Authors: Ghilezan, Silvia 
Title: Computational approach to conjugation
First page: 33
Conference: VLP 2014 - Probabilistic Logic and Application, October 2-3, 2014, Belgrade, Serbia
Issue Date: 2014
Rank: M34
Lambek’s production grammar is a simple computational method for generating conjugational forms (inflected forms) of simple tenses step by step. The mathematical structure involved is the finitely generated partially ordered semi-group, also called “semi-Thue system” in mathematics, “rewriting system” in computer science and “production grammar” or Chomsky’s Type zero language ([1]) in linguistics. With each verb V, there is associated ap×n×mmatrix of conjugationalverb-forms, Ckij(V). The index i= 1,...n represents the (simple) tense, and the index j= 1,...,m represents the person-number and the index k= 1,...,p represents the pattern. Only simple tenses are considered here, whereas participles and compound tenses are disregarded. A production grammar, in general, provides a method for calculating Ckij(V) for a given (i,j,k,V). This method has been applied to English, French ([3]), Latin ([4]), Serbian and Croatian ([2]), Hebrew (Biblical), Turkish, Arabic, and Japanese, so far. We shall present a simple production grammar developed in [2] for generating 24 verb forms of Serbian and Croatian verb. In Serbian, as in Latin, each conjugational verb form can be regarded as one-word sentence. Hence, this production grammar is extended to sentence generation.
Publisher: Mathematical Institut of the SASA
Project: Representations of logical structures and formal languages and their application in computing 
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.