Sciweavers

522 search results - page 4 / 105
» Automating grammar comparison
Sort
View
EMNLP
2010
13 years 9 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
TOOLS
1992
IEEE
14 years 2 months ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden
CEC
2010
IEEE
14 years 1 hour ago
Tree-adjunct grammatical evolution
In this paper we investigate the application of tree-adjunct grammars to grammatical evolution. The standard type of grammar used by grammatical evolution, context-free grammars, p...
Eoin Murphy, Michael O'Neill, Edgar Galván ...
LPAR
2007
Springer
14 years 5 months ago
On Two Extensions of Abstract Categorial Grammars
Categorial Grammars Philippe de Groote, Sarah Maarek, Ryo Yoshinaka On Two Extensions of ACGs – p.1/45
Philippe de Groote, Sarah Maarek, Ryo Yoshinaka
PLILP
1992
Springer
14 years 2 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl