A finite-state parser for use in speech recognition

Authors:
Kenneth W. Church
Affiliations:
NE43--307, Massachusetts Institute of Technology, Cambridge, MA.
Venue:
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Year:
1983

Citing 6
Cited 2

Preliminary analysis of a breadth-first parsing algorithm: theoretical and experimental results

Natural language parsing systems
An efficient context-free parsing algorithm

Communications of the ACM
Transition network grammars for natural language analysis

Communications of the ACM
How features resolve syntactic ambiguity

SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING

ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
Phrase structure trees bear more fruit than you would have thought

Computational Linguistics

On the mathematical properties of linguistic theories

Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Dynamic compilation of weighted context-free grammars

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is divided into two parts. The first section motivates the application of finite-state parsing techniques at the phonetic level in order to exploit certain classes of contextual constraints. In the second section, the parsing framework is extended in order to account for 'feature spreading' (e.g., agreement and co-articulation) in a natural way.