Search (45 results, page 1 of 3)

  • × theme_ss:"Automatisches Indexieren"
  1. Wolfekuhler, M.R.; Punch, W.F.: Finding salient features for personal Web pages categories (1997) 0.03 
    0.030867463 = product of:
  0.12346985 = sum of:
    0.12346985 = sum of:
      0.07975426 = weight(_text_:networks in 2673) [ClassicSimilarity], result of:
        0.07975426 = score(doc=2673,freq=2.0), product of:
          0.21802035 = queryWeight, product of:
            4.72992 = idf(docFreq=1060, maxDocs=44218)
            0.046093877 = queryNorm
          0.36581108 = fieldWeight in 2673, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.72992 = idf(docFreq=1060, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2673)
      0.04371559 = weight(_text_:22 in 2673) [ClassicSimilarity], result of:
        0.04371559 = score(doc=2673,freq=2.0), product of:
          0.16141291 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046093877 = queryNorm
          0.2708308 = fieldWeight in 2673, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2673)
  0.25 = coord(1/4)
    Date
    1. 8.1996 22:08:06
    Source
    Computer networks and ISDN systems. 29(1997) no.8, S.1147-1156
  2. Olsgaard, J.N.; Evans, E.J.: Improving keyword indexing (1981) 0.02 
    0.023737187 = product of:
  0.094948746 = sum of:
    0.094948746 = weight(_text_:communication in 4996) [ClassicSimilarity], result of:
      0.094948746 = score(doc=4996,freq=2.0), product of:
        0.19902779 = queryWeight, product of:
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.046093877 = queryNorm
        0.47706276 = fieldWeight in 4996, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.078125 = fieldNorm(doc=4996)
  0.25 = coord(1/4)
    Abstract
    This communication examines some of the most frequently cited critisms of keyword indexing. These critisms include (1) absence of general subject headings, (2) limited entry points, and (3) irrelevant indexing. Some solutions are suggested to meet these critisms.
  3. Dolamic, L.; Savoy, J.: When stopword lists make the difference (2009) 0.02 
    0.023498617 = product of:
  0.09399447 = sum of:
    0.09399447 = weight(_text_:communication in 3319) [ClassicSimilarity], result of:
      0.09399447 = score(doc=3319,freq=4.0), product of:
        0.19902779 = queryWeight, product of:
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.046093877 = queryNorm
        0.47226804 = fieldWeight in 3319, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3319)
  0.25 = coord(1/4)
    Abstract
    In this brief communication, we evaluate the use of two stopword lists for the English language (one comprising 571 words and another with 9) and compare them with a search approach accounting for all word forms. We show that through implementing the original Okapi form or certain ones derived from the Divergence from Randomness (DFR) paradigm, significantly lower performance levels may result when using short or no stopword lists. For other DFR models and a revised Okapi implementation, performance differences between approaches using short or long stopword lists or no list at all are usually not statistically significant. Similar conclusions can be drawn when using other natural languages such as French, Hindi, or Persian.
    Series
    Brief communication
  4. Simões, M. da Graça; Machado, L.M.; Souza, R.R.; Almeida, M.B.; Tavares Lopes, A.: Automatic indexing and ontologies : the consistency of research chronology and authoring in the context of Information Science (2018) 0.02 
    0.016616032 = product of:
  0.066464126 = sum of:
    0.066464126 = weight(_text_:communication in 5909) [ClassicSimilarity], result of:
      0.066464126 = score(doc=5909,freq=2.0), product of:
        0.19902779 = queryWeight, product of:
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.046093877 = queryNorm
        0.33394393 = fieldWeight in 5909, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.317879 = idf(docFreq=1601, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5909)
  0.25 = coord(1/4)
    Source
    Challenges and opportunities for knowledge organization in the digital age: proceedings of the Fifteenth International ISKO Conference, 9-11 July 2018, Porto, Portugal / organized by: International Society for Knowledge Organization (ISKO), ISKO Spain and Portugal Chapter, University of Porto - Faculty of Arts and Humanities, Research Centre in Communication, Information and Digital Culture (CIC.digital) - Porto. Eds.: F. Ribeiro u. M.E. Cerveira
  5. Mao, J.; Xu, W.; Yang, Y.; Wang, J.; Yuille, A.L.: Explain images with multimodal recurrent neural networks (2014) 0.01 
    0.014800546 = product of:
  0.059202183 = sum of:
    0.059202183 = product of:
      0.118404366 = sum of:
        0.118404366 = weight(_text_:networks in 1557) [ClassicSimilarity], result of:
          0.118404366 = score(doc=1557,freq=6.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.5430886 = fieldWeight in 1557, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=1557)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    In this paper, we present a multimodal Recurrent Neural Network (m-RNN) model for generating novel sentence descriptions to explain the content of images. It directly models the probability distribution of generating a word given previous words and the image. Image descriptions are generated by sampling from this distribution. The model consists of two sub-networks: a deep recurrent neural network for sentences and a deep convolutional network for images. These two sub-networks interact with each other in a multimodal layer to form the whole m-RNN model. The effectiveness of our model is validated on three benchmark datasets (IAPR TC-12 [8], Flickr 8K [28], and Flickr 30K [13]). Our model outperforms the state-of-the-art generative method. In addition, the m-RNN model can be applied to retrieval tasks for retrieving images or sentences, and achieves significant performance improvement over the state-of-the-art methods which directly optimize the ranking objective function for retrieval.
  6. Krutulis, J.D.; Jacob, E.K.: ¬A theoretical model for the study of emergent structure in adaptive information networks (1995) 0.01 
    0.014098695 = product of:
  0.05639478 = sum of:
    0.05639478 = product of:
      0.11278956 = sum of:
        0.11278956 = weight(_text_:networks in 3353) [ClassicSimilarity], result of:
          0.11278956 = score(doc=3353,freq=4.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.517335 = fieldWeight in 3353, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3353)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Attempts to automate classification have focused on mimicking the intellectual processes whereby human classifiers assign entities to mutually exclusive groups that exhibit or more shared characteristics. A more viable approach might be to construct an adaptive retrieval system that produces groupings of related entities by generating dynamic categories based on document content and on the system's emergent structure as it adapts to modifications in the database and to observed patterns of access. Presents a theoretical model for adaptive information networks using relevance feedback and genetic algorithms to generate emergent structure
  7. Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986) 0.01 
    0.012490168 = product of:
  0.049960673 = sum of:
    0.049960673 = product of:
      0.099921346 = sum of:
        0.099921346 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.099921346 = score(doc=402,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.61904186 = fieldWeight in 402, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=402)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Information processing and management. 22(1986) no.6, S.465-476
  8. Ma, N.; Zheng, H.T.; Xiao, X.: ¬An ontology-based latent semantic indexing approach using long short-term memory networks (2017) 0.01 
    0.012333789 = product of:
  0.049335156 = sum of:
    0.049335156 = product of:
      0.09867031 = sum of:
        0.09867031 = weight(_text_:networks in 3810) [ClassicSimilarity], result of:
          0.09867031 = score(doc=3810,freq=6.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.45257387 = fieldWeight in 3810, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3810)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologies. In this paper, we propose an Ontology-based Latent Semantic Indexing approach utilizing Long Short-Term Memory networks (LSTM-OLSI). We utilize an importance-aware topic model to extract document-level semantic features and leverage ontologies to extract word-level contextual features. Then we encode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.
  9. Karpathy, A.; Fei-Fei, L.: Deep visual-semantic alignments for generating image descriptions (2015) 0.01 
    0.012084596 = product of:
  0.048338383 = sum of:
    0.048338383 = product of:
      0.09667677 = sum of:
        0.09667677 = weight(_text_:networks in 1868) [ClassicSimilarity], result of:
          0.09667677 = score(doc=1868,freq=4.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.44343 = fieldWeight in 1868, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=1868)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    We present a model that generates free-form natural language descriptions of image regions. Our model leverages datasets of images and their sentence descriptions to learn about the inter-modal correspondences between text and visual data. Our approach is based on a novel combination of Convolutional Neural Networks over image regions, bidirectional Recurrent Neural Networks over sentences, and a structured objective that aligns the two modalities through a multimodal embedding. We then describe a Recurrent Neural Network architecture that uses the inferred alignments to learn to generate novel descriptions of image regions. We demonstrate the effectiveness of our alignment model with ranking experiments on Flickr8K, Flickr30K and COCO datasets, where we substantially improve on the state of the art. We then show that the sentences created by our generative model outperform retrieval baselines on the three aforementioned datasets and a new dataset of region-level annotations.
  10. Fuhr, N.; Niewelt, B.: ¬Ein Retrievaltest mit automatisch indexierten Dokumenten (1984) 0.01 
    0.010928897 = product of:
  0.04371559 = sum of:
    0.04371559 = product of:
      0.08743118 = sum of:
        0.08743118 = weight(_text_:22 in 262) [ClassicSimilarity], result of:
          0.08743118 = score(doc=262,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.5416616 = fieldWeight in 262, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=262)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    20.10.2000 12:22:23
  11. Hlava, M.M.K.: Automatic indexing : comparing rule-based and statistics-based indexing systems (2005) 0.01 
    0.010928897 = product of:
  0.04371559 = sum of:
    0.04371559 = product of:
      0.08743118 = sum of:
        0.08743118 = weight(_text_:22 in 6265) [ClassicSimilarity], result of:
          0.08743118 = score(doc=6265,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.5416616 = fieldWeight in 6265, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=6265)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Information outlook. 9(2005) no.8, S.22-23
  12. Donahue, J.; Hendricks, L.A.; Guadarrama, S.; Rohrbach, M.; Venugopalan, S.; Saenko, K.; Darrell, T.: Long-term recurrent convolutional networks for visual recognition and description (2014) 0.01 
    0.010070496 = product of:
  0.040281985 = sum of:
    0.040281985 = product of:
      0.08056397 = sum of:
        0.08056397 = weight(_text_:networks in 1873) [ClassicSimilarity], result of:
          0.08056397 = score(doc=1873,freq=4.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.369525 = fieldWeight in 1873, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1873)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Models based on deep convolutional networks have dominated recent image interpretation tasks; we investigate whether models which are also recurrent, or "temporally deep", are effective for tasks involving sequences, visual and otherwise. We develop a novel recurrent convolutional architecture suitable for large-scale visual learning which is end-to-end trainable, and demonstrate the value of these models on benchmark video recognition tasks, image description and retrieval problems, and video narration challenges. In contrast to current models which assume a fixed spatio-temporal receptive field or simple temporal averaging for sequential processing, recurrent convolutional models are "doubly deep" in that they can be compositional in spatial and temporal "layers". Such models may have advantages when target concepts are complex and/or training data are limited. Learning long-term dependencies is possible when nonlinearities are incorporated into the network state updates. Long-term RNN models are appealing in that they directly can map variable-length inputs (e.g., video frames) to variable length outputs (e.g., natural language text) and can model complex temporal dynamics; yet they can be optimized with backpropagation. Our recurrent long-term models are directly connected to modern visual convnet models and can be jointly trained to simultaneously learn temporal dynamics and convolutional perceptual representations. Our results show such models have distinct advantages over state-of-the-art models for recognition or generation which are separately defined and/or optimized.
  13. Pfeifer, U.; Fuhr, N.; Huynh, T.: Searching structured documents with the enhanced retrieval functionality of freeWAIS-sf and SFgate (1995) 0.01 
    0.009969283 = product of:
  0.03987713 = sum of:
    0.03987713 = product of:
      0.07975426 = sum of:
        0.07975426 = weight(_text_:networks in 2214) [ClassicSimilarity], result of:
          0.07975426 = score(doc=2214,freq=2.0), product of:
            0.21802035 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046093877 = queryNorm
            0.36581108 = fieldWeight in 2214, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2214)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Computer networks and ISDN systems. 27(1995) no.6, S.1027-36
  14. Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986) 0.01 
    0.009367626 = product of:
  0.037470505 = sum of:
    0.037470505 = product of:
      0.07494101 = sum of:
        0.07494101 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.07494101 = score(doc=58,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.46428138 = fieldWeight in 58, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=58)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    14. 6.2015 22:12:44
  15. Hauer, M.: Automatische Indexierung (2000) 0.01 
    0.009367626 = product of:
  0.037470505 = sum of:
    0.037470505 = product of:
      0.07494101 = sum of:
        0.07494101 = weight(_text_:22 in 5887) [ClassicSimilarity], result of:
          0.07494101 = score(doc=5887,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.46428138 = fieldWeight in 5887, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5887)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Wissen in Aktion: Wege des Knowledge Managements. 22. Online-Tagung der DGI, Frankfurt am Main, 2.-4.5.2000. Proceedings. Hrsg.: R. Schmidt
  16. Fuhr, N.: Rankingexperimente mit gewichteter Indexierung (1986) 0.01 
    0.009367626 = product of:
  0.037470505 = sum of:
    0.037470505 = product of:
      0.07494101 = sum of:
        0.07494101 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
          0.07494101 = score(doc=2051,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.46428138 = fieldWeight in 2051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=2051)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    14. 6.2015 22:12:56
  17. Hauer, M.: Tiefenindexierung im Bibliothekskatalog : 17 Jahre intelligentCAPTURE (2019) 0.01 
    0.009367626 = product of:
  0.037470505 = sum of:
    0.037470505 = product of:
      0.07494101 = sum of:
        0.07494101 = weight(_text_:22 in 5629) [ClassicSimilarity], result of:
          0.07494101 = score(doc=5629,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.46428138 = fieldWeight in 5629, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5629)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    B.I.T.online. 22(2019) H.2, S.163-166
  18. Biebricher, N.; Fuhr, N.; Lustig, G.; Schwantner, M.; Knorz, G.: ¬The automatic indexing system AIR/PHYS : from research to application (1988) 0.01 
    0.0078063556 = product of:
  0.031225422 = sum of:
    0.031225422 = product of:
      0.062450845 = sum of:
        0.062450845 = weight(_text_:22 in 1952) [ClassicSimilarity], result of:
          0.062450845 = score(doc=1952,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.38690117 = fieldWeight in 1952, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=1952)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    16. 8.1998 12:51:22
  19. Kutschekmanesch, S.; Lutes, B.; Moelle, K.; Thiel, U.; Tzeras, K.: Automated multilingual indexing : a synthesis of rule-based and thesaurus-based methods (1998) 0.01 
    0.0078063556 = product of:
  0.031225422 = sum of:
    0.031225422 = product of:
      0.062450845 = sum of:
        0.062450845 = weight(_text_:22 in 4157) [ClassicSimilarity], result of:
          0.062450845 = score(doc=4157,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.38690117 = fieldWeight in 4157, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=4157)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Information und Märkte: 50. Deutscher Dokumentartag 1998, Kongreß der Deutschen Gesellschaft für Dokumentation e.V. (DGD), Rheinische Friedrich-Wilhelms-Universität Bonn, 22.-24. September 1998. Hrsg. von Marlies Ockenfeld u. Gerhard J. Mantwill
  20. Tsareva, P.V.: Algoritmy dlya raspoznavaniya pozitivnykh i negativnykh vkhozdenii deskriptorov v tekst i protsedura avtomaticheskoi klassifikatsii tekstov (1999) 0.01 
    0.0078063556 = product of:
  0.031225422 = sum of:
    0.031225422 = product of:
      0.062450845 = sum of:
        0.062450845 = weight(_text_:22 in 374) [ClassicSimilarity], result of:
          0.062450845 = score(doc=374,freq=2.0), product of:
            0.16141291 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046093877 = queryNorm
            0.38690117 = fieldWeight in 374, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=374)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    1. 4.2002 10:22:41

Authors

Years

Languages

  • e 27
  • d 16
  • m 1
  • ru 1
  • More… Less…

Types

  • a 40
  • el 5
  • m 2
  • x 2
  • More… Less…

Themes

Classifications