Parsing n best trees from a word lattice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1303, Issue , 1997, Pages 279-288

  Weber, Hans ^a   Spilker, Jörg ^a   Görz, Günther ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES;

APPROXIMATION METHODS; PROBABILISTIC CONTEXT FREE GRAMMARS;

ARTIFICIAL INTELLIGENCE;

EID: 38149022802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540634932_22     Document Type: Conference Paper

References (19)

1. [Bar-Hillel et al. 1991] Bar-Hillel, J., M. Perles and E. Shamir 1961 On the formal properties of simple phrase structure grammars. In Zeitschrift fur Phonetik, Sprach-wissenschaft and Kommunikationsforschung 14:143-172.
2. [Brew 1995] Brew, Chris. 1995 Stochastic HPSG. hi Proceedings of EACL-95
3. [Briscoe and Carroll 1993] Briscoe, Ted and John Carroll. 1993. Generalized proba-bilistic LR parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19(1):25-59.
4. [Eisele 1994] Eisele, Andreas. 1994 Towards probabilistic extensions of constraint-based grammars. Technical Report Deliverable R1.2.B, DYANA-2.
5. [Fujisaki et al. 1991] Fujisaki, T., F. Jelinek, J. Cocke, E. Black, and T. Nishino. 1991. A probabilistic parsing method for sentence disambiguation. In Masura Tomita, editor, Current Issues in Parsing Technology, 139-148, Norvell, Mass., Kluver Akademic Publishers.
6. [GOrz et al. 1996] Gorz, G., M. Kesseler, J. Spilker, and H. Weber. 1996. Research on Architectures for Integrated Speech/Language Systems in VERBMOBIL. In Proceedings of COLING-96, Kopenhagen, August.
7. [Hauenstein and Weber 1994] Hauenstein, A. and H. Weber. 1994. An investigation of tightly coupled time synchronous speech language interfaces using a unification grammar. In Paul McKevitt, editor, Proceedings of the Workshop on Integration of Natural Language and Speech Processing at AAAI 94, 42-49, Seattle, August.
8. [Kasper et al. 1996] Kasper, Walter, Hans-Ulrich Krieger, JOrg Spilker, and Hans Weber. From word hypotheses to logical form: An efficient interleaved approach. In D. Gibbon, editor, Natural Language Processing and Speech Technology. Results of the 3rd KONVENS Conference. Mouton de Gruyter, Berlin, 77-88.
9. [Magerman and Marcus 1991] Magerman, D.M. and M.P. Marcus. 1991. Pearl: A probabilistic chart parser. In Proc. of the European ACL, March.
10. [Ney 1991] Ney, Hermann. 1991. Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Transactions on Signal Processing, 39(2):336-340, February.
11. [Ney and Essen 1991] Ney, Hermann and Essen, Ute. 1991. On smoothing techniques for bigram-based natural language modelling. IEEE Transactions ASSP, 39:825-828, February.
12. [Noord 1994] Noord, G. van. 1994 On the Intersection of Finite State Automata and Definite Clause Grammars. Proceedings of Twente Workshop on Speech and Language Engeneering, 107-120, December.
13. [Paeseler 1988] Paeseler, Annedore. 1988. Modification of Earley's algorithm for speech recognition. NATO ASI Series: Recent Advances in Speech Understanding, F46:465-472.
14. Schmid 1994] Schmid, Ludwig. 1994. Parsing word graphs using a linguistic grammar and a statistical language model. In IEEE International Conference on Acoustics, Speech and Signal Processing
15. [Sheil 1976] Sheil, B.A. 1976. Observations on context-free parsing. Statistical Methods in Linguistics, 6:71-109.
16. [Thompson 1990] Thompson, H. 1990. Best-first enumeration of paths through a lattice — An active chart parsing solution. Computer Speech and Language, 4:263274.
17. [Tomita 1986] Tomita, M. 1986. An efficient word lattice parsing algorithm for continuous speech recognition. ICASSP, Tokyo, 1569-1572.
18. [Weber 1994a] Weber, Hans H. 1994a. LR-inkrementelles probabilistisches Chartpars-ing von Worthypothesenmengen mit Unifikationsgrammatiken: Eine enge Kopplung von Suche and Analyse. Ph.D. Thesis, Universitat Hamburg, FB Informatik, Dezember.
19. [Weber 1994b] Weber, Hans H. 1994b. Time-synchronous chart parsing of speech integrating unification grammars with statistics. Proceedings of Twente Workshop on Speech and Language Engineering, 107-120, December.