Sciweavers

36 search results - page 2 / 8
» Grammar Factorization by Tree Decomposition
Sort
View
ACL
2004
13 years 7 months ago
Wrapping of Trees
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
James Rogers
FLAIRS
2006
13 years 7 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 22 days ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
NAACL
2010
13 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
JMLR
2010
108views more  JMLR 2010»
13 years 1 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...