681 search results - page 124 / 137 » Parsing as Natural Deduction |
LACL
2005
Springer
15 years 3 months ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
82
Voted
SIGIR
2003
ACM
15 years 2 months ago
2003
ACM
One of the major problems in question answering (QA) is that the queries are either too brief or often do not contain most relevant terms in the target corpus. In order to overcom...
ECML
2003
Springer
15 years 2 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
AI
1998
Springer
15 years 1 months ago
1998
Springer
The evaluation of a large implemented natural language processing system involves more than its application to a common performance task. Such tasks have been used in the message u...
75
Voted
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...