Semiring parsing

Authors:
Joshua Goodman
Affiliations:
Microsoft Research
Venue:
Computational Linguistics
Year:
1999

Citing 18
Cited 45

Semirings, automata, languages

Semirings, automata, languages
Prolog and natural-language analysis

Prolog and natural-language analysis
Introduction to algorithms

Introduction to algorithms
Semirings and formal power series: their relevance to formal languages and automata

Handbook of formal languages, vol. 1
Computing abstract decorations of parse forests using dynamic programming and algebraic power series

AMiLP '95 Proceedings of the first international AMAST workshop on Algebraic methods in language processing
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm

Communications of the ACM
Context-Free Grammars: Covers, Normal Forms, and Parsing

Context-Free Grammars: Covers, Normal Forms, and Parsing
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Context-free error analysis by evaluation of algebraic power series

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Parsing inside-out

Parsing inside-out
Computation of the probability of initial substring generation by stochastic context-free grammars

Computational Linguistics
Semiring parsing

Computational Linguistics
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
How to cover a grammar

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Parsing algorithms and metrics

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Effective Bayesian inference for stochastic programs

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Weighted deductive parsing and Knuth's algorithm

Computational Linguistics
Semiring parsing

Computational Linguistics
Interleaved semantic interpretation in environment-based parsing

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Learning non-isomorphic tree mappings for machine translation

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Efficient transitive closure of sparse matrices over closed semirings

Theoretical Computer Science - Algebraic methods in language processing
Probabilistic parsing strategies

Journal of the ACM (JACM)
Statistical machine translation by parsing

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Dyna: a declarative language for implementing dynamic programs

ACLdemo '04 Proceedings of the ACL 2004 on Interactive poster and demonstration sessions
Compiling Comp Ling: practical weighted dynamic programming and the Dyna language

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Hierarchical Phrase-Based Translation

Computational Linguistics
Fast multiplication of matrices over a finitely generated semiring

Information Processing Letters
Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm

IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Semiring Lattice Parsing Applied to CYK

IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Dynamic Programming Algorithms as Products of Weighted Logic Programs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Cube summing, approximate inference with non-local features, and dynamic programming without semirings

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Translation as weighted deduction

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Dependency parsing by belief propagation

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Efficient parsing for transducer grammars

NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
First- and second-order expectation semirings with applications to minimum-risk training on translation forests

EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Joshua 2.0: a toolkit for parsing-based machine translation with syntax, semirings, discriminative training and other goodies

WMT '10 Proceedings of the Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR
N-best parsing revisited

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Incorporating content structure into text analysis applications

EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Re-structuring, re-labeling, and re-aligning for syntax-based machine translation

Computational Linguistics
Grammar factorization by tree decomposition

Computational Linguistics
Products of weighted logic programs

Theory and Practice of Logic Programming
Research and development: business into transfer information and communication technology

ADNTIIC'10 Proceedings of the First international conference on Advances in new technologies, interactive interfaces, and communicability
Dynamic programming algorithms for transition-based dependency parsers

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Binarized forest to string translation

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Integrating surprisal and uncertain-input models in online sentence comprehension: formal techniques and empirical results

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Machine translation system combination by confusion forest

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Terminal-aware synchronous binarization

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Reestimation of reified rules in semiring parsing and biparsing

SSST-5 Proceedings of the Fifth Workshop on Syntax, Semantics and Structure in Statistical Translation
Integration of a spanish-to-LSE machine translation system into an E-learning platform

UAHCI'11 Proceedings of the 6th international conference on Universal access in human-computer interaction: applications and services - Volume Part IV
Book review: parsing schemata for practical text analysis carlos gómez rodríguez (university of a coruña) london: Imperial college press (mathematics, computing, language, and life series, edited by carlos martin-vide, volume 1), 2010, xiv+275 pp; hardbound, isbn 978-1-84816-560-1, $89.00

Computational Linguistics
Exact inference for generative probabilistic non-projective dependency parsing

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Dyna: extending datalog for modern AI

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Tree parsing with synchronous tree-adjoining grammars

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Generate, test, and aggregate: a calculation-based framework for systematic parallel programming with mapreduce

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Towards probabilistic acceptors and transducers for feature structures

SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation
A generate-test-aggregate parallel programming library: systematic parallel programming for MapReduce

Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores
Mildly non-projective dependency grammar

Computational Linguistics
Recognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov models

Pattern Recognition Letters
A Generate-Test-Aggregate parallel programming library for systematic parallel programming

Parallel Computing
A global model for concept-to-text generation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We synthesize work on parsing algorithms, deductive parsing, and the theory of algebra applied to formal languages into a general system for describing parsers. Each parser performs abstract computations using the operations of a semiring. The system allows a single, 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.