Improved syntactic models for parsing speech with repairs

Authors:
Tim Miller
Affiliations:
University of Minnesota, Twin Cities
Venue:
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Year:
2009

Citing 6
Cited 1

PCFG models of linguistic tree representations

Computational Linguistics
Efficient probabilistic top-down and left-corner parsing

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Accurate unlexicalized parsing

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A TAG-based noisy channel model of speech repairs

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
PCFGs with syntactic and prosodic indicators of speech repairs

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A syntactic time-series model for parsing fluent and disfluent speech

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1

Parsing speech repair without specialized grammar symbols

ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces three new syntactic models for representing speech with repairs. These models are developed to test the intuition that the erroneous parts of speech repairs (reparanda) are not generated or recognized as such while occurring, but only after they have been corrected. Thus, they are designed to minimize the differences in grammar rule applications between fluent and disfluent speech containing similar structure. The three models considered in this paper are also designed to isolate the mechanism of impact, by systematically exploring different variables.