Sciweavers

2475 search results - page 117 / 495
» On the accuracy of language trees
Sort
View
LICS
2010
IEEE
15 years 4 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
CSLP
2004
Springer
15 years 11 months ago
Parsing Unrestricted German Text with Defeasible Constraints
We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, def...
Kilian A. Foth, Michael Daum, Wolfgang Menzel
EMNLP
2010
15 years 4 months ago
Self-Training with Products of Latent Variable Grammars
We study self-training with products of latent variable grammars in this paper. We show that increasing the quality of the automatically parsed data used for self-training gives h...
Zhongqiang Huang, Mary P. Harper, Slav Petrov
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 10 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
ICALP
1989
Springer
15 years 10 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano