PARSEC: A Constraint-Based Parser for Spoken Language Processing

PARSEC1, a text-based and spoken language processing framework based on the Constraint Dependency Grammar (CDG) developed by Maruyama [26,27], is discussed. The scope of CDG is expanded to allow for the analysis of sentences containing lexically ambiguous words, to allow feature analysis in constraints, and to efficiently process multiple sentence candidates that are likely to arise in spoken language processing. The benefits of the CDG parsing approach are summarized. Additionally, the development CDG grammars using PARSEC grammar writing tools and the implementation of the PARSEC parser for word graphs is discussed. 'Parallel ARchitecture Sentence Constrainer

[1]  William A. Woods,et al.  Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[2]  Mary P. Harper,et al.  Log Time Parsing on the MasPar MP-1 , 1992, ICPP.

[3]  Mary P. Harper,et al.  PARSEC: a constraint-based framework for spoken language understanding , 1992, ICSLP.

[4]  M. Tomita,et al.  An efficient word lattice parsing algorithm for continuous speech recognition , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  James Glass,et al.  Integration of speech recognition and natural language processing in the MIT VOYAGER system , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[6]  K. Vijay-Shankar,et al.  SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS , 1985, ACL 1985.

[7]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[8]  Victor Lesser,et al.  The hearsay-II speech understanding system: a tutorial , 1990 .

[9]  Wayne H. Ward.  Understanding spontaneous speech: the Phoenix system , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[10]  Hiroshi Maruyama.  Constraint Dependency Grammar and Its Weak Generative Capacity , 1992 .

[11]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[12]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[13]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

[14]  R. Schwartz,et al.  The N-best algorithms: an efficient and exact procedure for finding the N most likely sentence hypotheses , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[15]  Hsiao-Wuen Hon,et al.  An overview of the SPHINX speech recognition system , 1990, IEEE Trans. Acoust. Speech Signal Process..

[16]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[17]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[18]  Azriel Rosenfeld,et al.  Cooperating Processes for Low-Level Vision: A Survey , 1981, Artif. Intell..

[19]  Jungyun Seo,et al.  Syntactic Graphs: A Representation for the Union of All Ambiguous Parse Trees , 1989, Comput. Linguistics.

[20]  Mary P. Harper,et al.  Semantics and constraint parsing of word graphs , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[21]  Douglas B. Paul.  An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model , 1992, HLT.

[22]  Hiroshi Maruyama,et al.  Structural Disambiguation With Constraint Propagation , 1990, ACL.

[23]  Tadao Takaoka,et al.  Lexical Ambiguity in Tree Adjoining Grammars , 1990, Inf. Process. Lett..

[24]  George R. Doddington,et al.  The ATIS Spoken Language Systems Pilot Corpus , 1990, HLT.

[25]  Mary P. Harper,et al.  Parallel parsing of spoken language , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[26]  Victor Lesser,et al.  Organization of the Hearsay II speech understanding system , 1975 .

[27]  Martin Kay,et al.  The MIND System , 1970 .

[28]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[29]  Dharma P. Agrawal,et al.  A Graph Partitioning-Based Load Balancing Strategy for a Distributed Memory Machine , 1992, ICPP.

[30]  Yves Schabes,et al.  Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars , 1991, ACL.

[31]  S. Rao Kosaraju.  Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..

[32]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[33]  J. Wolf,et al.  The HWIM speech understanding system , 1977 .

[34]  P. J. Price,et al.  Evaluation of Spoken Language Systems: the ATIS Domain , 1990, HLT.

[35]  Stephanie Seneff.  Robust parsing for spoken language systems , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[36]  R. Schwartz,et al.  A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[37]  Frederick Jelinek,et al.  Self-organizing language modeling for speech recognition , 1990 .

[38]  Daniel Chester,et al.  A Parsing Algorithm that Extends Phrases , 1980, CL.

[39]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[40]  Stephanie Sene.  Robust Parsing for Spoken Language Systems , 1992 .

[41]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[42]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[43]  Stephanie Seneff,et al.  TINA: A Natural Language System for Spoken Language Applications , 1992, Comput. Linguistics.

[44]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[45]  J. H. Wright,et al.  LR parsing of probabilistic grammars with input uncertainty for speech recognition , 1990 .

[46]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[47]  E. P. Giachin.  Automatic training of stochastic finite-state language models for speech understanding , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[48]  Aravind K. Joshi,et al.  Some Computational Properties of Tree Adjoining Grammars , 1985, Annual Meeting of the Association for Computational Linguistics.

[49]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[50]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[51]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[52]  John Makhoul,et al.  Context-dependent modeling for acoustic-phonetic recognition of continuous speech , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[53]  David S. L. Wei,et al.  An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages , 1990, SIAM J. Comput..

[54]  William C. Rounds,et al.  On the Succinctness Properties of Unordered Context-Free Grammars , 1987, ACL.