| 1. |
- 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.
|
|
| 2. |
- 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.
|
|
| 3. |
- Angelov, Krasimir, 1978
(författare)
-
Type-Theoretical Bulgarian Grammar
- 2008
-
Ingår i: Proceedings of the 6th international conference on Advances in Natural Language Processing. - 9783540852865 ; 5221, s. 52 - 64
-
Konferensbidrag (refereegranskat)
|
|
| 4. |
|
|
| 5. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Abstract Syntax as Interlingua: Scaling Up the Grammatical Framework from Controlled Languages to Robust Pipelines
- 2020
-
Ingår i: Computational Linguistics. - : MIT Press. - 0891-2017 .- 1530-9312. ; 46:2, s. 425-486
-
Tidskriftsartikel (refereegranskat)abstract
- .Abstract syntax is an interlingual representation used in compilers. Grammatical Framework (GF) applies the abstract syntax idea to natural languages. The development of GF started in 1998, first as a tool for controlled language implementations, where it has gained an established position in both academic and commercial projects. GF provides grammar resources for over 40 languages, enabling accurate generation and translation, as well as grammar engineering tools and components for mobile and Web applications. On the research side, the focus in the last ten years has been on scaling up GF to wide-coverage language processing. The concept of abstract syntax offers a unified view on many other approaches: Universal Dependencies, WordNets, FrameNets, Construction Grammars, and Abstract Meaning Representations. This makes it possible for GF to utilize data from the other approaches and to build robust pipelines. In return, GF can contribute to data-driven approaches by methods to transfer resources from one language to others, to augment data by rule-based generation, to check the consistency of handannotated corpora, and to pipe analyses into high-precision semantic back ends. This article gives an overview of the use of abstract syntax as interlingua through both established and emerging NLP applications involving GF.
|
|
| 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.
|
|
