Main Article Content
Abstract
The main problem of difficulties in natural language processing is ambiguity. Almost
in all level of natural language processing there are ambiguities, including in syntax level.
LR-Parser is an efficient method that often be used in developing a programming language
compiler for parsing, but unfortunately it can not be used for parsing natural language
processing because it can not handle the ambiguity. This paper uses Generalized-LR Parsing,
a modified-LR-Parsing method that can handle ambiguity, for parsing a sentence in Bahasa
Indonesia. Generalized-LR Parsing use a graph-structured stack to cope the ambigutiy
problem. It can successfully produce all parsing-trees for an ambiguous sentence in Bahasa
Indonesia.
Keywords: natural language processing, syntax analysis, ambiguity, Generalized LRParsing,
parsing-tree
in all level of natural language processing there are ambiguities, including in syntax level.
LR-Parser is an efficient method that often be used in developing a programming language
compiler for parsing, but unfortunately it can not be used for parsing natural language
processing because it can not handle the ambiguity. This paper uses Generalized-LR Parsing,
a modified-LR-Parsing method that can handle ambiguity, for parsing a sentence in Bahasa
Indonesia. Generalized-LR Parsing use a graph-structured stack to cope the ambigutiy
problem. It can successfully produce all parsing-trees for an ambiguous sentence in Bahasa
Indonesia.
Keywords: natural language processing, syntax analysis, ambiguity, Generalized LRParsing,
parsing-tree