Sökning: "graph grammars"

Hittade 5 avhandlingar innehållade orden graph grammars.

  1. 1. Order-preserving graph grammars

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Sebastian Maneth; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graph grammars; graph parsing; graph series; hyperedge replacement; uniform parsing problem; abstract meaning representation; semantic modelling; order preservation; reentrancy preservation; minimally adequate teacher; weighted graph grammars;

    Sammanfattning : The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. LÄS MER

  3. 2. 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

  4. 3. 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

  5. 4. Type Domains for Abstract Interpretation : A critical study

    Författare :Per Mildner; Jonas Barklund; Håkan Millroth; Roland Bol; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

    Sammanfattning : Programming languages with dynamic typing such as Prolog do not require that the programmer declares the types of data or procedures. This flexibility, however, comes at a price. The lack of declarations makes it hard for a compiler to produce fast code since data must be assumed to be of any type. LÄS MER

  7. 5. Hybrid Control of Multi-robot Systems under Complex Temporal Tasks

    Författare :Meng Guo; Dimos V. Dimarogonas; Karl Henrik Johansson; Calin Belta; KTH; []
    Nyckelord :Automatic Control; Multi-robot system; Linear Temporal Logic; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Autonomous robots like household service robots, self-driving cars and dronesare emerging as important parts of our daily lives in the near future. They need tocomprehend and fulfill complex tasks specified by the users with minimal humanintervention. Also they should be able to handle un-modeled changes and contingentevents in the workspace. LÄS MER