Abstract
This article describes a probabilistic context free grammar approximation method for unification grammars. In order to produce good results, the method is combined with an N best parsing extension to chart parsing. The first part of the paper introduces the grammar approximation method, while the second part describes details of an efficient N-best packing and unpacking scheme for chart parsing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bar-Hillel, J., M. Perles and E. Shamir. 1961 On the formal properties of simple phrase structure grammars. In Zeitschrift für Phonetik, Sprachwissenschaft and Kommunikationsforschung 14:143–172.
Brew, Chris. 1995 Stochastic HPSG. In Proceedings of EACL-95.
Briscoe, Ted and John Carroll. 1993. Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19(1):25–59.
Eisele, Andreas. 1994 Towards probabilistic extensions of constraintbased grammars. Technical Report Deliverable 111.2.13, DYANA-2.
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., Kluwer Akademic Publishers.
Görz, 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.
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.
Kasper, Walter, Hans-Ulrich Krieger, Jörg Spilker, and Hans Weber. 1996. 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.
Magerman, D.M. and M.P. Marcus. 1991. Pearl: A probabilistic chart parser. In Proc. of the European ACL, March.
Ney, Hermann.1991. Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Transactions on Signal Processing, 39(2):336–340, February.
Ney, Hermann and Essen, Ute. 1991. On smoothing techniques for bigram-based natural language modelling. IEEE Transactions ASSP, 39:825–828, February.
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.
Paeseler, Annedore.1988. Modification of Earley's algorithm for speech recognition. NATO ASI Series Recent Advances in Speech Understanding, F46:465–472.
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, II-41–II-44.
Sheil, B.A. 1976. Observations on context-free parsing. Statistical Methods in Linguistics, 6:71–109.
Thompson, H. 1990. Best-first enumeration of paths through a lattice — An active chart parsing solution. Computer Speech and Language, 4:263–274.
Tomita, M. 1986. An efficient word lattice parsing algorithm for continuous speech recognition. ICASSP, Tokyo, 1569–1572.
Weber, Hans H. 1994a. LR-inkrementelles probabilistisches Chartparsing von Worthypothesenmengen mit Unifikationsgrammatiken: Eine enge Kopplung von Suche and Analyse. Ph.D. Thesis, Universität Hamburg, FB Informatik, Dezember.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, H., Spilker, J., Görz, G. (1997). Parsing N best trees from a word lattice. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_22
Download citation
DOI: https://doi.org/10.1007/3540634932_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63493-5
Online ISBN: 978-3-540-69582-0
eBook Packages: Springer Book Archive