Sciweavers

367 search results - page 2 / 74
» Lexicalized Context-Free Grammars
Sort
View
ACL
1990
13 years 7 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
ECML
2000
Springer
13 years 10 months ago
Learning Context-Free Grammars with a Simplicity Bias
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
Pat Langley, Sean Stromsten
WIA
2007
Springer
14 years 11 days ago
Analyzing Ambiguity of Context-Free Grammars
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
Claus Brabrand, Robert Giegerich, Anders Mø...
DLT
2009
13 years 4 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
ACL
2010
13 years 4 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...