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

Authors:
Krasimir Angelov;Björn Bringert;Aarne Ranta
Affiliations:
Department of Computer Science and Engineering, Chalmers University of Technology, University of Gothenburg, Gothenburg, Sweden 412 96;Department of Computer Science and Engineering, Chalmers University of Technology, University of Gothenburg, Gothenburg, Sweden 412 96 and Google Inc, Mountain View, USA;Department of Computer Science and Engineering, Chalmers University of Technology, University of Gothenburg, Gothenburg, Sweden 412 96
Venue:
Journal of Logic, Language and Information
Year:
2010

Citing 22
Cited 6

On multiple context-free grammars

Theoretical Computer Science
A framework for defining logics

Journal of the ACM (JACM)
Type-theoretical grammar

Type-theoretical grammar
Modern compiler implementation in ML: basic techniques

Modern compiler implementation in ML: basic techniques
Architectural styles and the design of network-based software architectures

Architectural styles and the design of network-based software architectures
Grammatical Framework

Journal of Functional Programming
Off-line optimization for Earley-style HPSG processing

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Dialogue Systems as Proof Editors

Journal of Logic, Language and Information
An efficient parser generator for natural language

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Towards abstract categorial grammars

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Putting Linguistics into Speech Recognition: The Regulus Grammar Compiler (Studies in Computational Linguistics (Stanford, Calif.).)

Putting Linguistics into Speech Recognition: The Regulus Grammar Compiler (Studies in Computational Linguistics (Stanford, Calif.).)
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars

IEICE - Transactions on Information and Systems
DUDE: a dialogue and understanding development environment, mapping business process models to information state update dialogue systems

EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
Incremental parsing with parallel multiple context-free grammars

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
The universal parser architecture for knowledge-based machine translation

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Speech recognition grammar compilation in Grammatical Framework

SLP '07 Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing
Grammar-based context-specific statistical language modelling

SLP '07 Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing
Parsing linear context-free rewriting systems

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Multilingual syntax editing in GF

CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Implementing controlled languages in GF

CNL'09 Proceedings of the 2009 conference on Controlled natural language
Translating formal software specifications to natural language

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

Grammatical framework web service

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
Implementing controlled languages in GF

CNL'09 Proceedings of the 2009 conference on Controlled natural language
Message oriented middleware for flexible wizard of Oz experiments in HCI

HCII'11 Proceedings of the 14th international conference on Human-computer interaction: design and development approaches - Volume Part I
An open-source computational grammar for romanian

CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
DynGenPar: a dynamic generalized parser for common mathematical language

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Typeful ontologies with direct multilingual verbalization

CNL'10 Proceedings of the Second international conference on Controlled Natural Language

Quantified Score

Hi-index	0.00

Visualization

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.