• Corpus ID: 15422931

Algebraic Foundation of Statistical Parsing Semiring Parsing

@inproceedings{Liu2004AlgebraicFO,
  title={Algebraic Foundation of Statistical Parsing Semiring Parsing},
  author={Yudong Liu},
  year={2004}
}
Statistical parsing algorithms are useful in structure predictions, ranging from NLP to biological sequence analysis. Currently, there are a variety of efficient parsing algorithms available for different grammar formalisms. Conventionally, different parsing descriptions are needed for different tasks; a fair amount of work is required to construct for each one. Semiring parsing is proposed to provide a generalized and modularized framework to unify all these different parsing algorithms into a… 
Symbolic and automatic differentiation of languages
TLDR
Type theory gives us languages as type-level predicates over strings, and despite the inductive and coinductive nature of regular expressions and tries respectively, the authors need neither inductive nor coinduction/bisimulation arguments to prove algebraic properties.
Generalized Convolution and Efficient Language Recognition
TLDR
This paper formulates convolution in the common algebraic framework of semirings and semimodules and populates that framework with various representation types, one of which is the grand abstract template and itself generalizes to the free Semimodule monad.

References

SHOWING 1-10 OF 83 REFERENCES
Maximum entropy estimation for feature forests
An algorithm is proposed for maximum entropy modeling. It enables probabilistic modeling of complete structures, such as transition sequences in Markov models and parse trees, without dividing them
Dynamic programming for parsing and estimation of stochastic unification-based grammars
TLDR
A graph-based dynamic programming algorithm for calculating statistics from the packed UBG parse representations of Maxwell and Kaplan (1995) which does not require enumerating all parses.
Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm
TLDR
Knuth's generalization of Dijkstra's algorithm for the shortest-path problem offers a general method to solve this problem and is modular in the sense that Knuth's algorithm is formulated independently from the weighted deduction system.
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambiguation process that
Range Concatenation Grammars
TLDR
Range Concatenation Grammars are more powerful than Linear Context-Free Rewriting Systems though this power is not reached to the detriment of efficiency since its sentences can always be parsed in polynomial time.
An O(n^3) Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars
TLDR
The presented Viterbi (best parse) algorithm is extended to an inside (total probability) algorithm, and its correctness and advantages over prior work are shown.
A Generalization of Dijkstra's Algorithm
  • D. Knuth
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1977
Parsing Theory - Volume I: Languages and Parsing
Transductions and context-free languages
  • J. Berstel
  • Computer Science
    Teubner Studienbücher : Informatik
  • 1979
...
...