Sökning: "treebank"

Hittade 4 uppsatser innehållade ordet treebank.

  1. 1. Cross-Lingual and Genre-Supervised Parsing and Tagging for Low-Resource Spoken Data

    Master-uppsats, Uppsala universitet/Institutionen för lingvistik och filologi

    Författare :Iliana Fosteri; [2023]
    Nyckelord :dependency parsing; part-of-speech tagging; low-resource languages; transcribed speech; large language models; cross-lingual learning; transfer learning; multi-task learning; Universal Dependencies;

    Sammanfattning : Dealing with low-resource languages is a challenging task, because of the absence of sufficient data to train machine-learning models to make predictions on these languages. One way to deal with this problem is to use data from higher-resource languages, which enables the transfer of learning from these languages to the low-resource target ones. LÄS MER

  3. 2. DEN FJÄTTRADE PROMETHEUS. En stilometrisk studie av hyperbatakonstruktioner

    Kandidat-uppsats, Göteborgs universitet/Institutionen för språk och litteraturer

    Författare :David Lafage; [2022-06-07]
    Nyckelord :antik grekiska; hyperbaton; treebank; Prometheus Vinctus; stilometri; TüNDRA; datalingvistik; Ancient Greek Dependency Treebank;

    Sammanfattning : In this student thesis, the phenomenon of hyperbaton (Hb) is used as a stylometric device to contribute to the discussion about the authorship of Prometheus bound (Pr.). The phenomenon is analyzed in a quantitative way in the Ancient Greek Dependency Treebank (AGDT), a corpus which allows for complex syntactic searches. LÄS MER

  4. 3. Towards a Wide-Coverage Grammar for Swedish Using GF

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Malin Ahlberg; [2012-02-28]
    Nyckelord :;

    Sammanfattning : This thesis describes work towards a wide-coverage grammar for parsing and generating Swedish text. We do this by using the dependently typed grammar formalism GF, a functional programming language specialized at describing grammars. LÄS MER

  5. 4. Deterministic dependency parsing of unrestricted English text

    Magister-uppsats, Matematiska och systemtekniska institutionen

    Författare :Mario Scholz; [2005]
    Nyckelord :;

    Sammanfattning : This master’s thesis describes a deterministic dependency parser using a memorybased learning approach to parse unrestricted English text. A converter transforms the Wall Street Journal section of the Penn Treebank to an intermediate dependency representation which is used to train the parser using the TiMBL (Daelemans, Zavrel, Sloot, & Bosch, 2003) library. LÄS MER