research product . 2004

Sistem Penganalisis Sintaks Otomatis Dengan Metode Generalized-LR Parsing

Rila Mandala; Antonius Sigit; Rinaldi Munir; Harlili Harlili;
Open Access Indonesian
  • Published: 01 Jan 2004
  • Publisher: Islamic University of Indonesia
  • Country: Indonesia
Abstract
The main problem of difficulties in natural language processing is ambiguity. Almostin 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 languagecompiler for parsing, but unfortunately it can not be used for parsing natural languageprocessing 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 BahasaIndonesia. Generalized-LR Parsing use a graph-structured stack to cope the ambigutiyproblem. It can successfully produce all parsing-trees for an ambiguous sentence in BahasaIndonesia.
Subjects
ACM Computing Classification System: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
free text keywords: natural language processing, syntax analysis, ambiguity, Generalized LRParsing, parsing-tree, Indonesia
Related Organizations
Communities
  • Digital Humanities and Cultural Heritage
Download from
Open Access
Neliti
2004
Providers: Neliti
2 research outcomes, page 1 of 1
Any information missing or wrong?Report an Issue