Sciweavers

31 search results - page 4 / 7
» Learnability of Pregroup Grammars
Sort
View
ACL
2012
11 years 7 months ago
Discriminative Strategies to Integrate Multiword Expression Recognition and Parsing
The integration of multiword expressions in a parsing procedure has been shown to improve accuracy in an artiļ¬cial context where such expressions have been perfectly pre-identiļ...
Matthieu Constant, Anthony Sigogne, Patrick Watrin
IDA
2007
Springer
13 years 5 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ECML
2003
Springer
13 years 10 months ago
Leveraging Lexical Semantics to Infer Context-Free Grammars
Context-free grammars cannot be identiļ¬ed in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...
RIA
2006
84views more  RIA 2006»
13 years 5 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
JMLR
2010
192views more  JMLR 2010»
13 years 3 days ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater