We introduce an efficient algorithm for mining informative combinations of attribute-values for a given task. We use informative attributevalues to enhance the input representation of data. We apply our approach to coreference resolution using a simple set of attributes like syntactic roles and string match. With the enhanced representation, a simple coreference model outperforms more complex s...

Wilson loops in the adjoint representation are evaluated on cooled lattices in SU(2) lattice gauge theory. It is found that the string tension of an adjoint Wilson loop vanishes, if the loop is evaluated in a sub-ensemble of configurations in which no center vortex links the loop. This result supports our recent proposal that the adjoint string tension, in the Casimir-scaling regime, can be att...

In this chapter we deal with various string manipulation problems which originate from the field of computational biology and musicology. These problems are: “approximate string matching with gaps”, “inference of maximal pairs in a set of strings” and “handling of weighted sequences”. We provide new upper bounds for solving these problems and for the third we propose a novel data structure, for...

In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongst others, the papers [1996],[1997], [1999a],[1998],[1999b]. In this model, a natural language string consists of a sequence of ‘instructions packages’ to construct some term in a formal representation language, the log...

Using a Laurent series representation for the (super)string one-loop free energy, an explicit form for the analytic continuation of the Laurent series beyond the critical (Hagedorn) temperature is obtained. As an additional result, a periodic structure is found in (super)string thermodynamics. A brief physical discussion about the origin and meaning of such structure is carried out. E-mail addr...

We study cocycle properties of vertex operators and present an operator representation of cocycle operators, which are attached to vertex operators to ensure the duality of amplitudes. It is shown that this analysis makes it possible to obtain the general class of consistent string theories on orbifolds. ∗ To appear in the proceedings of YITP Workshop on “Recent Developments in String and Field...

As alignment links are not given between English sentences and Abstract Meaning Representation (AMR) graphs in the AMR annotation, automatic alignment becomes indispensable for training an AMR parser. Previous studies formalize it as a string-to-string problem, and solve it in an unsupervised way. In this paper, we formalize it as a syntax-based alignment problem, and solve it in a supervised m...

This paper presents a modiication of Pollack's RAAM (Re-cursive Auto-Associative Memory), called a Recursive Hetero-Associative Memory (RHAM), and shows that it is capable of learning simple translation tasks, by building a state-space representation of each input string and unfolding it to obtain the corresponding output string. RHAM-based translators are computationally more powerful and easi...

Starting from string field theory for 2d gravity coupled to c=1 matter we analyze N-point off-shell tree amplitudes of discrete states. The amplitudes exhibit the pole structure and we use the oscillator representation to extract the residues. The residues are generated by a simple effective action. We show that the effective action can be directly deduced from a string field action in a specia...

We have obtained a general solution of evolution equations for QCD twist-2 string operators in form of expansion over complete set of orthogonal eigenfunctions of evolution kernels in coordinate-space representation. In the leading logarithmic approximation the eigenfunctions can be determined using constraints imposed by conformal symmetry. Explicit formulae for the LO scale-dependence of quar...