A parser from antiquity

Authors:
Aravind K. Joshi;Phil Hopely
Affiliations:
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.c ...;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.c ...
Venue:
Natural Language Engineering
Year:
1996

Citing 2
Cited 6

Directed replacement

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Two parsing algorithms by means of finite state transducers

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

Supertagging: an approach to almost parsing

Computational Linguistics
A lightweight dependency analyzer for partial parsing

Natural Language Engineering
Finite-state multimodal parsing and understanding

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Finite-state multimodal integration and understanding

Natural Language Engineering
Fast full parsing by linear-chain conditional random fields

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Robust understanding in multimodal interfaces

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.