COMPUTER SCIENCE. MATHEMATICS

Informal description of the sentence recognition problem

Ya. M. Mirzabekov

Dagestan State University, 367000, Republic of Dagestan, Makhachkala, Gadzhiyev St., 43-a

Abstract: This article provides an informal definition of language and suggestions in terms of discrete mathematics and graph theory. By this definition, a set of proposals we call language is a set of rooted trees, which forms a graph. Next, we propose methods and techniques for constructing such graphs. As a result, we build a graph, called by us Tree Lang, which conditionally can be called a language.

Keywords: natural language, graphs, trees, offer, word form, the way a computer analysis.

UDC: 519.17

Received: 15.11.2016