Sciweavers

ACL
2010
13 years 9 months ago
Authorship Attribution Using Probabilistic Context-Free Grammars
In this paper, we present a novel approach for authorship attribution, the task of identifying the author of a document, using probabilistic context-free grammars. Our approach in...
Sindhu Raghavan, Adriana Kovashka, Raymond J. Moon...
ACL
2010
13 years 9 months ago
Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
Shay B. Cohen, Noah A. Smith
EACL
1993
ACL Anthology
14 years 23 days ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
Josée S. Heemskerk
EMNLP
2007
14 years 27 days ago
Recovery of Empty Nodes in Parse Structures
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
Denis Filimonov, Mary P. Harper
ICGI
1994
Springer
14 years 3 months ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih
IBPRIA
2003
Springer
14 years 4 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...