Regular models of phonological rule systems

  • Authors:
  • Ronald M. Kaplan;Martin Kay

  • Affiliations:
  • Xerox Palo Alto Research Center;Stanford University

  • Venue:
  • Computational Linguistics - Special issue on computational phonology
  • Year:
  • 1994

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.