Publicēti raksti (MII) / Published Articles

Permanent URI for this collection

https://dspace-dev.lu.lv/handle/7/239
LU Matemātikas un informātikas institūta personāla publicēti raksti.

Browse

Recent Submissions

Now showing 1 - 5 of 26
  • Thumbnail Image
    Item
    RIGOTRIO at SemEval-2017 Task 9: Combining Machine Learning and Grammar Engineering for AMR Parsing and Generation
    (Association for Computational Linguistics, 2017-08) Gruzitis, Normunds; Gosko, Didzis; Barzdins, Guntis
    By addressing both text-to-AMR parsing and AMR-to-text generation, SemEval-2017 Task 9 established AMR as a powerful semantic interlingua. We strengthen the interlingual aspect of AMR by applying the multilingual Grammatical Framework (GF) for AMR-to-text generation. Our current rule-based GF approach completely covered only 12.3% of the test AMRs, therefore we combined it with state-of-the-art JAMR Generator to see if the combination increases or decreases the overall performance. The combined system achieved the automatic BLEU score of 18.82 and the human Trueskill score of 107.2, to be compared to the plain JAMR Generator results. As for AMR parsing, we added NER extensions to our SemEval-2016 general-domain AMR parser to handle the biomedical genre, rich in organic compound names, achieving Smatch F1=54.0%.
  • Thumbnail Image
    Item
    Towards a theory of inductive inference
    (1973) Barzdins, Janis; Podnieks, Karlis
  • Thumbnail Image
    Item
    On computation in the limit by non-deterministic Turing machines
    (Scientific Proceedings of Latvia State University, 1974) Freivalds, Rūsiņš; Podnieks, Karlis
  • Thumbnail Image
    Item
    On the reducibility of function classes
    (Latvia State University, 1972) Podnieks, Karlis
    N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, 1-reducibility, tt-, btt-, 1tt- and Turing reducibility can be introduced. Table of contents. 1. Introduction. 2. Definitions of reducibilities and their simplest properties. 3. m-reducibility and the arithmetical hierarchy. 4. m-reducibility on SIGMA_1^fn. 5. Special classes. 6. Comparing various reducibilities on SIGMA_1^fn. 7. Notes on reducibilities of classes of sets.
  • Thumbnail Image
    Item
    Modeling and Query Language for Hospitals
    (Springer, 2013) Barzdins, Janis; Barzdins, Juris; Rencis, Edgars; Sostaks, Agris