Sciweavers

367 search results - page 65 / 74
» Lexicalized Context-Free Grammars
Sort
View
ACL
2004
13 years 9 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
EMNLP
2010
13 years 6 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
SIGGRAPH
2010
ACM
14 years 28 days ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel
LREC
2010
186views Education» more  LREC 2010»
13 years 10 months ago
Bank of Russian Constructions and Valencies
The Bank of Russian Constructions and Valencies (Russian FrameBank) is an annotation project that takes as input samples from the Russian National Corpus (http://www.ruscorpora.ru...
Olga Lyashevskaya
CICLING
2009
Springer
14 years 3 months ago
The Value of Weights in Automatically Generated Text Structures
Abstract. One question that arises if we want to evolve generation techniques to accommodate Web ontologies is how to capture and expose the relevant ontology content to the user. ...
Dana Dannélls