Sökning: "formal language theory"
Visar resultat 1 - 5 av 61 avhandlingar innehållade orden formal language theory.
1. Translation as Linear Transduction : Models and Algorithms for Efficient Learning in Statistical Machine Translation
Sammanfattning : Automatic translation has seen tremendous progress in recent years, mainly thanks to statistical methods applied to large parallel corpora. Transductions represent a principled approach to modeling translation, but existing transduction classes are either not expressive enough to capture structural regularities between natural languages or too complex to support efficient statistical induction on a large scale. LÄS MER
2. Formal Languages and Automata in Computational Algebra
Sammanfattning : This thesis is a collection of six papers in computational algebra. In particular, we study noncommutative Gröb- ner bases, SAGBI bases and similar algebraic objects which can be represented as a graph or an automaton. LÄS MER
3. Culling Concurrency Theory : Reusable and trustworthy meta-theory, proof techniques and separation results
Sammanfattning : As concurrent systems become ever more complex and ever more ubiquitous, the need to understand and verify them grows ever larger. For this we need formal modelling languages that are well understood, with rigorously verified foundations and proof techniques, applicable to a wide variety of concurrent systems. LÄS MER
4. Der grammatische Tigersprung : Studien zu Heimito von Doderers Sprachterminologie
Sammanfattning : The Austrian novelist Heimito von Doderer (1896-1966) gained his reputation after World War II with the novels Die Strudlhofstiege (1951) and Die Dämonen (1956). His interest in language, its functions and its innermost essence appears from his novels, his diaries and his essays. LÄS MER
5. Complexity and expressiveness for formal structures in Natural Language Processing
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