Sciweavers

2475 search results - page 29 / 495
» On the accuracy of language trees
Sort
View
NIPS
2004
13 years 9 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek
ACL
2009
13 years 5 months ago
Composite Kernels For Relation Extraction
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
Frank Reichartz, Hannes Korte, Gerhard Paass
CSL
2008
Springer
13 years 9 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
IJFCS
2010
60views more  IJFCS 2010»
13 years 6 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ï...
Andreas Maletti, Catalin Ionut Tîrnauca
CSR
2007
Springer
14 years 1 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur