A Compiler for Natural SemanticsMikael

P-PATR: A Compiler for Unification-Based Grammars

Compiling Comp Ling Practical weighted dynamic programming and the Dyna language

Weighted deduction with aggregation is a powerful theoretical formalism that encompasses many NLP algorithms. This paper proposes a declarative specification language, Dyna; gives general agenda-based algorithms for computing weights and gradients; briefly discusses Dyna-to-Dyna program transformations; and shows that a first implementation of a Dyna-to-C++ compiler produces code that is effici...

An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay (1994) have argued, regular expressions are the appropriate level of abstraction for thinking about finite-state languages and finite-state relations. More complex finite-state operations (such as contexted replacement) are defined on the basis of more basic operations (such as Kleen...

A C Cross-Compiler for Numerically Intensive Computing on Scalable Parallel Architectures

Computational problems in natural science and engineering are characterized by the application of local functions to large and homogeneous data structures. In this paper we give a technical description of a two stage cross-compiler which supports the two major computational models of scientiic computing, the master-slave and the farmer-worker model. Starting from a sequential C-type speciicatio...

Application Driven Software Methodology for Automatic Compiler Generation

Software tools were created in order to ease the compiler generation task. But the demand for new programming languages and thus for new compilers grows with the domain of computer applications. The new approaches for language design and compiler implementation, such as those spawned by the domain specific languages, rely on programming and are not easily followed by problem experts. On the oth...