[PDF] Top 20 Authorship Attribution Using Probabilistic Context Free Grammars

... We observe that the basic PCFG model and the PCFG-I model do not usually outperform the best baseline method (except for Football and Poetry, as discussed below). For Football, the basic PCFG model outperforms the best ... See full document

... The Gemini grammar consisted of 57 unification rules and a small lexicon of 216 entries which ex- panded into 425 full forms. Since the grammar al- lows for atomic disjunctions (and makes heavy use of them), we ended in ... See full document

... conversion using prob- abilistic context-free grammars ...disambiguation. Probabilistic meth- ods, however, yield the most probable analy- sis according to the training ...constructed ... See full document

... a Probabilistic Context Free Grammar, built from the sentence-level, de- lexicalized parse of source texts generated by a standard lexicalized parser, which we apply to the authorship ... See full document

... deterministic probabilistic finite-state au- tomata or context-free grammars only one path or derivation exists for any given string, so the identi- fication of the highest-weighted string is ... See full document

... input probabilistic CFG (PCFG), as shown for the special case of n-grams by (Rimon and Herz, 1991; Stolcke and Segal, 1994), or by training of the FA on a corpus generated by the PCFG (Jurafsky et ... See full document

... Probabilistic context-free grammars are able to de- scribe hierarchical, tree-shaped structures underly- ing sentences, and are widely used in statistical nat- ural language processing; see ... See full document

... parsing to go from abutting below the ~eftmost bottom edge of a domino to the next bottom edge at least one input must be matched against, so as there is only a finite number of input sy[r] ... See full document

... for probabilistic synchronous context-free grammars (Nederhof and Satta, ...chronous context-free grammar can be expressed in terms of a restricted type of ...synchronous ... See full document

... a probabilistic grammar ...induce probabilistic context-free gram- mars (PCFG) from natural language data through direct methods, such as optimizing the log like- lihood with the EM algorithm ... See full document

... The assignment of probabilities to the productions of a context-free grammar may generate an improper distribution: the probability of all finite parse trees is less than one.. The condi[r] ... See full document

... We present a method, called the relative weighted frequency method, to assign production probabilities that impose proper PCFG distributions on finite parses.. We demonstrate that these [r] ... See full document

... provide probabilistic context-free grammars with the consistency ...a probabilistic context- free grammar estimated by maximizing the likeli- hood of a sample of parse ... See full document

... for probabilistic context-free gram- mars but that has never been investigated in the con- text of PSCFGs, ...a probabilistic context-free grammar, this problem is defined as ... See full document

... weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (PCFGs), where the ... See full document

... Authorship Attribution (AA), the task of identifying the au- thor of an anonymous text, has a long history and various methods dealing with this task have been proposed (Sta- matatos, ... See full document

... transduction grammars (Wu, 1997), and models in the Hiero system (Chiang, ...are context- free, which is often too restrictive for practical ...adjoining grammars (STAGs) (Shieber and Sch- ... See full document

... Authorship attribution system for Malayalam transcripts based on the n-gram Model is proposed. This model uses n- grams for representing the text. N Gram Model was first used in text categorization based on ... See full document

... Object Oriented Parallel Parsing for Context Free Grammars Object Oriented Parallel Parsing for Context Free Grammars Akinori Yonezmva Ichiro Ohsawa Department of Information Science Tokyo Institute o[.] ... See full document

... the authorship of new text, assuming that it was written by one of the known authors, we consider the probability of the text being generated by each of the transition ... See full document