Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T22:02:46.572Z 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: joshi@linc.cis.upenn.edu, phopely@linc.cis.upenn.edu
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: joshi@linc.cis.upenn.edu, phopely@linc.cis.upenn.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 291 - 294
Copyright
1997 Cambridge University Press