input stringlengths 37 565 | output dict | schema listlengths 0 0 |
|---|---|---|
Finally , we show that we can provide effective acquisition techniques for novel word senses using a combination of online sources . | {
"relations": {
"used for": [
{
"head": {
"text": "techniques",
"start": 60,
"end": 70
},
"tail": {
"text": "word senses",
"start": 81,
"end": 92
}
},
{
"head": {
"text": "online source... | [] |
The TIPSTER Architecture has been designed to enable a variety of different text applications to use a set of common text processing modules . | {
"relations": {
"used for": [
{
"head": {
"text": "TIPSTER Architecture",
"start": 4,
"end": 24
},
"tail": {
"text": "text applications",
"start": 76,
"end": 93
}
},
{
"head": {
"text":... | [] |
Since user interfaces work best when customized for particular applications , it is appropriator that no particular user interface styles or conventions are described in the TIPSTER Architecture specification . | {
"relations": {
"used for": [
{
"head": {
"text": "user interfaces",
"start": 6,
"end": 21
},
"tail": {
"text": "applications",
"start": 63,
"end": 75
}
}
]
}
} | [] |
However , the Computing Research Laboratory -LRB- CRL -RRB- has constructed several TIPSTER applications that use a common set of configurable Graphical User Interface -LRB- GUI -RRB- functions . | {
"relations": {
"used for": [
{
"head": {
"text": "Graphical User Interface -LRB- GUI -RRB- functions",
"start": 143,
"end": 193
},
"tail": {
"text": "TIPSTER applications",
"start": 84,
"end": 104
}
}
]
... | [] |
These GUIs were constructed using CRL 's TIPSTER User Interface Toolkit -LRB- TUIT -RRB- . | {
"relations": {
"used for": [
{
"head": {
"text": "CRL 's TIPSTER User Interface Toolkit -LRB- TUIT -RRB-",
"start": 34,
"end": 88
},
"tail": {
"text": "GUIs",
"start": 6,
"end": 10
}
}
]
}
} | [] |
TUIT is a software library that can be used to construct multilingual TIPSTER user interfaces for a set of common user tasks . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "TUIT",
"start": 0,
"end": 4
},
"tail": {
"text": "software library",
"start": 10,
"end": 26
}
}
],
"used for": [
{
"head": {
... | [] |
CRL developed TUIT to support their work to integrate TIPSTER modules for the 6 and 12 month TIPSTER II demonstrations as well as their Oleada and Temple demonstration projects . | {
"relations": {
"used for": [
{
"head": {
"text": "TUIT",
"start": 14,
"end": 18
},
"tail": {
"text": "TIPSTER modules",
"start": 54,
"end": 69
}
}
]
}
} | [] |
While such decoding is an essential underpinning , much recent work suggests that natural language interfaces will never appear cooperative or graceful unless they also incorporate numerous non-literal aspects of communication , such as robust communication procedures . | {
"relations": {
"part of": [
{
"head": {
"text": "non-literal aspects of communication",
"start": 190,
"end": 226
},
"tail": {
"text": "they",
"start": 159,
"end": 163
}
}
],
"hyponym of": [
{
... | [] |
This paper defends that view , but claims that direct imitation of human performance is not the best way to implement many of these non-literal aspects of communication ; that the new technology of powerful personal computers with integral graphics displays offers techniques superior to those of humans for these aspect... | {
"relations": {
"part of": [
{
"head": {
"text": "graphics displays",
"start": 240,
"end": 257
},
"tail": {
"text": "personal computers",
"start": 207,
"end": 225
}
}
]
}
} | [] |
This paper proposes a framework in which Lagrangian Particle Dynamics is used for the segmentation of high density crowd flows and detection of flow instabilities . | {
"relations": {
"used for": [
{
"head": {
"text": "Lagrangian Particle Dynamics",
"start": 41,
"end": 69
},
"tail": {
"text": "segmentation of high density crowd flows",
"start": 86,
"end": 126
}
},
{
... | [] |
For this purpose , a flow field generated by a moving crowd is treated as an aperiodic dynamical system . | {
"relations": {
"used for": [
{
"head": {
"text": "moving crowd",
"start": 47,
"end": 59
},
"tail": {
"text": "flow field",
"start": 21,
"end": 31
}
},
{
"head": {
"text": "aperiodic dy... | [] |
A grid of particles is overlaid on the flow field , and is advected using a numerical integration scheme . | {
"relations": {
"used for": [
{
"head": {
"text": "grid of particles",
"start": 2,
"end": 19
},
"tail": {
"text": "flow field",
"start": 39,
"end": 49
}
},
{
"head": {
"text": "numerica... | [] |
The evolution of particles through the flow is tracked using a Flow Map , whose spatial gradients are subsequently used to setup a Cauchy Green Deformation tensor for quantifying the amount by which the neighboring particles have diverged over the length of the integration . | {
"relations": {
"used for": [
{
"head": {
"text": "Flow Map",
"start": 63,
"end": 71
},
"tail": {
"text": "evolution of particles",
"start": 4,
"end": 26
}
},
{
"head": {
"text": "spati... | [] |
The maximum eigenvalue of the tensor is used to construct a Finite Time Lyapunov Exponent -LRB- FTLE -RRB- field , which reveals the Lagrangian Coherent Structures -LRB- LCS -RRB- present in the underlying flow . | {
"relations": {
"feature of": [
{
"head": {
"text": "maximum eigenvalue",
"start": 4,
"end": 22
},
"tail": {
"text": "tensor",
"start": 30,
"end": 36
}
}
],
"used for": [
{
"head": {
... | [] |
The LCS divide flow into regions of qualitatively different dynamics and are used to locate boundaries of the flow segments in a normalized cuts framework . | {
"relations": {
"used for": [
{
"head": {
"text": "LCS",
"start": 4,
"end": 7
},
"tail": {
"text": "boundaries of the flow segments",
"start": 92,
"end": 123
}
},
{
"head": {
"text": "n... | [] |
The experiments are conducted on a challenging set of videos taken from Google Video and a National Geographic documentary . | {
"relations": {
"conjunction": [
{
"head": {
"text": "Google Video",
"start": 72,
"end": 84
},
"tail": {
"text": "National Geographic documentary",
"start": 91,
"end": 122
}
}
]
}
} | [] |
Over the last decade , a variety of SMT algorithms have been built and empirically tested whereas little is known about the computational complexity of some of the fundamental problems of SMT . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "computational complexity",
"start": 124,
"end": 148
},
"tail": {
"text": "problems",
"start": 176,
"end": 184
}
}
],
"part of": [
{
... | [] |
Our work aims at providing useful insights into the the computational complexity of those problems . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "computational complexity",
"start": 56,
"end": 80
},
"tail": {
"text": "problems",
"start": 90,
"end": 98
}
}
]
}
} | [] |
We prove that while IBM Models 1-2 are conceptually and computationally simple , computations involving the higher -LRB- and more useful -RRB- models are hard . | {
"relations": {
"compare": [
{
"head": {
"text": "IBM Models 1-2",
"start": 20,
"end": 34
},
"tail": {
"text": "models",
"start": 143,
"end": 149
}
}
]
}
} | [] |
Since it is unlikely that there exists a polynomial time solution for any of these hard problems -LRB- unless P = NP and P #P = P -RRB- , our results highlight and justify the need for developing polynomial time approximations for these computations . | {
"relations": {
"used for": [
{
"head": {
"text": "polynomial time solution",
"start": 41,
"end": 65
},
"tail": {
"text": "hard problems",
"start": 83,
"end": 96
}
},
{
"head": {
"text"... | [] |
Most state-of-the-art evaluation measures for machine translation assign high costs to movements of word blocks . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "evaluation measures",
"start": 22,
"end": 41
},
"tail": {
"text": "machine translation",
"start": 46,
"end": 65
}
}
]
}
} | [] |
In this paper , we will present a new evaluation measure which explicitly models block reordering as an edit operation . | {
"relations": {
"used for": [
{
"head": {
"text": "evaluation measure",
"start": 38,
"end": 56
},
"tail": {
"text": "block reordering",
"start": 81,
"end": 97
}
},
{
"head": {
"text": "... | [] |
Our measure can be exactly calculated in quadratic time . | {
"relations": {
"feature of": [
{
"head": {
"text": "quadratic time",
"start": 41,
"end": 55
},
"tail": {
"text": "measure",
"start": 4,
"end": 11
}
}
]
}
} | [] |
Furthermore , we will show how some evaluation measures can be improved by the introduction of word-dependent substitution costs . | {
"relations": {
"used for": [
{
"head": {
"text": "word-dependent substitution costs",
"start": 95,
"end": 128
},
"tail": {
"text": "evaluation measures",
"start": 36,
"end": 55
}
}
]
}
} | [] |
The correlation of the new measure with human judgment has been investigated systematically on two different language pairs . | {
"relations": {
"compare": [
{
"head": {
"text": "measure",
"start": 27,
"end": 34
},
"tail": {
"text": "human judgment",
"start": 40,
"end": 54
}
}
]
}
} | [] |
The experimental results will show that it significantly outperforms state-of-the-art approaches in sentence-level correlation . | {
"relations": {
"compare": [
{
"head": {
"text": "it",
"start": 40,
"end": 42
},
"tail": {
"text": "approaches",
"start": 86,
"end": 96
}
}
],
"evaluate for": [
{
"head": {
"tex... | [] |
Results from experiments with word dependent substitution costs will demonstrate an additional increase of correlation between automatic evaluation measures and human judgment . | {
"relations": {
"conjunction": [
{
"head": {
"text": "automatic evaluation measures",
"start": 127,
"end": 156
},
"tail": {
"text": "human judgment",
"start": 161,
"end": 175
}
}
]
}
} | [] |
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "Rete and Treat algorithms",
"start": 4,
"end": 29
},
"tail": {
"text": "implementation techniques",
"start": 64,
"end": 89
}
}
],
"used for": [
... | [] |
These algorithms support a language of limited expressive power . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithms",
"start": 6,
"end": 16
},
"tail": {
"text": "language of limited expressive power",
"start": 27,
"end": 63
}
}
]
}
} | [] |
In this paper we show how to support full unification in these algorithms . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithms",
"start": 63,
"end": 73
},
"tail": {
"text": "full unification",
"start": 37,
"end": 53
}
}
]
}
} | [] |
We also show that : Supporting full unification is costly ; Full unification is not used frequently ; A combination of compile time and run time checks can determine when full unification is not needed . | {
"relations": {
"conjunction": [
{
"head": {
"text": "compile time",
"start": 119,
"end": 131
},
"tail": {
"text": "run time",
"start": 136,
"end": 144
}
}
],
"evaluate for": [
{
"head": ... | [] |
A method for error correction of ill-formed input is described that acquires dialogue patterns in typical usage and uses these patterns to predict new inputs . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 2,
"end": 8
},
"tail": {
"text": "error correction",
"start": 13,
"end": 29
}
},
{
"head": {
"text": "ill-formed inp... | [] |
A dialogue acquisition and tracking algorithm is presented along with a description of its implementation in a voice interactive system . | {
"relations": {
"used for": [
{
"head": {
"text": "dialogue acquisition and tracking algorithm",
"start": 2,
"end": 45
},
"tail": {
"text": "voice interactive system",
"start": 111,
"end": 135
}
}
]
}
} | [] |
A series of tests are described that show the power of the error correction methodology when stereotypic dialogue occurs . | {
"relations": {
"used for": [
{
"head": {
"text": "stereotypic dialogue",
"start": 93,
"end": 113
},
"tail": {
"text": "error correction methodology",
"start": 59,
"end": 87
}
}
]
}
} | [] |
Traditional linear Fukunaga-Koontz Transform -LRB- FKT -RRB- -LSB- 1 -RSB- is a powerful discriminative subspaces building approach . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "linear Fukunaga-Koontz Transform -LRB- FKT -RRB-",
"start": 12,
"end": 60
},
"tail": {
"text": "discriminative subspaces building approach",
"start": 89,
"end": 131
... | [] |
Previous work has successfully extended FKT to be able to deal with small-sample-size . | {
"relations": {
"used for": [
{
"head": {
"text": "FKT",
"start": 40,
"end": 43
},
"tail": {
"text": "small-sample-size",
"start": 68,
"end": 85
}
}
]
}
} | [] |
In this paper , we extend traditional linear FKT to enable it to work in multi-class problem and also in higher dimensional -LRB- kernel -RRB- subspaces and therefore provide enhanced discrimination ability . | {
"relations": {
"used for": [
{
"head": {
"text": "linear FKT",
"start": 38,
"end": 48
},
"tail": {
"text": "it",
"start": 30,
"end": 32
}
},
{
"head": {
"text": "it",
"start"... | [] |
We verify the effectiveness of the proposed Kernel Fukunaga-Koontz Transform by demonstrating its effectiveness in face recognition applications ; however the proposed non-linear generalization can be applied to any other domain specific problems . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "face recognition applications",
"start": 115,
"end": 144
},
"tail": {
"text": "Kernel Fukunaga-Koontz Transform",
"start": 44,
"end": 76
}
}
],
"u... | [] |
While this task has much in common with paraphrases acquisition which aims to discover semantic equivalence between verbs , the main challenge of entailment acquisition is to capture asymmetric , or directional , relations . | {
"relations": {
"compare": [
{
"head": {
"text": "task",
"start": 11,
"end": 15
},
"tail": {
"text": "paraphrases acquisition",
"start": 40,
"end": 63
}
}
],
"used for": [
{
"head": {
... | [] |
Motivated by the intuition that it often underlies the local structure of coherent text , we develop a method that discovers verb entailment using evidence about discourse relations between clauses available in a parsed corpus . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 103,
"end": 109
},
"tail": {
"text": "verb entailment",
"start": 125,
"end": 140
}
},
{
"head": {
"text": "discourse... | [] |
In comparison with earlier work , the proposed method covers a much wider range of verb entailment types and learns the mapping between verbs with highly varied argument structures . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 47,
"end": 53
},
"tail": {
"text": "mapping between verbs",
"start": 120,
"end": 141
}
}
],
"feature of": [
{
"head": ... | [] |
In this paper , we cast the problem of point cloud matching as a shape matching problem by transforming each of the given point clouds into a shape representation called the Schrödinger distance transform -LRB- SDT -RRB- representation . | {
"relations": {
"used for": [
{
"head": {
"text": "shape matching problem",
"start": 65,
"end": 87
},
"tail": {
"text": "point cloud matching",
"start": 39,
"end": 59
}
},
{
"head": {
"... | [] |
The SDT representation is an analytic expression and following the theoretical physics literature , can be normalized to have unit L2 norm-making it a square-root density , which is identified with a point on a unit Hilbert sphere , whose intrinsic geometry is fully known . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "SDT representation",
"start": 4,
"end": 22
},
"tail": {
"text": "analytic expression",
"start": 29,
"end": 48
}
}
],
"used for": [
{
"... | [] |
The Fisher-Rao metric , a natural metric for the space of densities leads to analytic expressions for the geodesic distance between points on this sphere . | {
"relations": {
"used for": [
{
"head": {
"text": "natural metric",
"start": 26,
"end": 40
},
"tail": {
"text": "space of densities",
"start": 49,
"end": 67
}
},
{
"head": {
"text": "an... | [] |
In this paper , we use the well known Riemannian framework never before used for point cloud matching , and present a novel matching algorithm . | {
"relations": {
"used for": [
{
"head": {
"text": "Riemannian framework",
"start": 38,
"end": 58
},
"tail": {
"text": "point cloud matching",
"start": 81,
"end": 101
}
}
]
}
} | [] |
We pose point set matching under rigid and non-rigid transformations in this framework and solve for the transformations using standard nonlinear optimization techniques . | {
"relations": {
"used for": [
{
"head": {
"text": "rigid and non-rigid transformations",
"start": 33,
"end": 68
},
"tail": {
"text": "point set matching",
"start": 8,
"end": 26
}
},
{
"head": {
... | [] |
The experiments show that our algorithm outperforms state-of-the-art point set registration algorithms on many quantitative metrics . | {
"relations": {
"compare": [
{
"head": {
"text": "algorithm",
"start": 30,
"end": 39
},
"tail": {
"text": "point set registration algorithms",
"start": 69,
"end": 102
}
}
],
"evaluate for": [
{
... | [] |
Using natural language processing , we carried out a trend survey on Japanese natural language processing studies that have been done over the last ten years . | {
"relations": {
"used for": [
{
"head": {
"text": "natural language processing",
"start": 6,
"end": 33
},
"tail": {
"text": "trend survey on Japanese natural language processing studies",
"start": 53,
"end": 113
}
... | [] |
This paper is useful for both recognizing trends in Japanese NLP and constructing a method of supporting trend surveys using NLP . | {
"relations": {
"used for": [
{
"head": {
"text": "NLP",
"start": 61,
"end": 64
},
"tail": {
"text": "trend surveys",
"start": 105,
"end": 118
}
}
]
}
} | [] |
HFOs additionally serve as a prototypical example of challenges in the analysis of discrete events in high-temporal resolution , intracranial EEG data . | {
"relations": {
"used for": [
{
"head": {
"text": "high-temporal resolution , intracranial EEG data",
"start": 102,
"end": 150
},
"tail": {
"text": "analysis of discrete events",
"start": 71,
"end": 98
}
}
... | [] |
However , previous HFO analysis have assumed a linear manifold , global across time , space -LRB- i.e. recording electrode/channel -RRB- , and individual patients . | {
"relations": {
"used for": [
{
"head": {
"text": "linear manifold",
"start": 47,
"end": 62
},
"tail": {
"text": "HFO analysis",
"start": 19,
"end": 31
}
}
]
}
} | [] |
We also estimate bounds on the Bayes classification error to quantify the distinction between two classes of HFOs -LRB- those occurring during seizures and those occurring due to other processes -RRB- . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "those",
"start": 120,
"end": 125
},
"tail": {
"text": "HFOs",
"start": 109,
"end": 113
}
},
{
"head": {
"text": "those",
"... | [] |
This analysis provides the foundation for future clinical use of HFO features and guides the analysis for other discrete events , such as individual action potentials or multi-unit activity . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "action potentials",
"start": 149,
"end": 166
},
"tail": {
"text": "discrete events",
"start": 112,
"end": 127
}
},
{
"head": {
"text... | [] |
In this paper we present ONTOSCORE , a system for scoring sets of concepts on the basis of an ontology . | {
"relations": {
"used for": [
{
"head": {
"text": "ontology",
"start": 94,
"end": 102
},
"tail": {
"text": "system",
"start": 39,
"end": 45
}
}
]
}
} | [] |
We apply our system to the task of scoring alternative speech recognition hypotheses -LRB- SRH -RRB- in terms of their semantic coherence . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 13,
"end": 19
},
"tail": {
"text": "speech recognition hypotheses -LRB- SRH -RRB-",
"start": 55,
"end": 100
}
}
]
}
} | [] |
We propose an efficient dialogue management for an information navigation system based on a document knowledge base . | {
"relations": {
"used for": [
{
"head": {
"text": "dialogue management",
"start": 24,
"end": 43
},
"tail": {
"text": "information navigation system",
"start": 51,
"end": 80
}
},
{
"head": {
... | [] |
It is expected that incorporation of appropriate N-best candidates of ASR and contextual information will improve the system performance . | {
"relations": {
"conjunction": [
{
"head": {
"text": "N-best candidates of ASR",
"start": 49,
"end": 73
},
"tail": {
"text": "contextual information",
"start": 78,
"end": 100
}
}
],
"used for": [
... | [] |
The system also has several choices in generating responses or confirmations . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 4,
"end": 10
},
"tail": {
"text": "generating responses or confirmations",
"start": 39,
"end": 76
}
}
]
}
} | [] |
In this paper , this selection is optimized as minimization of Bayes risk based on reward for correct information presentation and penalty for redundant turns . | {
"relations": {
"used for": [
{
"head": {
"text": "reward",
"start": 83,
"end": 89
},
"tail": {
"text": "minimization of Bayes risk",
"start": 47,
"end": 73
}
},
{
"head": {
"text": "re... | [] |
We have evaluated this strategy with our spoken dialogue system '' Dialogue Navigator for Kyoto City '' , which also has question-answering capability . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "spoken dialogue system '' Dialogue Navigator for Kyoto City ''",
"start": 41,
"end": 103
},
"tail": {
"text": "strategy",
"start": 23,
"end": 31
}
}
]... | [] |
Effectiveness of the proposed framework was confirmed in the success rate of retrieval and the average number of turns for information access . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "success rate of retrieval",
"start": 61,
"end": 86
},
"tail": {
"text": "framework",
"start": 30,
"end": 39
}
},
{
"head": {
"text... | [] |
They are probability , rank , and entropy . | {
"relations": {
"conjunction": [
{
"head": {
"text": "rank",
"start": 23,
"end": 27
},
"tail": {
"text": "entropy",
"start": 34,
"end": 41
}
}
]
}
} | [] |
We evaluated the performance of the three pruning criteria in a real application of Chinese text input in terms of character error rate -LRB- CER -RRB- . | {
"relations": {
"used for": [
{
"head": {
"text": "pruning criteria",
"start": 42,
"end": 58
},
"tail": {
"text": "Chinese text input",
"start": 84,
"end": 102
}
}
],
"evaluate for": [
{
... | [] |
We also show that the high-performance of rank lies in its strong correlation with error rate . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "error rate",
"start": 83,
"end": 93
},
"tail": {
"text": "rank",
"start": 42,
"end": 46
}
}
]
}
} | [] |
We then present a novel method of combining two criteria in model pruning . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 24,
"end": 30
},
"tail": {
"text": "model pruning",
"start": 60,
"end": 73
}
}
]
}
} | [] |
This paper proposes an annotating scheme that encodes honorifics -LRB- respectful words -RRB- . | {
"relations": {
"used for": [
{
"head": {
"text": "annotating scheme",
"start": 23,
"end": 40
},
"tail": {
"text": "honorifics",
"start": 54,
"end": 64
}
}
],
"hyponym of": [
{
"head": {
... | [] |
Honorifics are used extensively in Japanese , reflecting the social relationship -LRB- e.g. social ranks and age -RRB- of the referents . | {
"relations": {
"used for": [
{
"head": {
"text": "Honorifics",
"start": 0,
"end": 10
},
"tail": {
"text": "Japanese",
"start": 35,
"end": 43
}
}
]
}
} | [] |
This referential information is vital for resolving zero pronouns and improving machine translation outputs . | {
"relations": {
"used for": [
{
"head": {
"text": "referential information",
"start": 5,
"end": 28
},
"tail": {
"text": "zero pronouns",
"start": 52,
"end": 65
}
},
{
"head": {
"text": ... | [] |
Visually-guided arm reaching movements are produced by distributed neural networks within parietal and frontal regions of the cerebral cortex . | {
"relations": {
"used for": [
{
"head": {
"text": "distributed neural networks",
"start": 55,
"end": 82
},
"tail": {
"text": "Visually-guided arm reaching movements",
"start": 0,
"end": 38
}
}
]
}
} | [] |
Experimental data indicate that -LRB- I -RRB- single neurons in these regions are broadly tuned to parameters of movement ; -LRB- 2 -RRB- appropriate commands are elaborated by populations of neurons ; -LRB- 3 -RRB- the coordinated action of neu-rons can be visualized using a neuronal population vector -LRB- NPV -RRB- ... | {
"relations": {
"used for": [
{
"head": {
"text": "neuronal population vector -LRB- NPV -RRB-",
"start": 277,
"end": 319
},
"tail": {
"text": "coordinated action of neu-rons",
"start": 220,
"end": 250
}
}
... | [] |
We designed a model of the cortical motor command to investigate the relation between the desired direction of the movement , the actual direction of movement and the direction of the NPV in motor cortex . | {
"relations": {
"used for": [
{
"head": {
"text": "model",
"start": 14,
"end": 19
},
"tail": {
"text": "cortical motor command",
"start": 27,
"end": 49
}
},
{
"head": {
"text": "NPV",
... | [] |
The model is a two-layer self-organizing neural network which combines broadly-tuned -LRB- muscular -RRB- proprioceptive and -LRB- cartesian -RRB- visual information to calculate -LRB- angular -RRB- motor commands for the initial part of the movement of a two-link arm . | {
"relations": {
"used for": [
{
"head": {
"text": "two-layer self-organizing neural network",
"start": 15,
"end": 55
},
"tail": {
"text": "-LRB- angular -RRB- motor commands",
"start": 179,
"end": 213
}
},
... | [] |
These results suggest the NPV does not give a faithful image of cortical processing during arm reaching movements . | {
"relations": {
"feature of": [
{
"head": {
"text": "arm reaching movements",
"start": 91,
"end": 113
},
"tail": {
"text": "image of cortical processing",
"start": 55,
"end": 83
}
}
]
}
} | [] |
It is well-known that diversity among base classifiers is crucial for constructing a strong ensemble . | {
"relations": {
"used for": [
{
"head": {
"text": "base classifiers",
"start": 38,
"end": 54
},
"tail": {
"text": "ensemble",
"start": 92,
"end": 100
}
}
]
}
} | [] |
In this paper , we propose an alternative way for ensemble construction by resampling pairwise constraints that specify whether a pair of instances belongs to the same class or not . | {
"relations": {
"used for": [
{
"head": {
"text": "resampling pairwise constraints",
"start": 75,
"end": 106
},
"tail": {
"text": "ensemble construction",
"start": 50,
"end": 71
}
}
]
}
} | [] |
Using pairwise constraints for ensemble construction is challenging because it remains unknown how to influence the base classifiers with the sampled pairwise constraints . | {
"relations": {
"used for": [
{
"head": {
"text": "pairwise constraints",
"start": 6,
"end": 26
},
"tail": {
"text": "ensemble construction",
"start": 31,
"end": 52
}
}
]
}
} | [] |
First , we transform the original instances into a new data representation using projections learnt from pairwise constraints . | {
"relations": {
"used for": [
{
"head": {
"text": "projections",
"start": 81,
"end": 92
},
"tail": {
"text": "data representation",
"start": 55,
"end": 74
}
},
{
"head": {
"text": "pair... | [] |
Then , we build the base clas-sifiers with the new data representation . | {
"relations": {
"used for": [
{
"head": {
"text": "data representation",
"start": 51,
"end": 70
},
"tail": {
"text": "base clas-sifiers",
"start": 20,
"end": 37
}
}
]
}
} | [] |
We propose two methods for resampling pairwise constraints following the standard Bagging and Boosting algorithms , respectively . | {
"relations": {
"used for": [
{
"head": {
"text": "Bagging and Boosting algorithms",
"start": 82,
"end": 113
},
"tail": {
"text": "resampling pairwise constraints",
"start": 27,
"end": 58
}
}
]
}
} | [] |
A new algorithm for solving the three dimensional container packing problem is proposed in this paper . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithm",
"start": 6,
"end": 15
},
"tail": {
"text": "dimensional container packing problem",
"start": 38,
"end": 75
}
}
]
}
} | [] |
This new algorithm deviates from the traditional approach of wall building and layering . | {
"relations": {
"compare": [
{
"head": {
"text": "algorithm",
"start": 9,
"end": 18
},
"tail": {
"text": "approach of wall building and layering",
"start": 49,
"end": 87
}
}
]
}
} | [] |
We tested our method using all 760 test cases from the OR-Library . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "OR-Library",
"start": 55,
"end": 65
},
"tail": {
"text": "method",
"start": 14,
"end": 20
}
}
]
}
} | [] |
Experimental results indicate that the new algorithm is able to achieve an average packing utilization of more than 87 % . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "average packing utilization",
"start": 75,
"end": 102
},
"tail": {
"text": "algorithm",
"start": 43,
"end": 52
}
}
]
}
} | [] |
Current approaches to object category recognition require datasets of training images to be manually prepared , with varying degrees of supervision . | {
"relations": {
"used for": [
{
"head": {
"text": "approaches",
"start": 8,
"end": 18
},
"tail": {
"text": "object category recognition",
"start": 22,
"end": 49
}
},
{
"head": {
"text":... | [] |
We present an approach that can learn an object category from just its name , by utilizing the raw output of image search engines available on the Internet . | {
"relations": {
"used for": [
{
"head": {
"text": "approach",
"start": 14,
"end": 22
},
"tail": {
"text": "object category",
"start": 41,
"end": 56
}
}
]
}
} | [] |
We develop a new model , TSI-pLSA , which extends pLSA -LRB- as applied to visual words -RRB- to include spatial information in a translation and scale invariant manner . | {
"relations": {
"used for": [
{
"head": {
"text": "pLSA",
"start": 29,
"end": 33
},
"tail": {
"text": "TSI-pLSA",
"start": 25,
"end": 33
}
},
{
"head": {
"text": "pLSA",
"star... | [] |
Our approach can handle the high intra-class variability and large proportion of unrelated images returned by search engines . | {
"relations": {
"used for": [
{
"head": {
"text": "approach",
"start": 4,
"end": 12
},
"tail": {
"text": "intra-class variability",
"start": 33,
"end": 56
}
},
{
"head": {
"text": "appr... | [] |
We evaluate the models on standard test sets , showing performance competitive with existing methods trained on hand prepared datasets . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "test sets",
"start": 35,
"end": 44
},
"tail": {
"text": "models",
"start": 16,
"end": 22
}
},
{
"head": {
"text": "test sets",
... | [] |
The paper provides an overview of the research conducted at LIMSI in the field of speech processing , but also in the related areas of Human-Machine Communication , including Natural Language Processing , Non Verbal and Multimodal Communication . | {
"relations": {
"conjunction": [
{
"head": {
"text": "speech processing",
"start": 82,
"end": 99
},
"tail": {
"text": "Human-Machine Communication",
"start": 135,
"end": 162
}
},
{
"head": {
... | [] |
We have calculated analytical expressions for how the bias and variance of the estimators provided by various temporal difference value estimation algorithms change with offline updates over trials in absorbing Markov chains using lookup table representations . | {
"relations": {
"used for": [
{
"head": {
"text": "lookup table representations",
"start": 231,
"end": 259
},
"tail": {
"text": "analytical expressions",
"start": 19,
"end": 41
}
}
]
}
} | [] |
In this paper , we describe the pronominal anaphora resolution module of Lucy , a portable English understanding system . | {
"relations": {
"part of": [
{
"head": {
"text": "pronominal anaphora resolution module",
"start": 32,
"end": 69
},
"tail": {
"text": "Lucy",
"start": 73,
"end": 77
}
}
],
"hyponym of": [
{
... | [] |
In this paper , we reported experiments of unsupervised automatic acquisition of Italian and English verb subcategorization frames -LRB- SCFs -RRB- from general and domain corpora . | {
"relations": {
"used for": [
{
"head": {
"text": "general and domain corpora",
"start": 153,
"end": 179
},
"tail": {
"text": "unsupervised automatic acquisition of Italian and English verb subcategorization frames -LRB- SCFs -RRB-",
... | [] |
The proposed technique operates on syntactically shallow-parsed corpora on the basis of a limited number of search heuristics not relying on any previous lexico-syntactic knowledge about SCFs . | {
"relations": {
"used for": [
{
"head": {
"text": "syntactically shallow-parsed corpora",
"start": 35,
"end": 71
},
"tail": {
"text": "technique",
"start": 13,
"end": 22
}
},
{
"head": {
... | [] |
Graph-cuts optimization is prevalent in vision and graphics problems . | {
"relations": {
"used for": [
{
"head": {
"text": "Graph-cuts optimization",
"start": 0,
"end": 23
},
"tail": {
"text": "vision and graphics problems",
"start": 40,
"end": 68
}
}
]
}
} | [] |
It is thus of great practical importance to parallelize the graph-cuts optimization using to-day 's ubiquitous multi-core machines . | {
"relations": {
"used for": [
{
"head": {
"text": "multi-core machines",
"start": 111,
"end": 130
},
"tail": {
"text": "graph-cuts optimization",
"start": 60,
"end": 83
}
}
]
}
} | [] |
However , the current best serial algorithm by Boykov and Kolmogorov -LSB- 4 -RSB- -LRB- called the BK algorithm -RRB- still has the superior empirical performance . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "BK algorithm",
"start": 100,
"end": 112
},
"tail": {
"text": "serial algorithm",
"start": 27,
"end": 43
}
}
]
}
} | [] |
In this paper , we propose a novel adaptive bottom-up approach to parallelize the BK algorithm . | {
"relations": {
"used for": [
{
"head": {
"text": "adaptive bottom-up approach",
"start": 35,
"end": 62
},
"tail": {
"text": "BK algorithm",
"start": 82,
"end": 94
}
}
]
}
} | [] |
Extensive experiments in common applications such as 2D/3D image segmentations and 3D surface fitting demonstrate the effectiveness of our approach . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "applications",
"start": 32,
"end": 44
},
"tail": {
"text": "approach",
"start": 139,
"end": 147
}
}
],
"hyponym of": [
{
"head": {
... | [] |
We study the question of how to make loss-aware predictions in image segmentation settings where the evaluation function is the Intersection-over-Union -LRB- IoU -RRB- measure that is used widely in evaluating image segmentation systems . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "Intersection-over-Union -LRB- IoU -RRB- measure",
"start": 128,
"end": 175
},
"tail": {
"text": "evaluation function",
"start": 101,
"end": 120
}
}
],
... | [] |
Currently , there are two dominant approaches : the first approximates the Expected-IoU -LRB- EIoU -RRB- score as Expected-Intersection-over-Expected-Union -LRB- EIoEU -RRB- ; and the second approach is to compute exact EIoU but only over a small set of high-quality candidate solutions . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "first",
"start": 52,
"end": 57
},
"tail": {
"text": "dominant approaches",
"start": 26,
"end": 45
}
},
{
"head": {
"text": "second a... | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.