Abstract Machine for Typed Feature Structures

TL;DR

This paper introduces an abstract machine tailored for typed feature structures in linguistic formalisms like HPSG, detailing its design, compilation, and implementation to facilitate efficient parsing and unification.

Contribution

It presents a novel abstract machine architecture and compilation method for typed feature structures, enhancing the operational semantics of linguistic formalisms.

Findings

Supports unification of cyclic feature structures

Enables efficient parsing of phrase structure grammars

Provides a formal operational semantics for typed feature structures

Abstract

This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level language to the abstract machine language and the implementation of the abstract instructions. The machine's engine supports the unification of typed, possibly cyclic, feature structures. A separate module deals with control structures and instructions to accommodate parsing for phrase structure grammars. We treat the linguistic formalism as a high-level declarative programming language, applying methods that were proved useful in computer science to the study of natural languages: a grammar specified using the formalism is endowed with an operational semantics.