Preprints of the Keldysh Institute of Applied Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Keldysh Institute preprints:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Preprints of the Keldysh Institute of Applied Mathematics, 2017, 031, 25 pp.
DOI: https://doi.org/10.20948/prepr-2017-31 (Mi ipmp2247) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Ontological graph structure analysis for dictionary

Yu. N. Orlov, Yu. A. Parfenova
Full-text PDF (928 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.20948/prepr-2017-31
Abstract: The paper describes the algorithm and structure of the program for construction of large ontologies, for example, Russian dictionary. The concepts of specificity of oriented graphs with a large number of loops, vertices and edges are introduced. The vertex hierarchy, word basin, basin shell and basin volume are determined. The statistical properties of ontological graph are investigated.
Keywords: ontological graph, cycle statistics, vertex hierarchy, word basin, basin basis.
Funding agency Grant number
Russian Science Foundation 14-21-00025
Document Type: Preprint
Language: Russian
Citation: Yu. N. Orlov, Yu. A. Parfenova, “Ontological graph structure analysis for dictionary”, Keldysh Institute preprints, 2017, 031, 25 pp.
Citation in format AMSBIB
\Bibitem{OrlPar17}
\by Yu.~N.~Orlov, Yu.~A.~Parfenova
\paper Ontological graph structure analysis for dictionary
\jour Keldysh Institute preprints
\yr 2017
\papernumber 031
\totalpages 25
\mathnet{http://mi.mathnet.ru/ipmp2247}
\crossref{https://doi.org/10.20948/prepr-2017-31}
Linking options:
  • https://www.mathnet.ru/eng/ipmp2247
  • https://www.mathnet.ru/eng/ipmp/y2017/p31
    • This publication is cited in the following 2 articles:
    1. A. P. Eremeev, E. R. Muntyan, “Development of an ontology based on graphs with multiple edges of different types”, 49, no. 6, 2022, 427–438  mathnet  mathnet  crossref  crossref
    2. A. A. Kislitsyn, Yu. N. Orlov, “Struktura semanticheskikh svyazei slov russkogo tolkovogo slovarya”, Preprinty IPM im. M. V. Keldysha, 2018, 252, 28 pp.  mathnet  crossref  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Препринты Института прикладной математики им. М. В. Келдыша РАН
    Statistics & downloads:
    Abstract page:165
    Full-text PDF :132
    References:30
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025