Semiring Parsing

languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation to be used for describing parsers that compute recognition, derivation forests, Viterbi, n-best, inside values, and other values, simply by substituting the operations of different semirings. We also show how to use the same representation, interpreted differently, to compute outside values. The system can be used to describe a wide variety of parsers, including Earley's algorithm, tree adjoining grammar parsing, Graham Harrison Ruzzo parsing, and prefix value computation.

• Type: Journal
• Year: 1999
• Where: COLING
• Authors: Joshua Goodman
• Keywords: Abstract Computations, COLING 1999, Computational Linguistics, Parsers, Simple Representation