CIAA2003

START ConferenceManager

Computational Linguistic Motivations for a Finite-State Machine Hierarchy

Robert Kelly, Julie Carson-Berndsen

Presented at Eighth International Conference on Implementation and Application of Automata (CIAA 2003), July 16-18, 2003 Santa Barbara, CA, USA

Abstract

Given the prominence of finite-state techniques in natural language processing, toolkits providing finite-state capability for applications in this domain are necessary. A review of some existing toolkits is presented and a new Finite-State Machine Hierarchy is introduced. The hierarchy is an extendible object-oriented inheritance tree where each class in the hierarchy represents a particular finite-state machine. Motivated by work in computational linguistics, the hierarchy is used to deliver finite-state components to applications in this domain.