• 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
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.
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
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
Discriminative Reranking for Natural Language Parsing
TLDR
The boosting approach to ranking problems described in Freund et al. (1998) is applied to parsing the Wall Street Journal treebank, and it is argued that the method is an appealing alternative-in terms of both simplicity and efficiency-to work on feature selection methods within log-linear (maximum-entropy) models.
Case-factor diagrams for structured probabilistic modeling
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic context-free grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing, which results in
Learning to Parse Natural Language with Maximum Entropy Models
TLDR
A machine learning system for parsing natural language that learns from manually parsed example sentences, and parses unseen data at state-of-the-art accuracies, and it is demonstrated that the parser can train from other domains without modification to the modeling framework or the linguistic hints it uses to learn.
On discriminative approaches to statistical parsing and on statistical parsing and speech recognition
  • On discriminative approaches to statistical parsing and on statistical parsing and speech recognition
  • 2004
...
1
2
3
4
5
...