| 1. |
|
|
| 2. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
A Framework for Conflict Analysis of Normative Texts Written in Controlled Natural Language
- 2013
-
Ingår i: Journal of Logic and Algebraic Programming. - : Elsevier BV. - 1567-8326. ; 82:5-7
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we are concerned with the analysis of normative conflicts, or the detection of conflicting obligations, permissions and prohibitions in normative texts written in a Controlled Natural Language (CNL). For this we present AnaCon, a proof-of-concept system where normative texts written in CNL are automatically translated into the formal language CL using the Grammatical Framework (GF). Such CL expressions are then analysed for normative conflicts by the CLAN tool, which gives counter-examples in cases where conflicts are found. The framework also uses GF to give a CNL version of the counter-example, helping the user to identify the conflicts in the original text. We detail the application of AnaCon to two case studies and discuss the effectiveness of our approach.
|
|
| 3. |
|
|
| 4. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
Fast Statistical Parsing with Parallel Multiple Context-Free Grammars
- 2014
-
Ingår i: EACL'14, 14th Conference of the European Chapter of the Association for Computational Linguistics.
-
Konferensbidrag (refereegranskat)abstract
- We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which we added statistical ranking. We show that the new algorithm is several times faster than other statistical PMCFG parsing algorithms on real-sized grammars. At the same time the algorithm is more general since it supports non-binarized and non-linear grammars. We also show that if we make the search heuristics non-admissible, the parsing speed improves even further, at the risk of returning sub-optimal solutions.
|
|
| 5. |
- 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.
|
|
| 6. |
- 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.
|
|
| 7. |
|
|
| 8. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
PGF: A Portable Run-time Format for Type-theoretical Grammars
- 2010
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 19:2, s. 201-228
-
Tidskriftsartikel (refereegranskat)abstract
- Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.
|
|
| 9. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
Speech-Enabled Hybrid Multilingual Translation for Mobile Devices
- 2014
-
Ingår i: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. - : Association for Computational Linguistics. - 9781937284756
-
Konferensbidrag (refereegranskat)abstract
- This paper presents an architecture and a prototype for speech-to-speech translation on Android devices, based on GF (Grammatical Framework). From the user’s point of view, the advantage is that the system works off-line and yet has a lean size; it also gives, as a bonus, grammatical information useful for language learners. From the developer’s point of view, the advantage is the open architecture that permits the customization of the system to new languages and for special purposes. Thus the architecture can be used for controlled-language-like translators that deliver very high quality, which is the traditional strength of GF. However, this paper focuses on a general-purpose system that allows arbitrary input. It covers eight languages.
|
|
| 10. |
- 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.
|
|
