Sciweavers

675 search results - page 63 / 135
» On Compression of Parse Trees
Sort
View
VRML
2003
ACM
14 years 2 months ago
Binary compression rates for ASCII formats
Geometry compression for VRML has been an important item on the wish-list of the Web3D Consortium since 1996. It was widely understood that a binary format would be required to al...
Martin Isenburg, Jack Snoeyink
ECAI
2006
Springer
14 years 13 days ago
Semantic Tree Kernels to Classify Predicate Argument Structures
Recent work on Semantic Role Labeling (SRL) has shown that syntactic information is critical to detect and extract predicate argument structures. As syntax is expressed by means of...
Alessandro Moschitti, Bonaventura Coppola, Daniele...
ACL
2010
13 years 6 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
COLING
2002
13 years 8 months ago
A Stochastic Parser Based on an SLM with Arboreal Context Trees
In this paper, we present a parser based on a stochastic structured language model (SLM) with a exible history reference mechanism. An SLM is an alternative to an n-gram model as...
Shinsuke Mori
LICS
2008
IEEE
14 years 3 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...