367 search results - page 3 / 74 » Lexicalized Context-Free Grammars |
82
Voted
ML
2007
ACM
14 years 11 months ago
2007
ACM
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
110
click to vote
ACL
1992
15 years 25 days ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
EACL
2009
ACL Anthology
16 years 7 days ago
2009
ACL Anthology
APLAS
2006
ACM
15 years 5 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
FLAIRS
2003
15 years 1 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...