A bottom-up parser where entire operation is conducted in the letter string region
Hiroshi Sakaki, T. Tanaka, Michihiko Seki · 2007
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. Key-Words:- parser, bottom-up, letter string, machine translation, LINGOL, C language, OR node 1