Compiling Unification-Based Finite-State Automata into Machine Instructions for a Superscalar Pipelined RISC Processor

Abstract

This thesis is about a method for speeding up natural-language analysis using a novel compilation technique. As its input, the compiler takes a unification-based linguistic formalism (non-deterministic finite-state automata, where transitions are labeled by attribute-value matrices according to a finite type logic with a simple-inheritance type hierarchy… (More)

Topics

25 Figures and Tables

Slides referencing similar topics