Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-19T15:38:12.496Z Has data issue: false hasContentIssue false
  • English
  • Français

A parser from antiquity

Published online by Cambridge University Press:  01 December 1996

ARAVIND K. JOSHI  and
PHIL HOPELY
ARAVIND K. JOSHI
Affiliation:
Department of Computer and Information Science and Institute for Research in Cognitive Science, Room 555 Moore School, University of Pennsylvania, Philadelphia, Pa 19104, USA. e-mail: [email protected], [email protected]
PHIL HOPELY
Affiliation:
Department of Computer and Information Science and Institute for Research in Cognitive Science, Room 555 Moore School, University of Pennsylvania, Philadelphia, Pa 19104, USA. e-mail: [email protected], [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper describes the key aspects of a parser developed at the University of Pennsylvania from 1958 to 1959. The parser is essentially a cascade of finite state transducers. To the best of our knowledge, this is the first application of finite state transducers to parsing. This parser was recently faithfully reconstructed from the original documentation. Many aspects of this program have a close relationship to some of the recent work on finite state transducers.

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 291 - 294
Copyright
1997 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.)