Computing abstract decorations of parse forests using dynamic programming and algebraic power series

DOI10.1016/S0304-3975(97)00271-5zbMath0902.68112OpenAlexW1985837480MaRDI QIDQ1129128

Frédéric Tendeau

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00271-5

zbMATH Keywords

dynamic programmingsemiringparsingalgebraic power series

Mathematics Subject Classification ID

Dynamic programming (90C39) Theory of compilers and interpreters (68N20)

Related Items (2)

CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

Cites Work

• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• On limits in complete semirings
• The Logic of Typed Feature Structures
• Recognition and parsing of context-free languages in time n3
• An efficient context-free parsing algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing abstract decorations of parse forests using dynamic programming and algebraic power series