Sciweavers

903 search results - page 1 / 181
» Non-well-founded trees in categories
Sort
View
APAL
2007
104views more  APAL 2007»
13 years 5 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
COLING
2000
13 years 6 months ago
Structural disambiguation of morpho-syntactic categorial parsing for Korean
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
Jeongwon Cha, Gary Geunbae Lee
ENTCS
2006
141views more  ENTCS 2006»
13 years 5 months ago
Abstract Families of Abstract Categorial Languages
Families of Categorial Languages Makoto Kanazawa 1 National Institute of Informatics Tokyo, Japan We show that the class of string languages generated by abstract categorial gramm...
Makoto Kanazawa
ACL
1990
13 years 6 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
PAMI
2008
170views more  PAMI 2008»
13 years 5 months ago
Unsupervised Category Modeling, Recognition, and Segmentation in Images
Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects from an unknown category. This paper is aimed at simultaneously solving the following rel...
Sinisa Todorovic, Narendra Ahuja