input stringlengths 37 565 | output dict | schema listlengths 0 0 |
|---|---|---|
Identity uncertainty is handled by extending standard models to incorporate probabilities over the possible mappings between terms in the language and objects in the domain . | {
"relations": {
"used for": [
{
"head": {
"text": "models",
"start": 54,
"end": 60
},
"tail": {
"text": "Identity uncertainty",
"start": 0,
"end": 20
}
}
]
}
} | [] |
Inference is based on Markov chain Monte Carlo , augmented with specific methods for generating efficient proposals when the domain contains many objects . | {
"relations": {
"used for": [
{
"head": {
"text": "Markov chain Monte Carlo",
"start": 22,
"end": 46
},
"tail": {
"text": "Inference",
"start": 0,
"end": 9
}
},
{
"head": {
"text": "met... | [] |
Results on several citation data sets show that the method outperforms current algorithms for citation matching . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "citation data sets",
"start": 19,
"end": 37
},
"tail": {
"text": "method",
"start": 52,
"end": 58
}
}
],
"compare": [
{
"head": {
... | [] |
The declarative , relational nature of the model also means that our algorithm can determine object characteristics such as author names by combining multiple citations of multiple papers . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithm",
"start": 69,
"end": 78
},
"tail": {
"text": "object characteristics",
"start": 93,
"end": 115
}
}
],
"hyponym of": [
{
"head... | [] |
The paper proposes and empirically motivates an integration of supervised learning with unsupervised learning to deal with human biases in summarization . | {
"relations": {
"used for": [
{
"head": {
"text": "supervised learning",
"start": 63,
"end": 82
},
"tail": {
"text": "human biases in summarization",
"start": 123,
"end": 152
}
},
{
"head": {
... | [] |
In particular , we explore the use of probabilistic decision tree within the clustering framework to account for the variation as well as regularity in human created summaries . | {
"relations": {
"feature of": [
{
"head": {
"text": "clustering framework",
"start": 77,
"end": 97
},
"tail": {
"text": "probabilistic decision tree",
"start": 38,
"end": 65
}
}
]
}
} | [] |
The corpus of human created extracts is created from a newspaper corpus and used as a test set . | {
"relations": {
"used for": [
{
"head": {
"text": "newspaper corpus",
"start": 55,
"end": 71
},
"tail": {
"text": "corpus of human created extracts",
"start": 4,
"end": 36
}
}
]
}
} | [] |
We build probabilistic decision trees of different flavors and integrate each of them with the clustering framework . | {
"relations": {
"conjunction": [
{
"head": {
"text": "clustering framework",
"start": 95,
"end": 115
},
"tail": {
"text": "them",
"start": 81,
"end": 85
}
}
]
}
} | [] |
In this study , we propose a knowledge-independent method for aligning terms and thus extracting translations from a small , domain-specific corpus consisting of parallel English and Chinese court judgments from Hong Kong . | {
"relations": {
"part of": [
{
"head": {
"text": "parallel English and Chinese court judgments",
"start": 162,
"end": 206
},
"tail": {
"text": "small , domain-specific corpus",
"start": 117,
"end": 147
}
}
... | [] |
With a sentence-aligned corpus , translation equivalences are suggested by analysing the frequency profiles of parallel concordances . | {
"relations": {
"used for": [
{
"head": {
"text": "sentence-aligned corpus",
"start": 7,
"end": 30
},
"tail": {
"text": "translation equivalences",
"start": 33,
"end": 57
}
}
],
"part of": [
{
... | [] |
The method overcomes the limitations of conventional statistical methods which require large corpora to be effective , and lexical approaches which depend on existing bilingual dictionaries . | {
"relations": {
"compare": [
{
"head": {
"text": "method",
"start": 4,
"end": 10
},
"tail": {
"text": "statistical methods",
"start": 53,
"end": 72
}
},
{
"head": {
"text": "method",
... | [] |
Pilot testing on a parallel corpus of about 113K Chinese words and 120K English words gives an encouraging 85 % precision and 45 % recall . | {
"relations": {
"conjunction": [
{
"head": {
"text": "precision",
"start": 112,
"end": 121
},
"tail": {
"text": "recall",
"start": 131,
"end": 137
}
}
]
}
} | [] |
Future work includes fine-tuning the algorithm upon the analysis of the errors , and acquiring a translation lexicon for legal terminology by filtering out general terms . | {
"relations": {
"used for": [
{
"head": {
"text": "translation lexicon",
"start": 97,
"end": 116
},
"tail": {
"text": "legal terminology",
"start": 121,
"end": 138
}
}
]
}
} | [] |
Traditional machine learning techniques have been applied to this problem with reasonable success , but they have been shown to work well only when there is a good match between the training and test data with respect to topic . | {
"relations": {
"used for": [
{
"head": {
"text": "machine learning techniques",
"start": 12,
"end": 39
},
"tail": {
"text": "problem",
"start": 66,
"end": 73
}
}
]
}
} | [] |
This paper demonstrates that match with respect to domain and time is also important , and presents preliminary experiments with training data labeled with emoticons , which has the potential of being independent of domain , topic and time . | {
"relations": {
"feature of": [
{
"head": {
"text": "emoticons",
"start": 156,
"end": 165
},
"tail": {
"text": "training data",
"start": 129,
"end": 142
}
}
]
}
} | [] |
We present a novel algorithm for estimating the broad 3D geometric structure of outdoor video scenes . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithm",
"start": 19,
"end": 28
},
"tail": {
"text": "3D geometric structure of outdoor video scenes",
"start": 54,
"end": 100
}
}
]
}
} | [] |
Leveraging spatio-temporal video segmentation , we decompose a dynamic scene captured by a video into geometric classes , based on predictions made by region-classifiers that are trained on appearance and motion features . | {
"relations": {
"used for": [
{
"head": {
"text": "spatio-temporal video segmentation",
"start": 11,
"end": 45
},
"tail": {
"text": "dynamic scene",
"start": 63,
"end": 76
}
},
{
"head": {
... | [] |
We built a novel , extensive dataset on geometric context of video to evaluate our method , consisting of over 100 ground-truth annotated outdoor videos with over 20,000 frames . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "dataset",
"start": 29,
"end": 36
},
"tail": {
"text": "method",
"start": 83,
"end": 89
}
}
],
"feature of": [
{
"head": {
... | [] |
To further scale beyond this dataset , we propose a semi-supervised learning framework to expand the pool of labeled data with high confidence predictions obtained from unlabeled data . | {
"relations": {
"used for": [
{
"head": {
"text": "semi-supervised learning framework",
"start": 52,
"end": 86
},
"tail": {
"text": "labeled data",
"start": 109,
"end": 121
}
},
{
"head": {
... | [] |
Our system produces an accurate prediction of geometric context of video achieving 96 % accuracy across main geometric classes . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 4,
"end": 10
},
"tail": {
"text": "geometric context of video",
"start": 46,
"end": 72
}
}
],
"evaluate for": [
{
"hea... | [] |
This paper describes a system -LRB- RAREAS -RRB- which synthesizes marine weather forecasts directly from formatted weather data . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 23,
"end": 29
},
"tail": {
"text": "marine weather forecasts",
"start": 67,
"end": 91
}
},
{
"head": {
"text": "form... | [] |
Such synthesis appears feasible in certain natural sublanguages with stereotyped text structure . | {
"relations": {
"used for": [
{
"head": {
"text": "natural sublanguages with stereotyped text structure",
"start": 43,
"end": 95
},
"tail": {
"text": "synthesis",
"start": 5,
"end": 14
}
}
]
}
} | [] |
RAREAS draws on several kinds of linguistic and non-linguistic knowledge and mirrors a forecaster 's apparent tendency to ascribe less precise temporal adverbs to more remote meteorological events . | {
"relations": {
"used for": [
{
"head": {
"text": "linguistic and non-linguistic knowledge",
"start": 33,
"end": 72
},
"tail": {
"text": "RAREAS",
"start": 0,
"end": 6
}
}
]
}
} | [] |
The approach can easily be adapted to synthesize bilingual or multi-lingual texts . | {
"relations": {
"used for": [
{
"head": {
"text": "bilingual or multi-lingual texts",
"start": 49,
"end": 81
},
"tail": {
"text": "approach",
"start": 4,
"end": 12
}
}
]
}
} | [] |
We go , on to describe FlexP , a bottom-up pattern-matching parser that we have designed and implemented to provide these flexibilities for restricted natural language input to a limited-domain computer system . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "FlexP",
"start": 23,
"end": 28
},
"tail": {
"text": "bottom-up pattern-matching parser",
"start": 33,
"end": 66
}
}
],
"used for": [
{
... | [] |
Traditional information retrieval techniques use a histogram of keywords as the document representation but oral communication may offer additional indices such as the time and place of the rejoinder and the attendance . | {
"relations": {
"used for": [
{
"head": {
"text": "histogram of keywords",
"start": 51,
"end": 72
},
"tail": {
"text": "information retrieval techniques",
"start": 12,
"end": 44
}
},
{
"head": {
... | [] |
An alternative index could be the activity such as discussing , planning , informing , story-telling , etc. . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "discussing",
"start": 51,
"end": 61
},
"tail": {
"text": "activity",
"start": 34,
"end": 42
}
},
{
"head": {
"text": "planning",
... | [] |
This paper addresses the problem of the automatic detection of those activities in meeting situation and everyday rejoinders . | {
"relations": {
"used for": [
{
"head": {
"text": "activities",
"start": 69,
"end": 79
},
"tail": {
"text": "automatic detection",
"start": 40,
"end": 59
}
}
]
}
} | [] |
The format of the corpus adopts the Child Language Data Exchange System -LRB- CHILDES -RRB- . | {
"relations": {
"feature of": [
{
"head": {
"text": "Child Language Data Exchange System -LRB- CHILDES -RRB-",
"start": 36,
"end": 91
},
"tail": {
"text": "corpus",
"start": 18,
"end": 24
}
}
]
}
} | [] |
In this paper , we describe data collection , transcription , word segmentation , and part-of-speech annotation of this corpus . | {
"relations": {
"conjunction": [
{
"head": {
"text": "data collection",
"start": 28,
"end": 43
},
"tail": {
"text": "transcription",
"start": 46,
"end": 59
}
},
{
"head": {
"text": "tra... | [] |
This paper shows how dictionary word sense definitions can be analysed by applying a hierarchy of phrasal patterns . | {
"relations": {
"used for": [
{
"head": {
"text": "hierarchy of phrasal patterns",
"start": 85,
"end": 114
},
"tail": {
"text": "dictionary word sense definitions",
"start": 21,
"end": 54
}
}
]
}
} | [] |
An experimental system embodying this mechanism has been implemented for processing definitions from the Longman Dictionary of Contemporary English . | {
"relations": {
"part of": [
{
"head": {
"text": "mechanism",
"start": 38,
"end": 47
},
"tail": {
"text": "system",
"start": 16,
"end": 22
}
}
]
}
} | [] |
A property of this dictionary , exploited by the system , is that it uses a restricted vocabulary in its word sense definitions . | {
"relations": {
"used for": [
{
"head": {
"text": "restricted vocabulary",
"start": 76,
"end": 97
},
"tail": {
"text": "it",
"start": 37,
"end": 39
}
},
{
"head": {
"text": "restricted ... | [] |
The structures generated by the experimental system are intended to be used for the classification of new word senses in terms of the senses of words in the restricted vocabulary . | {
"relations": {
"used for": [
{
"head": {
"text": "restricted vocabulary",
"start": 157,
"end": 178
},
"tail": {
"text": "classification of new word senses",
"start": 84,
"end": 117
}
}
]
}
} | [] |
Thus the work reported addresses two robustness problems faced by current experimental natural language processing systems : coping with an incomplete lexicon and with incomplete knowledge of phrasal constructions . | {
"relations": {
"feature of": [
{
"head": {
"text": "robustness problems",
"start": 37,
"end": 56
},
"tail": {
"text": "natural language processing systems",
"start": 87,
"end": 122
}
}
],
"hyponym of"... | [] |
This paper presents a word segmentation system in France Telecom R&D Beijing , which uses a unified approach to word breaking and OOV identification . | {
"relations": {
"used for": [
{
"head": {
"text": "approach",
"start": 100,
"end": 108
},
"tail": {
"text": "word segmentation system",
"start": 22,
"end": 46
}
},
{
"head": {
"text": "... | [] |
The system participated in all the tracks of the segmentation bakeoff -- PK-open , PK-closed , AS-open , AS-closed , HK-open , HK-closed , MSR-open and MSR - closed -- and achieved the state-of-the-art performance in MSR-open , MSR-close and PK-open tracks . | {
"relations": {
"hyponym of": [
{
"head": {
"text": "PK-open",
"start": 73,
"end": 80
},
"tail": {
"text": "segmentation bakeoff",
"start": 49,
"end": 69
}
},
{
"head": {
"text": "PK-cl... | [] |
This paper describes a method of interactively visualizing and directing the process of translating a sentence . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 23,
"end": 29
},
"tail": {
"text": "interactively visualizing and directing the process of translating",
"start": 33,
"end": 99
}
}
]
... | [] |
The method allows a user to explore a model of syntax-based statistical machine translation -LRB- MT -RRB- , to understand the model 's strengths and weaknesses , and to compare it to other MT systems . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 4,
"end": 10
},
"tail": {
"text": "model",
"start": 38,
"end": 43
}
},
{
"head": {
"text": "model",
"start... | [] |
Using this visualization method , we can find and address conceptual and practical problems in an MT system . | {
"relations": {
"used for": [
{
"head": {
"text": "visualization method",
"start": 11,
"end": 31
},
"tail": {
"text": "MT system",
"start": 98,
"end": 107
}
}
]
}
} | [] |
A method of sense resolution is proposed that is based on WordNet , an on-line lexical database that incorporates semantic relations -LRB- synonymy , antonymy , hyponymy , meronymy , causal and troponymic entailment -RRB- as labeled pointers between word senses . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 2,
"end": 8
},
"tail": {
"text": "sense resolution",
"start": 12,
"end": 28
}
},
{
"head": {
"text": "WordNet",
... | [] |
With WordNet , it is easy to retrieve sets of semantically related words , a facility that will be used for sense resolution during text processing , as follows . | {
"relations": {
"used for": [
{
"head": {
"text": "WordNet",
"start": 5,
"end": 12
},
"tail": {
"text": "semantically related words",
"start": 46,
"end": 72
}
},
{
"head": {
"text": "se... | [] |
Or , -LRB- 2 -RRB- the context of the polysemous word will be used as a key to search a large corpus ; all words found to occur in that context will be noted ; WordNet will then be used to estimate the semantic distance from those words to the alternative senses of the polysemous word ; and that sense will be chosen th... | {
"relations": {
"used for": [
{
"head": {
"text": "WordNet",
"start": 160,
"end": 167
},
"tail": {
"text": "semantic distance",
"start": 202,
"end": 219
}
},
{
"head": {
"text": "proced... | [] |
The interlingual approach to MT has been repeatedly advocated by researchers originally interested in natural language understanding who take machine translation to be one possible application . | {
"relations": {
"used for": [
{
"head": {
"text": "interlingual approach",
"start": 4,
"end": 25
},
"tail": {
"text": "MT",
"start": 29,
"end": 31
}
}
]
}
} | [] |
In contrast , our project , the Mu-project , adopts the transfer approach as the basic framework of MT . | {
"relations": {
"used for": [
{
"head": {
"text": "Mu-project",
"start": 32,
"end": 42
},
"tail": {
"text": "MT",
"start": 100,
"end": 102
}
},
{
"head": {
"text": "transfer approach",
... | [] |
This paper describes the detailed construction of the transfer phase of our system from Japanese to English , and gives some examples of problems which seem difficult to treat in the interlingual approach . | {
"relations": {
"part of": [
{
"head": {
"text": "transfer phase",
"start": 54,
"end": 68
},
"tail": {
"text": "system",
"start": 76,
"end": 82
}
}
]
}
} | [] |
The basic design principles of the transfer phase of our system have already been mentioned in -LRB- 1 -RRB- -LRB- 2 -RRB- . | {
"relations": {
"part of": [
{
"head": {
"text": "transfer phase",
"start": 35,
"end": 49
},
"tail": {
"text": "system",
"start": 57,
"end": 63
}
}
]
}
} | [] |
Some of the principles which are relevant to the topic of this paper are : -LRB- a -RRB- Multiple Layer of Grammars -LRB- b -RRB- Multiple Layer Presentation -LRB- c -RRB- Lexicon Driven Processing -LRB- d -RRB- Form-Oriented Dictionary Description . | {
"relations": {
"part of": [
{
"head": {
"text": "Multiple Layer of Grammars",
"start": 89,
"end": 115
},
"tail": {
"text": "principles",
"start": 12,
"end": 22
}
},
{
"head": {
"text":... | [] |
This paper also shows how these principles are realized in the current system . | {
"relations": {
"part of": [
{
"head": {
"text": "principles",
"start": 32,
"end": 42
},
"tail": {
"text": "system",
"start": 71,
"end": 77
}
}
]
}
} | [] |
In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 51,
"end": 57
},
"tail": {
"text": "discourse segmentation",
"start": 62,
"end": 84
}
},
{
"head": {
"text": "abduct... | [] |
This method is precise and computationally feasible and is supported by previous work in the area of temporal anaphora resolution . | {
"relations": {
"used for": [
{
"head": {
"text": "temporal anaphora resolution",
"start": 101,
"end": 129
},
"tail": {
"text": "method",
"start": 5,
"end": 11
}
}
]
}
} | [] |
This paper describes to what extent deep processing may benefit from shallow techniques and it presents a NLP system which integrates a linguistic PoS tagger and chunker as a preprocessing module of a broad coverage unification based grammar of Spanish . | {
"relations": {
"used for": [
{
"head": {
"text": "shallow techniques",
"start": 69,
"end": 87
},
"tail": {
"text": "deep processing",
"start": 36,
"end": 51
}
},
{
"head": {
"text": "b... | [] |
Experiments show that the efficiency of the overall analysis improves significantly and that our system also provides robustness to the linguistic processing while maintaining both the accuracy and the precision of the grammar . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 97,
"end": 103
},
"tail": {
"text": "linguistic processing",
"start": 136,
"end": 157
}
}
],
"evaluate for": [
{
"head... | [] |
Joint image filters can leverage the guidance image as a prior and transfer the structural details from the guidance image to the target image for suppressing noise or enhancing spatial resolution . | {
"relations": {
"used for": [
{
"head": {
"text": "Joint image filters",
"start": 0,
"end": 19
},
"tail": {
"text": "suppressing noise",
"start": 147,
"end": 164
}
},
{
"head": {
"text"... | [] |
Existing methods rely on various kinds of explicit filter construction or hand-designed objective functions . | {
"relations": {
"used for": [
{
"head": {
"text": "explicit filter construction",
"start": 42,
"end": 70
},
"tail": {
"text": "Existing methods",
"start": 0,
"end": 16
}
},
{
"head": {
... | [] |
It is thus difficult to understand , improve , and accelerate them in a coherent framework . | {
"relations": {
"used for": [
{
"head": {
"text": "coherent framework",
"start": 72,
"end": 90
},
"tail": {
"text": "them",
"start": 62,
"end": 66
}
}
]
}
} | [] |
In this paper , we propose a learning-based approach to construct a joint filter based on Convolution-al Neural Networks . | {
"relations": {
"used for": [
{
"head": {
"text": "learning-based approach",
"start": 29,
"end": 52
},
"tail": {
"text": "joint filter",
"start": 68,
"end": 80
}
},
{
"head": {
"text": ... | [] |
In contrast to existing methods that consider only the guidance image , our method can selectively transfer salient structures that are consistent in both guidance and target images . | {
"relations": {
"compare": [
{
"head": {
"text": "methods",
"start": 24,
"end": 31
},
"tail": {
"text": "method",
"start": 24,
"end": 30
}
}
],
"used for": [
{
"head": {
"text":... | [] |
We show that the model trained on a certain type of data , e.g. , RGB and depth images , generalizes well for other modalities , e.g. , Flash/Non-Flash and RGB/NIR images . | {
"relations": {
"used for": [
{
"head": {
"text": "model",
"start": 17,
"end": 22
},
"tail": {
"text": "modalities",
"start": 116,
"end": 126
}
},
{
"head": {
"text": "data",
... | [] |
We validate the effectiveness of the proposed joint filter through extensive comparisons with state-of-the-art methods . | {
"relations": {
"compare": [
{
"head": {
"text": "joint filter",
"start": 46,
"end": 58
},
"tail": {
"text": "state-of-the-art methods",
"start": 94,
"end": 118
}
}
]
}
} | [] |
In our current research into the design of cognitively well-motivated interfaces relying primarily on the display of graphical information , we have observed that graphical information alone does not provide sufficient support to users - particularly when situations arise that do not simply conform to the users ' expec... | {
"relations": {
"used for": [
{
"head": {
"text": "display of graphical information",
"start": 106,
"end": 138
},
"tail": {
"text": "cognitively well-motivated interfaces",
"start": 43,
"end": 80
}
}
]
}... | [] |
To solve this problem , we are working towards the integration of natural language generation to augment the interaction | {
"relations": {
"used for": [
{
"head": {
"text": "natural language generation",
"start": 66,
"end": 93
},
"tail": {
"text": "interaction",
"start": 109,
"end": 120
}
}
]
}
} | [] |
A central problem of word sense disambiguation -LRB- WSD -RRB- is the lack of manually sense-tagged data required for supervised learning . | {
"relations": {
"used for": [
{
"head": {
"text": "manually sense-tagged data",
"start": 78,
"end": 104
},
"tail": {
"text": "supervised learning",
"start": 118,
"end": 137
}
}
]
}
} | [] |
In this paper , we evaluate an approach to automatically acquire sense-tagged training data from English-Chinese parallel corpora , which are then used for disambiguating the nouns in the SENSEVAL-2 English lexical sample task . | {
"relations": {
"used for": [
{
"head": {
"text": "approach",
"start": 31,
"end": 39
},
"tail": {
"text": "sense-tagged training data",
"start": 65,
"end": 91
}
},
{
"head": {
"text": "... | [] |
Our investigation reveals that this method of acquiring sense-tagged data is promising . | {
"relations": {
"used for": [
{
"head": {
"text": "method",
"start": 36,
"end": 42
},
"tail": {
"text": "acquiring sense-tagged data",
"start": 46,
"end": 73
}
}
]
}
} | [] |
On a subset of the most difficult SENSEVAL-2 nouns , the accuracy difference between the two approaches is only 14.0 % , and the difference could narrow further to 6.5 % if we disregard the advantage that manually sense-tagged data have in their sense coverage . | {
"relations": {
"feature of": [
{
"head": {
"text": "sense coverage",
"start": 246,
"end": 260
},
"tail": {
"text": "manually sense-tagged data",
"start": 205,
"end": 231
}
}
]
}
} | [] |
Our analysis also highlights the importance of the issue of domain dependence in evaluating WSD programs . | {
"relations": {
"feature of": [
{
"head": {
"text": "domain dependence",
"start": 60,
"end": 77
},
"tail": {
"text": "evaluating WSD programs",
"start": 81,
"end": 104
}
}
]
}
} | [] |
This paper presents an analysis of temporal anaphora in sentences which contain quantification over events , within the framework of Discourse Representation Theory . | {
"relations": {
"part of": [
{
"head": {
"text": "quantification over events",
"start": 80,
"end": 106
},
"tail": {
"text": "temporal anaphora",
"start": 35,
"end": 52
}
}
],
"used for": [
{
... | [] |
The analysis in -LRB- Partee , 1984 -RRB- of quantified sentences , introduced by a temporal connective , gives the wrong truth-conditions when the temporal connective in the subordinate clause is before or after . | {
"relations": {
"part of": [
{
"head": {
"text": "temporal connective",
"start": 84,
"end": 103
},
"tail": {
"text": "subordinate clause",
"start": 175,
"end": 193
}
}
]
}
} | [] |
This problem has been previously analyzed in -LRB- de Swart , 1991 -RRB- as an instance of the proportion problem and given a solution from a Generalized Quantifier approach . | {
"relations": {
"used for": [
{
"head": {
"text": "Generalized Quantifier approach",
"start": 142,
"end": 173
},
"tail": {
"text": "problem",
"start": 5,
"end": 12
}
}
]
}
} | [] |
By using a careful distinction between the different notions of reference time based on -LRB- Kamp and Reyle , 1993 -RRB- , we propose a solution to this problem , within the framework of DRT . | {
"relations": {
"used for": [
{
"head": {
"text": "solution",
"start": 137,
"end": 145
},
"tail": {
"text": "problem",
"start": 154,
"end": 161
}
},
{
"head": {
"text": "DRT",
... | [] |
We show some applications of this solution to additional temporal anaphora phenomena in quantified sentences . | {
"relations": {
"used for": [
{
"head": {
"text": "solution",
"start": 34,
"end": 42
},
"tail": {
"text": "temporal anaphora phenomena",
"start": 57,
"end": 84
}
},
{
"head": {
"text": ... | [] |
In this paper , we explore correlation of dependency relation paths to rank candidate answers in answer extraction . | {
"relations": {
"used for": [
{
"head": {
"text": "correlation of dependency relation paths",
"start": 27,
"end": 67
},
"tail": {
"text": "answer extraction",
"start": 97,
"end": 114
}
}
]
}
} | [] |
Using the correlation measure , we compare dependency relations of a candidate answer and mapped question phrases in sentence with the corresponding relations in question . | {
"relations": {
"used for": [
{
"head": {
"text": "correlation measure",
"start": 10,
"end": 29
},
"tail": {
"text": "dependency relations",
"start": 43,
"end": 63
}
}
]
}
} | [] |
Different from previous studies , we propose an approximate phrase mapping algorithm and incorporate the mapping score into the correlation measure . | {
"relations": {
"part of": [
{
"head": {
"text": "mapping score",
"start": 105,
"end": 118
},
"tail": {
"text": "correlation measure",
"start": 128,
"end": 147
}
}
]
}
} | [] |
The correlations are further incorporated into a Maximum Entropy-based ranking model which estimates path weights from training . | {
"relations": {
"part of": [
{
"head": {
"text": "correlations",
"start": 4,
"end": 16
},
"tail": {
"text": "Maximum Entropy-based ranking model",
"start": 49,
"end": 84
}
}
]
}
} | [] |
Experimental results show that our method significantly outperforms state-of-the-art syntactic relation-based methods by up to 20 % in MRR . | {
"relations": {
"compare": [
{
"head": {
"text": "method",
"start": 35,
"end": 41
},
"tail": {
"text": "syntactic relation-based methods",
"start": 85,
"end": 117
}
}
],
"evaluate for": [
{
... | [] |
Evaluation is also crucial to assessing competing claims and identifying promising technical approaches . | {
"relations": {
"used for": [
{
"head": {
"text": "Evaluation",
"start": 0,
"end": 10
},
"tail": {
"text": "approaches",
"start": 93,
"end": 103
}
}
]
}
} | [] |
Recently considerable progress has been made by a number of groups involved in the DARPA Spoken Language Systems -LRB- SLS -RRB- program to agree on a methodology for comparative evaluation of SLS systems , and that methodology has been put into practice several times in comparative tests of several SLS systems . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "methodology",
"start": 151,
"end": 162
},
"tail": {
"text": "evaluation of SLS systems",
"start": 179,
"end": 204
}
},
{
"head": {
... | [] |
These evaluations are probably the only NL evaluations other than the series of Message Understanding Conferences -LRB- Sundheim , 1989 ; Sundheim , 1991 -RRB- to have been developed and used by a group of researchers at different sites , although several excellent workshops have been held to study some of these proble... | {
"relations": {
"hyponym of": [
{
"head": {
"text": "evaluations",
"start": 6,
"end": 17
},
"tail": {
"text": "NL evaluations",
"start": 40,
"end": 54
}
}
],
"conjunction": [
{
"head": {
... | [] |
This paper describes a practical `` black-box '' methodology for automatic evaluation of question-answering NL systems . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "`` black-box '' methodology",
"start": 33,
"end": 60
},
"tail": {
"text": "automatic evaluation of question-answering NL systems",
"start": 65,
"end": 118
}
... | [] |
While each new application domain will require some development of special resources , the heart of the methodology is domain-independent , and it can be used with either speech or text input . | {
"relations": {
"used for": [
{
"head": {
"text": "speech or text input",
"start": 171,
"end": 191
},
"tail": {
"text": "it",
"start": 144,
"end": 146
}
}
]
}
} | [] |
In this paper we present a novel autonomous pipeline to build a personalized parametric model -LRB- pose-driven avatar -RRB- using a single depth sensor . | {
"relations": {
"used for": [
{
"head": {
"text": "autonomous pipeline",
"start": 33,
"end": 52
},
"tail": {
"text": "personalized parametric model -LRB- pose-driven avatar -RRB-",
"start": 64,
"end": 124
}
},... | [] |
We fit each incomplete scan using template fitting techniques with a generic human template , and register all scans to every pose using global consistency constraints . | {
"relations": {
"used for": [
{
"head": {
"text": "human template",
"start": 77,
"end": 91
},
"tail": {
"text": "template fitting techniques",
"start": 34,
"end": 61
}
}
]
}
} | [] |
After registration , these watertight models with different poses are used to train a parametric model in a fashion similar to the SCAPE method . | {
"relations": {
"used for": [
{
"head": {
"text": "watertight models",
"start": 27,
"end": 44
},
"tail": {
"text": "parametric model",
"start": 86,
"end": 102
}
},
{
"head": {
"text": "... | [] |
Once the parametric model is built , it can be used as an anim-itable avatar or more interestingly synthesizing dynamic 3D models from single-view depth videos . | {
"relations": {
"used for": [
{
"head": {
"text": "it",
"start": 37,
"end": 39
},
"tail": {
"text": "anim-itable avatar",
"start": 58,
"end": 76
}
},
{
"head": {
"text": "it",
... | [] |
Experimental results demonstrate the effectiveness of our system to produce dynamic models . | {
"relations": {
"used for": [
{
"head": {
"text": "system",
"start": 58,
"end": 64
},
"tail": {
"text": "dynamic models",
"start": 76,
"end": 90
}
}
]
}
} | [] |
In this paper , we propose a novel algorithm to detect/compensate on-line interference effects when integrating Global Navigation Satellite System -LRB- GNSS -RRB- and Inertial Navigation System -LRB- INS -RRB- . | {
"relations": {
"used for": [
{
"head": {
"text": "algorithm",
"start": 35,
"end": 44
},
"tail": {
"text": "on-line interference effects",
"start": 66,
"end": 94
}
}
],
"conjunction": [
{
... | [] |
The GNSS/INS coupling is usually performed by an Extended Kalman Filter -LRB- EKF -RRB- which yields an accurate and robust localization . | {
"relations": {
"used for": [
{
"head": {
"text": "Extended Kalman Filter -LRB- EKF -RRB-",
"start": 49,
"end": 87
},
"tail": {
"text": "GNSS/INS coupling",
"start": 4,
"end": 21
}
},
{
"head": {... | [] |
We first study the impact of the GNSS noise inflation on the covariance of the EKF outputs so as to compute a least square estimate of the potential variance jumps . | {
"relations": {
"feature of": [
{
"head": {
"text": "EKF outputs",
"start": 79,
"end": 90
},
"tail": {
"text": "covariance",
"start": 61,
"end": 71
}
}
],
"used for": [
{
"head": {
... | [] |
Then , this estimation is used in a Bayesian test which decides whether interference are corrupting the GNSS signal or not . | {
"relations": {
"used for": [
{
"head": {
"text": "estimation",
"start": 12,
"end": 22
},
"tail": {
"text": "Bayesian test",
"start": 36,
"end": 49
}
}
]
}
} | [] |
The results show the performance of the proposed approach on simulated data . | {
"relations": {
"evaluate for": [
{
"head": {
"text": "simulated data",
"start": 61,
"end": 75
},
"tail": {
"text": "approach",
"start": 49,
"end": 57
}
}
]
}
} | [] |
We propose a unified variational formulation for joint motion estimation and segmentation with explicit occlusion handling . | {
"relations": {
"used for": [
{
"head": {
"text": "unified variational formulation",
"start": 13,
"end": 44
},
"tail": {
"text": "joint motion estimation and segmentation",
"start": 49,
"end": 89
}
},
{
... | [] |
We use a convex formulation of the multi-label Potts model with label costs and show that the asymmetric map-uniqueness criterion can be integrated into our formulation by means of convex constraints . | {
"relations": {
"used for": [
{
"head": {
"text": "convex formulation",
"start": 9,
"end": 27
},
"tail": {
"text": "multi-label Potts model",
"start": 35,
"end": 58
}
},
{
"head": {
"te... | [] |
By using a fast primal-dual algorithm we are able to handle several hundred motion segments . | {
"relations": {
"used for": [
{
"head": {
"text": "primal-dual algorithm",
"start": 16,
"end": 37
},
"tail": {
"text": "motion segments",
"start": 76,
"end": 91
}
}
]
}
} | [] |
Two main classes of approaches have been studied to perform monocular nonrigid 3D reconstruction : Template-based methods and Non-rigid Structure from Motion techniques . | {
"relations": {
"used for": [
{
"head": {
"text": "approaches",
"start": 20,
"end": 30
},
"tail": {
"text": "monocular nonrigid 3D reconstruction",
"start": 60,
"end": 96
}
}
],
"hyponym of": [
{... | [] |
While the first ones have been applied to reconstruct poorly-textured surfaces , they assume the availability of a 3D shape model prior to reconstruction . | {
"relations": {
"used for": [
{
"head": {
"text": "ones",
"start": 16,
"end": 20
},
"tail": {
"text": "poorly-textured surfaces",
"start": 54,
"end": 78
}
},
{
"head": {
"text": "3D sha... | [] |
In this paper , we introduce a template-free approach to reconstructing a poorly-textured , deformable surface . | {
"relations": {
"used for": [
{
"head": {
"text": "template-free approach",
"start": 31,
"end": 53
},
"tail": {
"text": "poorly-textured , deformable surface",
"start": 74,
"end": 110
}
}
]
}
} | [] |
To this end , we leverage surface isometry and formulate 3D reconstruction as the joint problem of non-rigid image registration and depth estimation . | {
"relations": {
"used for": [
{
"head": {
"text": "surface isometry",
"start": 26,
"end": 42
},
"tail": {
"text": "3D reconstruction",
"start": 57,
"end": 74
}
},
{
"head": {
"text": "j... | [] |
Our experiments demonstrate that our approach yields much more accurate 3D reconstructions than state-of-the-art techniques . | {
"relations": {
"compare": [
{
"head": {
"text": "approach",
"start": 37,
"end": 45
},
"tail": {
"text": "state-of-the-art techniques",
"start": 96,
"end": 123
}
}
],
"evaluate for": [
{
... | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.