A bottom-up parser where entire operation is conducted in the letter string region

Authors:
Hiroshi Sakaki;Takashi Tanaka;Michihiko Seki
Affiliations:
Faculty of Informatics, Meisei University, Tokyo, Japan;SCC Corporation, Nakano-ku, Tokyo, Japan;Pro-log Corporation, Tokyo, Japan
Venue:
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
Year:
2007

Citing 3
Cited 0

Chart parsing and constraint programming

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A method for accelerating CFG-parsing by using dependency information

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A stochastic topological parser for German

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper treats a natural language parser of bottom-up type. The characteristics of the parser lies in that the data treated keep the shape of letter string through the entire parsing operations. Letter strings including parentheses express the partial trees generated in the course of parsing. This expression helps to avoid list expression usually used to represent trees.