GLB types in LKB
Dag Schmidtke
dags at MICROSOFT.com
Thu Sep 30 14:34:52 CEST 2004
You could have a look at (Kiefer et al 1999), and also (Kiefer et al
2000). Both references contain essentially the same description of the
optimizations used for efficient glb calculation and lookup. I found
them useful in a recent similar exercise.
Cheers
Dag
Kiefer, B., Krieger, H., Carroll, J., Malouf, R. (1999). A bag of useful
techniques for efficient and robust parsing. In Proceedings of the 37th
Annual Meeting of the Association for Computational Linguistics, ACL 99,
473-480.
Kiefer, B., Krieger, H., Nederhof, M. (2000). Efficient and Robust
Parsing of Word Hypothesis Graphs. In Wahlster, W., (ed) (2000).
Verbmobil: Foundations of speech-to-speech translation. Springer-Verlag
Berlin Heidelberg New York: 280:295.
-----Original Message-----
From: owner-lkb-list at csli.stanford.edu
[mailto:owner-lkb-list at csli.stanford.edu] On Behalf Of Nicholas Yates
Sent: Wednesday, September 29, 2004 1:55 PM
To: lkb-list at csli.stanford.edu
Subject: GLB types in LKB
Hi,
I was wondering if someone could help me find some detailed information
of
how the automatic glbtype creation works in LKB. Is there any
publication
or stuff I could look up apart from the comments in the source code. I
would like to implement something similar in a prolog program.
Cheers,
Nicholas
More information about the lkb
mailing list