Extensions to constraint dependency parsing for spoken language processing
暂无分享,去创建一个
[1] Aravind K. Joshi,et al. Mathematical and computational aspects of lexicalized grammars , 1990 .
[2] Mary P. Harper,et al. PARSEC: A Constraint-Based Parser for Spoken Language Processing , 1993 .
[3] 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.
[4] Walter L. Ruzzo,et al. An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..
[5] Daniel Chester,et al. A Parsing Algorithm that Extends Phrases , 1980, CL.
[6] Wayne H. Ward. Understanding spontaneous speech: the Phoenix system , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.
[7] Stephanie Seneff. Robust parsing for spoken language systems , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[8] Hsiao-Wuen Hon,et al. An overview of the SPHINX speech recognition system , 1990, IEEE Trans. Acoust. Speech Signal Process..
[9] Mary P. Harper,et al. Semantics and constraint parsing of word graphs , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[10] Jungyun Seo,et al. Syntactic Graphs: A Representation for the Union of All Ambiguous Parse Trees , 1989, Comput. Linguistics.
[11] J. H. Wright,et al. LR parsing of probabilistic grammars with input uncertainty for speech recognition , 1990 .
[12] Victor Lesser,et al. Organization of the Hearsay II speech understanding system , 1975 .
[13] David J. Weir,et al. Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.
[14] Hiroshi Maruyama,et al. Structural Disambiguation With Constraint Propagation , 1990, ACL.
[15] Tadao Takaoka,et al. Lexical Ambiguity in Tree Adjoining Grammars , 1990, Inf. Process. Lett..
[16] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .
[17] Masaru Tonlita,et al. An Efficient Word Lattice Parsing Algorithm for Continuous Speech Recognition , 1986 .
[18] 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.
[19] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[20] Aaron E. Rosenberg,et al. Improved acoustic modeling for large vocabulary continuous speech recognition , 1992 .
[21] S. Rao Kosaraju. Speed of Recognition of Context-Free Languages by Array Automata , 1975, SIAM J. Comput..
[22] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[23] Boon-Lock Yeo,et al. Implementation issues in the development of the parsec parser , 1995, Softw. Pract. Exp..
[24] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[25] Aravind K. Joshi,et al. Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..
[26] 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..
[27] 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.
[28] Mary P. Harper,et al. PARSEC: a constraint-based framework for spoken language understanding , 1992, ICSLP.
[29] Douglas B. Paul. An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model , 1992, HLT.
[30] Martin Kay,et al. The MIND System , 1970 .
[31] Aravind K. Joshi,et al. Some Computational Properties of Tree Adjoining Grammars , 1985, Annual Meeting of the Association for Computational Linguistics.
[32] Mary P. Harper,et al. An Approach to Multiply Segmented Constraint Satisfaction Problems , 1994, AAAI.
[33] Mary P. Harper,et al. Log Time Parsing on the MasPar MP-1 , 1992, ICPP.
[34] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.
[35] K. Vijay-Shankar,et al. SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS , 1985, ACL 1985.
[36] Victor Lesser,et al. The hearsay-II speech understanding system: a tutorial , 1990 .
[37] Hiroshi Maruyama. Constraint Dependency Grammar and Its Weak Generative Capacity , 1992 .
[38] 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.
[39] Douglas B. Paul,et al. An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model , 1992, HLT.
[40] J. Cleary,et al. \self-organized Language Modeling for Speech Recognition". In , 1997 .
[41] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .
[42] 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.
[43] Ronald M. Kaplan,et al. The Interface between Phrasal and Functional Constraints , 1993, CL.
[44] David L. Waltz,et al. Understanding Line drawings of Scenes with Shadows , 1975 .
[45] Stephanie Seneff,et al. TINA: A Natural Language System for Spoken Language Applications , 1992, Comput. Linguistics.
[46] J. Wolf,et al. The HWIM speech understanding system , 1977 .
[47] George R. Doddington,et al. The ATIS Spoken Language Systems Pilot Corpus , 1990, HLT.
[48] P. J. Price,et al. Evaluation of Spoken Language Systems: the ATIS Domain , 1990, HLT.
[49] Yves Schabes,et al. Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars , 1991, ACL.
[50] Vipin Kumar,et al. Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..
[51] Stuart M. Shieber,et al. Constraint-based grammar formalisms , 1992 .
[52] David S. L. Wei,et al. An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages , 1990, SIAM J. Comput..
[53] William C. Rounds,et al. On the Succinctness Properties of Unordered Context-Free Grammars , 1987, ACL.