An efficient parser generator for natural language

Authors:
Masayuki Ishii;Kazuhisa Ohta;Hiroaki Saito
Affiliations:
Fujitsu Inc.;Apple Technology, Inc.;Keio University
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Year:
1994

Citing 2
Cited 2

Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

A full-scale YACC-based parallel interpreter of English

ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
PGF: A Portable Run-time Format for Type-theoretical Grammars

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed a parser generator for natural language processing. The generator named "NLyacc" accepts grammar rules written in the Yacc format. NLyacc, unlike Yacc, can handle arbitrary context-free grammars using the generalized LR parsing algorithm. The parser produced by NLyacc efficiently parses given sentences and executes semantic actions. NLyacc, which is a free and sharable software, runs on UNIX workstations and personal computers.