Sciweavers

159 search results - page 11 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
ACL
2001
15 years 7 months ago
Grammars for Local and Long Dependencies
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicit...
Alexander Ja. Dikovsky
ACL
1997
15 years 7 months ago
Generative Power of CCGs with Generalized Type-Raised Categories
This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to ...
Nobo Komagata
ACL
1994
15 years 7 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow
DIS
1998
Springer
15 years 10 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil