MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  PARSEC: A constraint-based framework for spoken language understanding (1992) [9 citations — 9 self]

Download:
Download as a PDF | Download as a PS
by Carla B. Zoltowski, Mary P. Harper, Leah H. Jamieson, All A. Helzerman
In Proceedings of the International Conference on Spoken Language Processing
ftp://transform.ecn.purdue.edu/pub/speech/papers/icslp92_1.ps.Z
Add To MetaCart

Abstract:

We have extended Maruyama's [5, 6, 7] constraint dependency grammar (CDG) to process a lattice or graph of sentence hypotheses instead of separate text strings. A post-processor to a speech recognizer producing N-best hypotheses generates the word graph representation, which is then augmented with information required for parsing. We will summarize the CDG parsing algorithm and then describe how the algorithm is extended to process a word graph on a single processor machine.

Citations

87 Structural Disambiguation with Constraint Propagation – Maruyama - 1990
84 R.”An overview of the SPHINX speech recognition system – Lee, Hon, et al. - 1990
64 The N-Best Algorithm: An Efficient and Exact Procedure for Finding the N Most Likely Sentence Hypotheses – Schwartz, Chow - 1990
58 Tree-size bounded alternation – Ruzzo - 1980
51 A Comparison of Several Approximate Algorithms for Finding Multiple (N-Best) Sentence Hypotheses – Schwartz, Austin - 1991
33 Constraint dependency grammar – Maruyama - 1990
33 Context-Dependent Modeling for Acoustic-Phonetic Recognition of Continuous Speech – Schwartz, Chow, et al. - 1985
20 Constraint dependency grammar and its weak generative capacity – Maruyama - 1990
18 An Efficient Word Lattice Parsing Algorithm for Continuous Speech Recognition – Tomita - 1986
16 Log time parsing on the MasPar MP-1 – Helzerman, Harper - 1992
16 Speed of recognition of context-free languages by array automata – Kosaraju - 1975
6 Parallel parsing of spoken language – Helzerman, Harper, et al. - 1992