Towards Modular Development of Typed Unification Grammars

  title={Towards Modular Development of Typed Unification Grammars},
  author={Yael Sygal and Shuly Wintner},
  journal={Computational Linguistics},
Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer scientists, in a process very similar to the development of large-scale software. Grammars are written in grammatical formalisms that resemble very-high-level programming languages, and are thus very similar to computer programs. Yet grammar engineering is still in its infancy: Few grammar development… 

High-level methodologies for grammar engineering, introduction to the special issue

Advances in the field have led to the development of environments for semi-automatic grammar engineering, borrowing ideas from compilation and machine learning, where grammar engineering benefits from elaborate high-level methodologies and techniques.

XMG: eXtensible MetaGrammar

This article argues that XMG displays three features that facilitate both grammar writing and a fast prototyping of tree-based grammars, and explains how this architecture naturally supports the design of three linguistic formalisms, namely, FB-LTAG, IG, and Multi-Component Tree-Adjoining Grammar (MC-TAG).

Workshop on High-level Methodologies for Grammar Engineering @ ESSLLI 2013

The way the authors use hierarchical clustering to learn an AB grammar from partial derivation trees is described and the unification algorithm, based on the information extracted from their clusters, will be explained and the results discussed.

Enhancing Empirical Research for Linguistically Motivated Precision Grammars

The distinction between abstract syntax and concrete syntax is fundamental in gf and is used to define sets of tree structures.

Time Travel in Grammar Engineering. Using a Metagrammar to Broaden the Search Space

This paper presents a metagrammar-based methodology for maintaining alternative analyses over time, and describes climb, a methodology that implements this idea for hpsg grammars in tdl.

Computational linguistics and grammar engineering

We discuss the relevance of HPSG for computational linguistics, and the relevance of computational linguistics for HPSG, including: the theoretical and computational infrastructure required to carry

Chapter 25 Computational linguistics and grammar engineering

We discuss the relevance of HPSG for computational linguistics, and the relevance of computational linguistics for HPSG, including: the theoretical and computational infrastructure required to carry

1 Personal Details



Modular Grammar Engineering in GF

The goal is to make it possible for linguistically untrained programmers to write linguistically correct application grammars encoding the semantics of special domains, and the type system of GF guarantees that grammaticality is preserved.

Implementing typed feature structure grammars

This book covers the basics of grammar development by introducing different frameworks to the reader such as categorial grammar and Head-Driven Phrase Structure Grammar, and demonstrates how these can be implemented.

Extensible dependency grammar: a modular grammar formalism based on multigraph description

This thesis develops Extensible Dependency Grammar (XDG), a new grammar formalism combining dependency grammar, model-theoretic syntax, and Jackendoff’s parallel grammar architecture. The design of

Modular Unification-based Parsers

This work presents an implementation of the notion of modularity and composition applied to unification based grammars, which can be decomposed into sub-grammars with well defined interfaces at runtime.

Partially Specified Signatures: A Vehicle for Grammar Modularity

This work provides the essential foundations for modular construction of (typed) unification grammars for natural languages by introducing a definition of signature modules and showing how two modules combine.

Collaborative language engineering : a case study in efficient grammar-based processing

This volume provides an update on the development and application of broad-coverage declarative Grammars built on sound linguistic foundations and presents several aspects of international research efforts to produce comprehensive, re-usable grammars and efficient technology for parsing and generating with such grammARS.

Modularizing Codescriptive Grammars for Efficient Parsing

This paper presents an approach to a modular use of codescriptions on the syntactic and semantic level, and describes the partitioning of grammatical information for the parsers and presents results about the performance.

Modular logic programming

The modular framework defined here for logic programming consists of a small number of operations over modules which are (meta-) logically defined and semantically justified in terms of the basic logic programming semantics.

Modular Context-Free Grammars

This paper discusses alternative approaches for defining the denotation of a grammar, culminating in one which is shown to be both compositional and fully-abstract, and shows how grammar modules can be defined such that their semantics retains these desirable properties.

The Feature Space in Parallel Grammar Writing

The methodology and tools applied in the Parallel Grammar project (ParGram) to support consistency and parallelism of linguistic representations across multilingual Lexical Functional Grammar (lfg) grammars are discussed.