Sciweavers

589 search results - page 26 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
LREC
2008
143views Education» more  LREC 2008»
14 years 11 months ago
Enriching the Venice Italian Treebank with Dependency and Grammatical Relations
In this paper we propose a rule-based approach to extract dependency and grammatical relations from the Venice Italian Treebank (VIT) (Delmonte et al., 2007) with bracketed tree s...
Sara Tonelli, Rodolfo Delmonte, Antonella Bristot
61
Voted
CATS
2008
14 years 11 months ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
Frank Ruskey, Aaron Williams
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
15 years 3 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
98
Voted
ACL
2009
14 years 7 months ago
Semantic Tagging of Web Search Queries
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
Mehdi Manshadi, Xiao Li
AI
2010
Springer
14 years 9 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel