The LiLFeS Abstract Machine and its evaluation with the LinGO grammar

  • Authors:
  • Yusuke Miyao;Takaki Makino;Kentaro Torisawa;Jun-Ichi Tsujii

  • Affiliations:
  • 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;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;Department of Information Science, Graduate School of Science, University of Tokyo, and Information and Human Behavior, PRESTO, Japan Science and Technology Corporation, Saitama 332-0012 Japan/ e- ...;Department of Information Science, Graduate School of Science, University of Tokyo, and CCL, UMIST, P.O.Box 88, Manchester, M60 1QD, England/ e-mail: tsujii@is.s.u-tokyo.ac.jp

  • Venue:
  • Natural Language Engineering
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.