Paper: University Of Durham: Description Of The LOLITA System As Used In MUC-7

ACL ID M98-1005
Title University Of Durham: Description Of The LOLITA System As Used In MUC-7
Venue Message Understanding Conference
Session Main Conference
Year 1998
Authors

This mechanism handles search through the net, use of inference rules to derive implicit facts, and general output formatting. A template contains a predefined set of slots with associated fill-in rules that direct the search for appropriate information in the net. The slot fill-in rules are predicates that check node controls, or use the inference functions available in the core. For more details see [1]. Implementation and Operating Details LOLITA is written mostly in Haskell, a non-strict functional programming language [8]. Two resource-critical sections are written in C the parsing algorithm and the SemNet data structure and its access functions. Haskell has some similarity to LISP, such as building programs by writing functions, a garbage-collected heap, lists as a basic type, and fu...