Anaphoric reference is an important linguistic phenomenon to understand the discourse structure and content. In Chinese natural language processing, there are both the problems of choosing and resolving anaphora. In Mandarin Chinese, several linguists have attempted to propose criteria to ezplain the phenomenon of anaphora but with controversial results. On the other hand, search-based computat...

For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)) where d(x, y) represents the distance between the vertices x and y. The set W is called a resolving set for G if every vertex of G has a distinct representation. A resolving set containing...

For a vertex v of a connected oriented graph D and an ordered set W = {w1, w2, . . . , wk} of vertices of D, the (directed distance) representation of v with respect to W is the ordered k-tuple r(v ∣ ∣ W ) = (d(v,w1), d(v, w2), . . . , d(v, wk)), where d(v, wi) is the directed distance from v to wi. The set W is a resolving set for D if every two distinct vertices of D have distinct representat...

In this paper we address the question of how to quickly model glyph-based GIS visualizations. Our solution is based on using shape grammars to set up the different aspects of a visualization, including the geometric content of the visualization, methods for resolving layout conflicts and interaction methods. Our approach significantly increases modeling efficiency over similarly flexible system...

If is a connected graph, the distance between two vertices G  , d u v   , u v V G  G is the length of a shortest path between them. Let be an ordered set of vertices of and let v be a vertex of . The representation  1 2 = , , , k W w w w   G   r v W of v with respect to is the -tuple W k         1 2 , , d v w  , , , k d v w d v w , . If distinct vertices of have distinct repr...

Reference resolution is a major component of any natural language system. In the past 30 years significant progress has been made in coreference resolution. However, there is more anaphora in texts than coreference. I present a computational treatment of other-anaphora, i.e., referential noun phrases (NPs) with non-pronominal heads modified by “other” or “another”: [. . . ] the move is designed...

Using the human bacterial artificial chromosome (BAC) fingerprint-based physical map, genome sequence assembly and BAC end sequences, we have generated a fingerprint-validated set of 32 855 BAC clones spanning the human genome. The clone set provides coverage for at least 98% of the human fingerprint map, 99% of the current assembled sequence and has an effective resolving power of 79 kb. We ha...

In the 2009 Recognizing Textual Entailment challenge a Search Pilot task has been introduced, aimed at finding all the sentences in a corpus which entail a set of given hypotheses. The preparation of the data set for this task has provided an opportunity to better understand some phenomena concerning textual entailment recognition in a natural setting. This paper focuses on some problematic iss...

The study aimed to shed light on the use of gesture in resolving lexical ambiguity employed by TEFL students. To this end, 60 intermediate Iranian learners, studying at Kish Way Language School in Iran were recruited. The participants were randomly put into two experimental groups and one control group. Both of the experimental groups received the same teaching approach, i.e. teaching homonyms ...