Hostname: page-component-cb9f654ff-mx8w7 Total loading time: 0 Render date: 2025-08-25T11:24:53.554Z Has data issue: false hasContentIssue false
  • English
  • Français

Logical specification of regular relations for NLP

Published online by Cambridge University Press:  04 June 2003

NATHAN VAILLETTE
NATHAN VAILLETTE
Affiliation:
Department of Linguistics, Ohio State University, 222 Oxley Hall, 1712 Neil Avenue, Columbus, OH, 43210-1298, USA e-mail: nvail@ling.ohio-state.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper describes how the use of monadic second-order logic for specifying regular languages can be extended for specifying regular relations, providing a declarative description language for finite state transductions of the sort used in NLP. We discuss issues arising in the integration into an automaton toolkit of an implementation of the conversion from logic formulas to automata. The utility of the logic of regular relations is demonstrated by showing how it can be used to define the family of replacement operators in a way that lends itself to straightforward proofs of correctness.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 9 , Issue 1 , March 2003 , pp. 65 - 85
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable