| 1. |
- 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.
|
|
| 2. |
- Angelov, Krasimir, 1978
(författare)
-
Incremental Parsing of Parallel Multiple Context-Free Grammars
- 2009
-
Ingår i: 12th Conference of the European Chapter of the Association for Computational Linguistics. - Morristown, NJ, USA : Association for Computational Linguistics. - 9781932432169 ; , s. 69-76
-
Konferensbidrag (refereegranskat)abstract
- Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has the advantage to be incremental and to support PMCFG directly rather than the weaker MCFG formalism. The algorithm is also top-down which allows it to be used for grammar based word prediction.
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Grammar Development in GF
- 2009
-
Ingår i: EACL. ; , s. 57-60
-
Konferensbidrag (refereegranskat)
|
|
| 6. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Implementing Controlled Languages in GF
- 2009
-
Ingår i: Workshop on Controlled Natural Language, CNL 2009; Marettimo Island; Italy; 8 June 2009 through 10 June 2009. - 1613-0073. ; 448
-
Konferensbidrag (refereegranskat)abstract
- Abstract. The paper introduces GF, Grammatical Framework, as a tool for implementing controlled languages. GF provides a high-level grammar formalism and a resource grammar library that make it easy to write grammars that cover similar fragments in several natural languages at the same time. Authoring help tools and automatic translation are provided for all grammars. As an example, a grammar of Attempto Controlled English is implemented and then ported to French, German, and Swedish.
|
|
