Sciweavers

2475 search results - page 25 / 495
» On the accuracy of language trees
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 4 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
FQAS
2009
Springer
202views Database» more  FQAS 2009»
14 years 2 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese
ACTAC
2006
126views more  ACTAC 2006»
13 years 7 months ago
Named Entity Recognition for Hungarian Using Various Machine Learning Algorithms
In this paper we introduce a statistical Named Entity recognizer (NER) system for the Hungarian language. We examined three methods for identifying and disambiguating proper nouns...
Richárd Farkas, György Szarvas, Andr&a...
LATA
2009
Springer
14 years 2 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
IR
2010
13 years 6 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...