Abstract
The article proposes an algorithm for decoding and representation in natural language of the Universal Decimal Classifycation (UDC) complex class numbers. The algorithm is based on the formal definition of correct class numbers using a generative grammar, which sets the list of structures starting with simple table codes of UDC classes. Then separate integers, auxiliary and independent class numbers are sequentially attached to the codes with special symbols of relations of classes, which compose the complex class number. The algorithm expresses the values of the analyzed complex indices by descriptions (names and notes) of the table classes included in the structure of the analyzed string. The class descriptions are accompanied with the logical connectors based on the functions of the auxiliary characters. They provide the idea on connection of concepts denoted in the class number. The algorithm action is described evidently for the analysis of combined index 539.4.019: [535-15+537.8.029.6]. The proposed algorithm is applicable both to visualize the meaning of complex class numbers, and to ensure the completeness and accuracy of the documents retrieval by the UDC classes.
Highlights
The article proposes an algorithm for decoding and representation in natural language of the Universal Decimal Classifycation (UDC) complex class numbers
The algorithm is based on the formal definition of correct class numbers using a generative grammar, which sets the list of structures starting with simple table codes of UDC classes
Separate integers, auxiliary and independent class numbers are sequentially attached to the codes with special symbols of relations of classes, which compose the complex class number
Summary
Согласно этому алгоритму множество правильно образованных индексов УДК U строится (если отвлечься от разделительных точек, служащих для облегчения зрительного восприятия индекса) на основе «простых индексов», которыми могут быть все конечные цепочки десятичных цифр:. {Простые} = {ц1ц2,...цn} U, где цi {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, n [1, n]. «Сложные индексы» образуются путем комбинирования «простых индексов»: {Сложные} = {[И1] [И2]}, где И1 и И2 – произвольные индексы, входящие в U (как простые, так и сложные), а знак обозначает один из служебных символов комбинирования основных и вспомогательных классов по правилам УДК: плюс, двоеточие, дефис, апостроф, скобки, знак равенства, кавычки, астериск, сочетания точка-нуль, дефис-нуль и скобка-равно. Имеются также правила дополнения и упрощения индексов, на которых мы останавливаться не будем
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
