Sökning: "abstract syntax trees"

Visar resultat 1 - 5 av 10 avhandlingar innehållade orden abstract syntax trees.

  1. 1. Multilingual Abstractions: Abstract Syntax Trees and Universal Dependencies

    Författare :Kolachina Prasanth; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Grammatical Framework; Universal Dependencies; Natural Language Processing; multilinguality; abstract syntax trees; dependency trees; multilingual generation; multilingual parsers;

    Sammanfattning : This thesis studies the connections between parsing friendly representations and interlingua grammars developed for multilingual language generation. Parsing friendly representations refer to dependency tree representations that can be used for robust, accurate and scalable analysis of natural language text. LÄS MER

  3. 2. Multilingual Grammars and Universal Dependencies

    Författare :Kolachina Prasanth; Göteborgs universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NLP; Grammatical Framework; Universal Dependencies; Abstract Syntax; Grammatical Framework;

    Sammanfattning : Abstract syntax trees are an alternative representation to syntactic structures commonly found in NLP systems. This representation allows for sharing of structures across languages, making it well suited to serve as a translation interlingua. LÄS MER

  4. 3. Best Trees Extraction and Contextual Grammars for Language Processing

    Författare :Anna Jonsson; Johanna Björklund; Frank Drewes; Hendrik Jan Hoogeboom; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Weighted tree automata; the N-best problem; efficient algorithms; semantic graph; abstract meaning representation; contextual graph grammars; hyperedge replacement; graph extensions;

    Sammanfattning : In natural language processing, the syntax of a sentence refers to the words used in the sentence, their grammatical role, and their order. Semantics concerns the concepts represented by the words in the sentence and their relations, i.e., the meaning of the sentence. LÄS MER

  5. 4. Complexity and expressiveness for formal structures in Natural Language Processing

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph grammars; formal languages; natural language processing; parameterized complexity; abstract meaning representation; tree automata; deterministic tree-walking transducers; mildly context-sensitive languages; hyperedge replacement; tree adjoining languages; minimally adequate teacher;

    Sammanfattning : The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. LÄS MER

  7. 5. Object-Oriented Declarative Program Analysis

    Författare :Eva Magnusson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; Datalogi; control; systems; numerical analysis; Declarative object-oriented programming; attribute grammars; fixed-point computations; Computer science; cross references; system; kontroll;

    Sammanfattning : This thesis deals with techniques for raising the programming level for a particular kind of computations, namely those on abstract syntax trees. Such computations are central in many program analysis tools, such as compilers, smart language-sensitive editors, and static analysis tools. LÄS MER