PGF: A Portable Run-time Format for Type-theoretical Grammars

Angelov, Krasimir; Bringert, Björn; Ranta, Aarne

doi:10.1007/s10849-009-9112-y

Cited by 18 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The time required to compile modified grammars makes Bison entirely unsuitable for applications where the grammar can change dynamically. Even if Bison were changed to allow loading a different LR table at runtime, it would still take 11 times longer than DynGenPar to process our fairly small two-layered grammar, and we expect the We also benchmarked our support for PGF [4] grammar files produced by the Grammatical Framework (GF) [22,23] against two PGF runtimes provided by the GF project (we used a snapshot of the repository from February 24): the production runtime written in Haskell and the new experimental runtime written in C. As an example grammar, we used GF's Phrasebook example, which is the one explicitly documented as being supported by the current version of GF's C runtime, with the sample sentence See you in the best Italian restaurant tomorrow!, a valid sentence in the Phrasebook grammar. (We also tried parsing with the full English resource grammar, but DynGenPar would not scale to such huge grammars and did not terminate in a reasonable time.)…”

Section: Resultsmentioning

confidence: 99%

“…In addition, our implementation already supports features such as incremental addition of PMCFG rules which are essential for our application, which are not implemented in Angelov's current code and which may or may not be easy to add to it. Our parser also supports importing the compiled PGF [4] files from GF, allowing to reuse the rest of the framework. When doing so, as evidenced in section 6, it reaches a comparable performance.…”

Section: State Of the Artmentioning

confidence: 99%

“…Our implementation can import PGF [4] grammar files produced by the Grammatical Framework (GF) [22,23], a binary format based on PMCFGs. This is handled by converting them to PMCFG standard form, with a few extensions supported by our parser:…”

Section: Interoperability With Gfmentioning

confidence: 99%

See 2 more Smart Citations

DynGenPar – A Dynamic Generalized Parser for Common Mathematical Language

Kofler

Neumaier

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper introduces a dynamic generalized parser aimed primarily at common natural mathematical language. Our algorithm combines the efficiency of GLR parsing, the dynamic extensibility of tableless approaches and the expressiveness of extended context-free grammars such as parallel multiple context-free grammars (PMCFGs). In particular, it supports efficient dynamic rule additions to the grammar at any moment. The algorithm is designed in a fully incremental way, allowing to resume parsing with additional tokens without restarting the parse process, and can predict possible next tokens. Additionally, we handle constraints on the token following a rule. This allows for grammatically correct English indefinite articles when working with word tokens. It can also represent typical operations for scannerless parsing such as maximal matches when working with character tokens. Our long-term goal is to computerize a large library of existing mathematical knowledge using the new parser, starting from natural language input as found in textbooks or in the papers collected by the digital mathematical library (DML) projects around the world. In this paper, we present the algorithmic ideas behind our approach, give a short overview of the implementation, and present some efficiency results. The new parser is available at http://www.tigen.org/kevin.kofler/fmathl/dyngenpar/.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: State Of the Artmentioning

confidence: 99%

See 1 more Smart Citation

DynGenPar – A Dynamic Generalized Parser for Common Mathematical Language

Kofler

Neumaier

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Portable Grammar Format (PGF, Angelov et al, 2008) is a low-level format to which GF grammars are compiled. The PGF Web Service loads PGF files from disk, and uses them to serve client requests.…”

Section: Portable Grammar Format (Pgf)mentioning

confidence: 99%

Grammatical framework web service

Bringert

Angelov

Ranta

2009

Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Ses

Self Cite

View full text Add to dashboard Cite

We present a web service for natural language parsing, prediction, generation, and translation using grammars in Portable Grammar Format (PGF), the target format of the Grammatical Framework (GF) grammar compiler. The web service implementation is open source, works with any PGF grammar, and with any web server that supports FastCGI. The service exposes a simple interface which makes it possible to use it for interactive natural language web applications. We describe the functionality and interface of the web service, and demonstrate several applications built on top of it.

show abstract

“…In this multilingual setting, having different pre-or post-processors for the different languages will defeat the purpose of having a single multilingual grammar. GF grammars are distributed in a portable format (Angelov et al, 2010) which can be deployed in different environments ranging from web servers and desktop translation systems to mobile devices. The virtual machine for GF (Angelov, 2011) is also developed as a platform independent software.…”

Section: Introductionmentioning

confidence: 99%