3455 search results - page 494 / 691 » Generalized Game Trees |
153
click to vote
ANLP
2000
15 years 8 months ago
2000
It is generally recognized that the common nonterminal labels for syntactic constituents (NP, VP, etc.) do not exhaust the syntactic and semantic information one would like about ...
152
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 ...
183
click to vote
IIS
2000
15 years 8 months ago
2000
: This paper contains description of an knowledge discovery experiment performed in radio planning department of one of Polish celular telecom providers. The results of using vario...
191
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
179
click to vote
ACL
1989
15 years 7 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...