| 1. |
|
|
| 2. |
- Angelov, Krasimir, 1978
(författare)
-
GF Runtime System
- 2009
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Natural languages have been subject of studies for centuriesand are hot topic even today. The demand for computer systems able to communicate directly in natural language places new challenges. Computational resources like grammars and lexicons and efficient processing tools are needed.Grammars are described as computer programs in declarativedomain specific languages. Just like any other programming language they require mature compilers and efficient runtime systems.The topic of this thesis is the runtime system for the Grammatical Framework (GF) language. The first part of the thesis describes the semantics of the Portable Grammar Format (PGF). This is a low-level format which for GF plays the same role as the JVM bytecode for Java. The representation is designed to be as simple as possible to make it easy to write interpreters for it. The second part is for the incremetal parsing algorithm in PGF. The parser performance was always a bottle neck in GF until now. The new parser is of orders of magnitude faster than any of the previous implementations. The last contribution of the thesis is the development of the Bulgarian resource grammar. This is the first Balkan language in the resource library and the first open-source grammar for Bulgarian. The grammar development was also an important benchmark for the development of the parsing algorithm.
|
|
| 3. |
|
|
| 4. |
- Angelov, Krasimir, 1978
(författare)
-
The Mechanics of the Grammatical Framework
- 2011
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Grammatical Framework (GF) is a well known theoretical framework and a mature programming language for the description of natural languages. The GF community is growing rapidly and the range of applications is expanding. Within the framework, there are computational resources for 26 languages created from different people in different organizations. The coverage of the different resourcesvaries but there are complete morphologies and grammars for at least 20 languages. This advancement would not be possible without the continuous development of the GF compiler and interpreter.The demand for efficient and portable execution model forGF has led to major changes in both the compiler and the interpreter. We developed a new low-level representationcalled Portable Grammar Format (PGF) which is simple enough for an efficient interpretation. Since it was already known that a major fragment of GF is equivalent to Parallel Multiple Context-Free Grammar (PMCFG), we designed PGFas an extension that adds to PMCFG distinctive features of GF such as multilingualism, higher-order abstract syntax,dependent types, etc. In the process we developed novel algorithms for parsing and linearization with PMCFG and a framework for logical reasoning in first-order type theory where the proof search can be constrained by the parse chart.This monograph is the detailed description of the engine forefficient interpretation of PGF and is intended as a reference for building alternative implementations and as a foundation for the future development of PGF.
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
