Sökning: "hyperedge replacement grammar"

Hittade 3 avhandlingar innehållade orden hyperedge replacement grammar.

1. 1. Towards semantic language processing

   Författare :Anna Jonsson; Johanna Björklund; Marco Kuhlmann; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Weighted tree automata; abstract meaning representation; contextual hyperedge replacement grammar; hyperedge replacement grammar; semantic modelling; the N best problem; Computer Science; datalogi; datorlingvistik; computational linguistics;

   Sammanfattning : The overall goal of the field of natural language processing is to facilitate the communication between humans and computers, and to help humans with natural language problems such as translation. In this thesis, we focus on semantic language processing. LÄS MER

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

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