Search for dissertations about: "mildly context-sensitive languages"

Found 4 swedish dissertations containing the words mildly context-sensitive languages.

2. 1. Complexities of Order-Related Formal Language Extensions

   Author : Martin Berglund; Frank Drewes; Henrik Björklund; Markus Holzer; Umeå universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; complexity; automata; languages; order; shuffle; regular expressions; context-free; mildly context-sensitive; parsing; membership; algorithm analysis; Computer Science; datalogi;

   Abstract : The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. READ MORE

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

   Author : Petter Ericson; Henrik Björklund; Frank Drewes; Umeå universitet; []
   Keywords : 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;

   Abstract : 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. READ MORE

5. 3. Complexities of Parsing in the Presence of Reordering

   Author : Martin Berglund; Frank Drewes; Bruce Watson; Umeå universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; parsing; membership problems; complexity theory; reordering; shuffle; mildly context-sensitive; formal languages; Computer Science; datalogi;

   Abstract : The work presented in this thesis discusses various formalisms for representing the addition of order-controlling and order-relaxing mechanisms to existing formal language models. An immediate example is shuffle expressions, which can represent not only all regular languages (a regular expression is a shuffle expression), but also features additional operations that generate arbitrary interleavings of its argument strings. READ MORE

6. 4. Three Studies on Model Transformations - Parsing, Generation and Ease of Use

   Author : Håkan Burden; Göteborgs universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : ABSTRACT Transformations play an important part in both software development and the automatic processing of natural languages. We present three publications rooted in the multi-disciplinary research of Language Technology and Software Engineering and relate their contribution to the literature on syntactical transformations. READ MORE