2834 search results - page 285 / 567 » Representing Trees with Constraints |
154
click to vote
ACL
2006
15 years 8 months ago
2006
We present an approach to pronoun resolution based on syntactic paths. Through a simple bootstrapping procedure, we learn the likelihood of coreference between a pronoun and a can...
175
click to vote
ACL
1998
15 years 8 months ago
1998
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
154
click to vote
COLING
2000
15 years 8 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
180
click to vote
LRE
2008
15 years 6 months ago
2008
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
196
click to vote
CN
2002
15 years 6 months ago
2002
In this paper we consider source-initiated multicast session traffic in an ad hoc wireless network, operating under hard constraints on the available transmission energy as well a...