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...
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...