Partial Evaluation for Efficient Access to Inheritance Lexicons
| dc.creator | Hartrumpf, Sven | |
| dc.date | 1998-08-25 | |
| dc.date.accessioned | 2026-07-07T02:36:21Z | |
| dc.date.available | 2026-07-07T02:36:21Z | |
| dc.description | Multiple default inheritance formalisms for lexicons have attracted much interest in recent years. I propose a new efficient method to access such lexicons. After showing two basic strategies for lookup in inheritance lexicons, a compromise is developed which combines to a large degree (from a practical point of view) the advantages of both strategies and avoids their disadvantages. The method is a kind of (off-line) partial evaluation that makes a subset of inherited information explicit before using the lexicon. I identify the parts of a lexicon which should be evaluated, and show how partial evaluation works for inheritance lexicons. Finally, the theoretical results are confirmed by a complete implementation. Speedups by a factor of 10-100 are reached. | |
| dc.description | 8 pages; uses amsfonts.sty, avm.sty, booktabs.sty, caption.sty, ranlp97.sty, and xy.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9808013 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9808013 | |
| dc.identifier | Proceedings of the 2nd International Conference on Recent Advances in Natural Language Processing (RANLP-97), pp. 43-50, Tzigov Chark, Bulgaria, September 1997. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15888 | |
| dc.subject | Computation and Language | |
| dc.title | Partial Evaluation for Efficient Access to Inheritance Lexicons | |
| dc.type | text |