Access the full text.
Sign up today, get DeepDyve free for 14 days.
JF Sowa (1999)
Proc. Int. Conf. on Conceptual Structures (ICCS-1999)
A Dengel, F Dubiel (1995)
Proc. 3rd Int. Conf. on Document Analysis and Recognition
AA Neznanov (2005)
Candidate Sci. (Eng.) Dissertation
VA Kokhov (2002)
Kontseptual’nye i matematicheskie modeli slozhnosti grafov
AA Neznanov, VA Kokhov (2008)
Doklady mezhdunarodnoi konferentsii “Informatsionnye sredstva i tekhnologii” (MFI-2008). vol. 2
B Galitsky, SO Kuznetsov, D Usikov (2013)
Parse Thicket Representation for Multi-Sentence SearchProc. Int. Conf. on Conceptual Structures (ICCS’ 2013); Lecture Notes in Artificial Intelligence, 7735
This paper is devoted to some mathematical models of the complexity of orgraph construction in effectively processed databases. It shows the significance of the algorithms and software tools that have been developed by the author for the effective analysis of the complexity of orgraphs using information on the location of directed linked fragments. These tools are used for knowledge discovery from text collections.
Automatic Documentation and Mathematical Linguistics – Springer Journals
Published: Mar 21, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.