Discrete analysis in parsing
Ya. M. Mirzabekov, Sh. B. Shikhiev
Dagestan State University, 43-a Gadzhiyev Str., Makhachkala 367000, Republic of Dagestan, Russian Federation
An informal definition of syntax is given in terms of discrete mathematics and graph theory. The main difficulty for numerous attempts to formalize a natural language is the semantics of the language. It is shown how it is possible to classify expressions on a semantic basis, using their syntactic features. Classification of expressions by the kind of questions they answer is the simplest way of grouping expressions on the semantic basis. The present authors describe an algorithm that recognizes place pointers, that is, expressions which answer the question “where?”. On specific examples, the problem of analysis of expressions and the inverse problem of synthesis, more precisely, the applied problem of recognition of expressions are considered.
natural language; discrete mathematics; graph theory; syntax; word forms; morphological parameters; consistent definitions; inconsistent definitions; vocabulary; semantics.
PDF file (329 kB)
Ya. M. Mirzabekov, Sh. B. Shikhiev, “Discrete analysis in parsing”, Inform. Primen., 12:2 (2018), 98–104
Citation in format AMSBIB
\by Ya.~M.~Mirzabekov, Sh.~B.~Shikhiev
\paper Discrete analysis in parsing
\jour Inform. Primen.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|