The Design Principles and Algorithms  of a General Weighted Grammar Library

The Design Principles and Algorithms of a General Weighted Grammar Library

Cached

Download Links

by Cyril Allauzen , Mehryar Mohri , Brian Roark

BibTeX

@MISC{Allauzen_thedesign,
    author = {Cyril Allauzen and Mehryar Mohri and Brian Roark},
    title = {The Design Principles and Algorithms of a General Weighted Grammar Library},
    year = {}
}

Bookmark

OpenURL

Abstract

We present the software design principles, algorithms, and utilities of a general weighted grammar library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. Several of the algorithms and utilities of this library are described, including in some cases their pseudocodes and pointers to their use in applications. The algorithms and the utilities were designed to support a wide variety of semirings and the representation and use of large grammars and automata of several hundred million rules or transitions.

Citations

1654	B.: Building a large annotated corpus of english: The Penn treebank - Marcus, Marcinkiewicz, et al. - 1993
1548	BConditional random fields: Probabilistic models for segmenting and labeling sequence data - Lafferty, McCallum, et al.
598	Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge Univ - Durbin, Eddy, et al. - 2000
574	Estimation of probabilities from sparse data for the language model component of a speech recognizer - Katz - 1987
546	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
540	Class-based n-gram models of natural language - Brown, Pietra, et al. - 1992
449	M.J.: Efficient string matching: An aid to bibliographic search - Aho, Corasick - 1975
449	SRILM – an extensible language modeling toolkit - Stolcke - 2002
336	F: Shallow parsing with conditional random fields - Sha, Pereira
179	Improved backing-off for m-gram language modeling - Kneser, Ney - 1995
116	Early results for named entity recognition with conditional random fields, feature induction and web-enhanced lexicons - McCallum, Li - 2003
88	The smallest automaton recognizing the subwords of a text - Blumer, Blumer, et al. - 1985
88	Entropy-based pruning of backoff language models - Stolcke - 1998
83	Speeding up two string matching algorithms - Crochemore, Czumaj, et al. - 1994
82	Transductions and repetitions - Crochemore - 1986
82	The design principles of a weighted finite-state transducer library - Mohri, Pereira, et al. - 2000
57	Completed Inverted Files for Efficient Text Retrieval and Analysis - Blumer
51	Semiring frameworks and algorithms for shortest-distance problems - Mohri
51	Scalable backoff language models - Seymore, Rosenfeld - 1996
47	Weighted FiniteState Transducers - Mohri, Pereira, et al. - 2002
41	Discriminative language modeling with conditional random fields and the perceptron algorithm - Roark, Saraclar, et al. - 2004
24	Integrated context-dependent networks in very large vocabulary speech recognition - Mohri, Riley - 1999
16	Network optimizations for large vocabulary speech recognition - Mohri, Riley - 1999
14	Efficient experimental string matching by weak factor recognition - Allauzen, Crochemore, et al.
14	Syntactic analysis by local grammars automata: an efficient algorithm - Mohri - 1994
14	On Structuring Probabilistic Dependencies - Ney, Essen, et al. - 1994
11	Generalized algorithms for constructing language models - Allauzen, Mohri, et al. - 2003
8	Partial algorithm problems for context free languages - Ullian - 1967
6	String matching with automata - Mohri - 1997
4	Simple optimal string matching - Allauzen, Raffinot
4	Distribution Kernels Based on Moments of Counts - Cortes, Mohri - 2004
3	Robustness in Language and Speech Technology, chapter Regular Approximation of Context-Free Grammars through Transformation - Mohri, Nederhof - 2001