Computer Science – Computation and Language
Scientific paper
1998-04-02
Computer Science
Computation and Language
41 pages, Postscript only
Scientific paper
Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a syntactic representation of a sentence as each successive lexeme is read. A GIG rule specifies a set of parse configurations that trigger its application and an operation to perform on a matching configuration. Rules are partly context-sensitive; furthermore, they are reversible, meaning that their operations can be undone, which allows the parsing process to be nondeterministic. These two factors confer enough expressive power to the formalism for parsing natural languages.
No associations
LandOfFree
Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-121360