A statistical constraint dependency grammar (CDG) parser
Published 1 January 2004Open access
Wen Wang, Mary P. Harper
Citations35
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper describes a statistical CDG (SCDG) parser that performs parsing incrementally and evaluates it on the Wall Street Journal Penn Treebank to achieve a parsing accuracy comparable to several state-of-the-art context-free grammar (CFG) based statistical parsers using a dependency-based evaluation metric.
Abstract
CDG represents a sentence's grammatical structure as assignments of dependency relations to functional variables associated with each word in the sentence.In this paper, we describe a statistical CDG (SCDG) parser that performs parsing incrementally and evaluate it on the Wall Street Journal Penn Treebank.Using a tight integration of multiple knowledge sources, together with distance modeling and synergistic dependencies, this parser achieves a parsing accuracy comparable to several state-of-the-art context-free grammar (CFG) based statistical parsers using a dependency-based evaluation metric.Factors contributing to the SCDG parser's performance are analyzed.
Keywords
Computer Science
Journal of the American Statistical AssociationStatistical Methods for Speech Recognition
1,988 Citations1999Don X. Sun, Frederick Jelinek
The speech recognition problem hidden Markov models the acoustic model basic language modelling the Viterbi search hypothesis search on a tree and the fast match elements of information theory.
Computational LinguisticsHead-Driven Statistical Models for Natural Language Parsing
1,860 Citations2003Michael Collins
Three statistical models for natural language parsing are described, leading to approaches in which a parse tree is represented as the sequence of decisions corresponding to a head-centered, top-down derivation of the tree.
A maximum-entropy-inspired parser
1,496 Citations2000Eugene Charniak
A new parser for parsing down to Penn tree-bank style parse trees that achieves 90.1% average precision/recall for sentences of length 40 and less and 89.5% when trained and tested on the previously established sections of the Wall Street Journal treebank is presented.
Statistical parsing with a context-free grammar and word statistics
535 Citations1997Eugene Charniak
A parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence that outperforms previous schemes is described.
Statistical decision-tree models for parsing
533 Citations1995David M. Magerman
SPATTER is described, a statistical parser based on decision-tree learning techniques which constructs a complete parse for every sentence and achieves accuracy rates far better than any published result.
Computational LinguisticsProbabilistic Top-Down Parsing and Language Modeling
339 Citations2001Brian Roark
A lexicalized probabilistic top-down parser is presented, which performs very well, in terms of both the accuracy of returned parses and the efficiency with which they are found, relative to the best broad-coverage statistical parsers.
Immediate-head parsing for language models
299 Citations2001Eugene Charniak
It is suggested that improvement of the underlying parser should significantly improve the model's perplexity and that even in the near term there is a lot of potential for improvement in immediate-head language models.
Machine LearningLearning to Parse Natural Language with Maximum Entropy Models
245 Citations1999Adwait Ratnaparkhi
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.
Natural Language EngineeringA dependency-based method for evaluating broad-coverage parsers
125 Citations1998Dekang Lin
A dependency-based method for evaluating broad-coverage parsers that offers more meaningful performance measures than previous approaches is proposed and a structural pattern-matching mechanism is presented that can be used to eliminate inconsequential differences among different parse trees.
The SuperARV language model
57 Citations2002Wen Wang, Mary P. Harper
It is found that although each knowledge source contributes to language model quality, lexical features are an outstanding contributor when they are tightly integrated with word identity and syntactic constraints.
arXiv (Cornell University)An Empirical Comparison of Probability Models for Dependency Grammar
54 Citations1997Jason Eisner
The present paper describes some details of the experiments and repeats them with a larger training set of 25,000 sentences, finding that the parser of Collins (1996), when combined with a highlytrained tagger, also achieves 93% when trained and tested on the same sentences.
A study on richer syntactic dependencies for structured language modeling
46 Citations2001Peng Xu, Ciprian Chelba +1 more
Analysis of parsing performance shows correlation between the quality of the parser and the language model performance (PPL and WER) and the enriched SLM outperforms the baseline 3-gram model in terms of WER when used in isolation as a second pass (N-best re-scoring) language model.
The use of a linguistically motivated language model in conversational speech recognition
40 Citations2004Wang Wen, Andreas Stolcke +1 more
A linguistically motivated and computationally efficient almost-parsing language model is developed, using a data structure derived from constraint dependency grammar parsing, that tightly integrates knowledge of words, lexical features, and syntactic constraints in all stages of a complex, multi-pass conversational telephone speech recognition system.
Computer Speech & LanguageExtensions to constraint dependency parsing for spoken language processing
32 Citations1995Mary P. Harper, Randall A. Helzerman
A text-based and spoken language processing framework based on the constraint dependency grammar (CDG) developed by Maruyama is discussed and the development of CDG grammars using the authors' grammar tools and parser is discussed.
2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).The robustness of an almost-parsing language model given errorful training data
9 Citations2003Wen Wang, Mary P. Harper +1 more
The robustness of the almost-parsing language model to possibly inconsistent and flawed training data is investigated as well as its ability to scale up to sophisticated LVCSR tasks by comparing performance on the DARPA WSJ and Hub4 (Broadcast News) CSR tasks.
Purdue e-Pubs (Purdue University)Statistical parsing and language modeling based on constraint dependency grammar
9 Citations2003Wen Wang, Mary P. Harper
The almost-parsing LM uses a data structure derived from CDG parses called a SuperARV that tightly integrates knowledge of words, lexical features, and syntactic constraints, achieving performance competitive to state-of-the-art parser-based LMs with a significantly lower time complexity.
Language modeling using a statistical dependency grammar parser
6 Citations2004Wen Wang, Mary Harper
This LM, when used to rescore lattices from the Wall Street Journal continuous speech recognition task, obtains a significant reduction in word error rate (WER) compared to a CDG-based almost-parsing LM and obtaining a WER comparable to or lower than several state-of-the-art parser-based LM.
Approaches for Learning Constraint Dependency Grammar from Corpora
3 Citations2001Mary P. Harper, W. Wang +1 more
Two methods of learning constraint de- pendency grammars from corpora are evaluated: one uses the sentences directly and the other uses subgrammar expanded sentences, which dramatically improves the grammar learning rate and generality.