RE: GLB types in LKB
"Dag Schmidtke" <[email protected]> Thu, 30 Sep 2004 13:34:52 +0100
| Newsgroups | gmane.comp.ai.lkb |
|---|---|
| Message-ID | <00100370C96C904FB98D8D772457E135021CCB0D@EUR-MSG-01.europe.corp.microsoft.com> |
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: [email protected] [mailto:[email protected]] On Behalf Of Nicholas Yates Sent: Wednesday, September 29, 2004 1:55 PM To: [email protected] 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