Sciweavers

2475 search results - page 63 / 495
» On the accuracy of language trees
Sort
View
EACL
2003
ACL Anthology
13 years 11 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren
IEICET
2008
67views more  IEICET 2008»
13 years 10 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
LATA
2009
Springer
14 years 4 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
ACTA
2010
191views more  ACTA 2010»
13 years 10 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
DKE
2000
97views more  DKE 2000»
13 years 10 months ago
Adaptive natural language interfaces to FAQ knowledge bases
In this paper we present a natural language interface architecture, which is used for accessing FAQ knowledge bases. Since one of the main obstacles to the efficient use of natura...
Werner Winiwarter