An Abstract Machine for Unification Grammars
<|reference_start|>An Abstract Machine for Unification Grammars: This work describes the design and implementation of an abstract machine, Amalia, for the linguistic formalism ALE, which is based on typed feature structures. This formalism is one of the most widely accepted in computational linguistics and has been used for designing grammars in various linguistic theories, most notably HPSG. Amalia is composed of data structures and a set of instructions, augmented by a compiler from the grammatical formalism to the abstract instructions, and a (portable) interpreter of the abstract instructions. The effect of each instruction is defined using a low-level language that can be executed on ordinary hardware.   The advantages of the abstract machine approach are twofold. From a theoretical point of view, the abstract machine gives a well-defined operational semantics to the grammatical formalism. This ensures that grammars specified using our system are endowed with well defined meaning. It enables, for example, to formally verify the correctness of a compiler for HPSG, given an independent definition. From a practical point of view, Amalia is the first system that employs a direct compilation scheme for unification grammars that are based on typed feature structures. The use of amalia results in a much improved performance over existing systems.   In order to test the machine on a realistic application, we have developed a small-scale, HPSG-based grammar for a fragment of the Hebrew language, using Amalia as the development platform. This is the first application of HPSG to a Semitic language.<|reference_end|>
@article{wintner1997an,
    title={An Abstract Machine for Unification Grammars},
    author={Shuly Wintner (Department of Computer Science, the Technion, Haifa,
  Israel)},
    journal={arXiv preprint arXiv:cmp-lg/9709013},
    year={1997},
    archivePrefix={arXiv},
    eprint={cmp-lg/9709013},
    primaryClass={cmp-lg cs.CL}
}