Sciweavers

615 search results - page 65 / 123
» Unsupervised Semantic Parsing
Sort
View
PLILP
1992
Springer
14 years 1 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
ACL
2008
13 years 11 months ago
Hypertagging: Supertagging for Surface Realization with CCG
In lexicalized grammatical formalisms, it is possible to separate lexical category assignment from the combinatory processes that make use of such categories, such as parsing and ...
Dominic Espinosa, Michael White, Dennis Mehay
DLT
2003
13 years 11 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
JOLLI
2007
88views more  JOLLI 2007»
13 years 9 months ago
Toward discourse representation via pregroup grammars
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
Anne Preller
EMNLP
2009
13 years 7 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner