Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DCC
2011
IEEE
9 years 9 months ago
Tree Structure Compression with RePair
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
Markus Lohrey, Sebastian Maneth, Roy Mennicke
JMLR
2010
137views more  JMLR 2010»
9 years 9 months ago
Covariance in Unsupervised Learning of Probabilistic Grammars
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
Shay B. Cohen, Noah A. Smith
COMSIS
2010
10 years 3 days ago
VisualLISA: A visual environment to develop attribute grammars
The focus of this paper is on crafting a new visual language for attribute grammars (AGs), and on the development of the associated programming environment. We present a solution f...
Nuno Oliveira, Maria João Varanda Pereira, ...
COMSIS
2010
10 years 3 days ago
On automata and language based grammar metrics
Abstract. Grammar metrics have been introduced to measure the quality and the complexity of the formal grammars. The aim of this paper is to explore the meaning of these notions an...
Matej Crepinsek, Tomaz Kosar, Marjan Mernik, Julie...
IEEECGIV
2009
IEEE
10 years 13 days ago
General Shape Grammar Interpreter for Intelligent Designs Generations
Shape grammars play an important role in a new generation of tools for the analysis and design of products. In this work we present a general tool named Shape Grammar Interpreter (...
Tomas Trescak, Inmaculada Rodríguez, Marc E...
EMNLP
2009
10 years 15 days ago
Refining Grammars for Parsing with Hierarchical Semantic Knowledge
This paper proposes a novel method to refine the grammars in parsing by utilizing semantic knowledge from HowNet. Based on the hierarchical state-split approach, which can refine ...
Xiaojun Lin, Yang Fan, Meng Zhang, Xihong Wu, Huis...
ACL
2009
10 years 16 days ago
Bayesian Learning of a Tree Substitution Grammar
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
Matt Post, Daniel Gildea
NAACL
2010
10 years 18 days ago
Products of Random Latent Variable Grammars
We show that the automatically induced latent variable grammars of Petrov et al. (2006) vary widely in their underlying representations, depending on their EM initialization point...
Slav Petrov
EMNLP
2010
10 years 21 days ago
Hierarchical Phrase-Based Translation Grammars Extracted from Alignment Posterior Probabilities
We report on investigations into hierarchical phrase-based translation grammars based on rules extracted from posterior distributions over alignments of the parallel text. Rather ...
Adrià de Gispert, Juan Pino, William J. Byr...
ACL
2010
10 years 22 days ago
Hierarchical A* Parsing with Bridge Outside Scores
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
Adam Pauls, Dan Klein
books