Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T08:56:12.077Z Has data issue: false hasContentIssue false
  • English
  • Français

The LiLFeS Abstract Machine and its evaluation with the LinGO grammar

Published online by Cambridge University Press:  02 November 2000

YUSUKE MIYAO,
TAKAKI MAKINO,
KENTARO TORISAWA and
JUN-ICHI TSUJII
YUSUKE MIYAO
Affiliation:
Department of Information Science, Graduate School of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 Japan; e-mail: {usuke,mak}@is.s.u-tokyo.ac.jp
TAKAKI MAKINO
Affiliation:
Department of Information Science, Graduate School of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 Japan; e-mail: {usuke,mak}@is.s.u-tokyo.ac.jp
KENTARO TORISAWA
Affiliation:
Department of Information Science, Graduate School of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 Japan; Information and Human Behavior, PRESTO, Japan Science and Technology Corporation, 4-1-8 Kawaguchi Hon-cho, Kawaguchi-shi, Saitama 332-0012 Japan; e-mail: torisawa@is.s.u-tokyo.ac.jp
JUN-ICHI TSUJII
Affiliation:
Department of Information Science, Graduate School of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 Japan; CCL, UMIST, P.O.Box 88, Manchester, M60 1QD, England; e-mail: tsujii@is.s.u-tokyo.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This article evaluates the efficiency of the LiLFeS abstract machine by performing parsing tasks with the LinGO English resource grammar. The instruction set of the abstract machine is optimized for efficient processing of definite clause programs and typed feature structures. LiLFeS also supports various tools required for efficient parsing (e.g. efficient copying, a built-in CFG parser) and the constructions of standard Prolog (e.g. cut, assertions, negation as failure). Several parsers and large-scale grammars, including the LinGO grammar, have been implemented in or ported to LiLFeS. Precise empirical results with the LinGO grammar are provided to allow comparison with other systems. The experimental results demonstrate the efficiency of the LiLFeS abstract machine.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 6 , Issue 1 , March 2000, pp. 47 - 61
Copyright
2000 Cambridge University Press