input stringlengths 181 1.95k | output dict | schema listlengths 0 0 |
|---|---|---|
English is shown to be trans-context-free on the basis of coordinations of the respectively type that involve strictly syntactic cross-serial agreement. The agreement in question involves number in nouns and reflexive pronouns and is syntactic rather than semantic in nature because grammatical number in English, like g... | {
"entities": {
"material": [
{
"text": "English",
"start": 0,
"end": 7
},
{
"text": "English",
"start": 305,
"end": 312
},
{
"text": "languages",
"start": 341,
"end": 350
},
{
"text": "French... | [] |
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a low dimensional manifold and can be learned from training data. Based on this assumption, firstly we derived the dimensionality reduction an... | {
"entities": {
"method": [
{
"text": "method",
"start": 23,
"end": 29
},
{
"text": "dimensionality reduction and density estimation algorithm",
"start": 293,
"end": 350
},
{
"text": "object intrinsic representation",
"s... | [] |
In this paper, we present a digital signal processor -LRB- DSP -RRB- implementation of real-time statistical voice conversion -LRB- VC -RRB- for silent speech enhancement and electrolaryngeal speech enhancement. As a silent speech interface, we focus on non-audible murmur -LRB- NAM -RRB-, which can be used in situation... | {
"entities": {
"method": [
{
"text": "digital signal processor -LRB- DSP -RRB- implementation",
"start": 28,
"end": 83
},
{
"text": "real-time statistical voice conversion -LRB- VC -RRB-",
"start": 87,
"end": 140
},
{
"text": "... | [] |
We propose a method that automatically generates paraphrase sets from seed sentences to be used as reference sets in objective machine translation evaluation measures like BLEU and NIST. We measured the quality of the paraphrases produced in an experiment, i.e., -LRB- i -RRB- their grammaticality: at least 99% correct ... | {
"entities": {
"generic": [
{
"text": "method",
"start": 13,
"end": 19
},
{
"text": "method",
"start": 643,
"end": 649
}
],
"other_scientific_term": [
{
"text": "paraphrase",
"start": 49,
"end": 59
... | [] |
Graph unification remains the most expensive part of unification-based grammar parsing. We focus on one speed-up element in the design of unification algorithms: avoidance of copying of unmodified subgraphs. We propose a method of attaining such a design through a method of structure-sharing which avoids log -LRB- d -R... | {
"entities": {
"task": [
{
"text": "Graph unification",
"start": 0,
"end": 17
},
{
"text": "unification-based grammar parsing",
"start": 53,
"end": 86
}
],
"method": [
{
"text": "speed-up element",
"start": 104,... | [] |
We describe a novel technique and implemented system for constructing a subcategorization dictionary from textual corpora. Each dictionary entry encodes the relative frequency of occurrence of a comprehensive set of subcategorization classes for English. An initial experiment, on a sample of 14 verbs which exhibit mult... | {
"entities": {
"generic": [
{
"text": "system",
"start": 46,
"end": 52
},
{
"text": "system",
"start": 586,
"end": 592
}
],
"other_scientific_term": [
{
"text": "subcategorization dictionary",
"start": 72,
... | [] |
The introduction of prior knowledge has greatly enhanced numerous purely low-level driven image processing algorithms. In this work, we focus on the problem of non-rigid image registration. A number of powerful registration criteria have been developed in the last decade, most prominently the criterion of maximum mutua... | {
"entities": {
"other_scientific_term": [
{
"text": "prior knowledge",
"start": 20,
"end": 35
},
{
"text": "low-level information",
"start": 527,
"end": 548
},
{
"text": "noise",
"start": 570,
"end": 575
}... | [] |
There is an increased interest in the efficient creation of city models, be it virtual or as-built. We present a method for synthesizing complex, photo-realistic facade images, from a single example. After parsing the example image into its semantic components, a tiling for it is generated. Novel tilings can then be cr... | {
"entities": {
"task": [
{
"text": "creation of city models",
"start": 48,
"end": 71
},
{
"text": "synthesizing complex, photo-realistic facade images",
"start": 124,
"end": 175
}
],
"generic": [
{
"text": "method",
... | [] |
We introduce a new interactive corpus exploration tool called InfoMagnets. InfoMagnets aims at making exploratory corpus analysis accessible to researchers who are not experts in text mining. As evidence of its usefulness and usability, it has been used successfully in a research context to uncover relationships betwee... | {
"entities": {
"method": [
{
"text": "interactive corpus exploration tool",
"start": 19,
"end": 54
},
{
"text": "InfoMagnets",
"start": 62,
"end": 73
},
{
"text": "InfoMagnets",
"start": 75,
"end": 86
},
... | [] |
Sources of training data suitable for language modeling of conversational speech are limited. In this paper, we show how training data can be supplemented with text from the web filtered to match the style and/or topic of the target recognition task, but also that it is possible to get bigger performance gains from the... | {
"entities": {
"method": [
{
"text": "language modeling",
"start": 38,
"end": 55
},
{
"text": "class-dependent interpolation of N-grams",
"start": 335,
"end": 375
}
],
"material": [
{
"text": "conversational speech",
... | [] |
We present a method for detecting 3D objects using multi-modalities. While it is generic, we demonstrate it on the combination of an image and a dense depth map which give complementary object information. It works in real-time, under heavy clutter, does not require a time consuming training stage, and can handle untex... | {
"entities": {
"generic": [
{
"text": "method",
"start": 13,
"end": 19
},
{
"text": "it",
"start": 62,
"end": 64
},
{
"text": "it",
"start": 75,
"end": 77
},
{
"text": "It",
"start": ... | [] |
The compact description of a video sequence through a single image map and a dominant motion has applications in several domains, including video browsing and retrieval, compression, mosaicing, and visual summarization. Building such a representation requires the capability to register all the frames with respect to th... | {
"entities": {
"task": [
{
"text": "compact description of a video sequence",
"start": 4,
"end": 43
},
{
"text": "video browsing and retrieval",
"start": 140,
"end": 168
},
{
"text": "compression",
"start": 170,
... | [] |
In cross-domain learning, there is a more challenging problem that the domain divergence involves more than one dominant factors, e.g., different viewpoints, various resolutions and changing illuminations. Fortunately, an intermediate domain could often be found to build a bridge across them to facilitate the learning ... | {
"entities": {
"task": [
{
"text": "cross-domain learning",
"start": 3,
"end": 24
},
{
"text": "learning problem",
"start": 311,
"end": 327
},
{
"text": "cross-domain problem",
"start": 427,
"end": 447
}
... | [] |
In this paper, we aim to automatically render aging faces in a personalized way. Basically, a set of age-group specific dictionaries are learned, where the dictionary bases corresponding to the same index yet from different dictionaries form a particular aging process pattern cross different age groups, and a linear co... | {
"entities": {
"other_scientific_term": [
{
"text": "aging faces",
"start": 46,
"end": 57
},
{
"text": "dictionary bases",
"start": 156,
"end": 172
},
{
"text": "aging process pattern",
"start": 255,
"end": 276
... | [] |
We propose a draft scheme of the model formalizing the structure of communicative context in dialogue interaction. The relationships between the interacting partners are considered as system of three automata representing the partners of the dialogue and environment. | {
"entities": {
"generic": [
{
"text": "model",
"start": 33,
"end": 38
}
],
"other_scientific_term": [
{
"text": "structure of communicative context",
"start": 55,
"end": 89
}
],
"material": [
{
"text": "dialogue... | [] |
Visitors who browse the web from wireless PDAs, cell phones, and pagers are frequently stymied by web interfaces optimized for desktop PCs. Simply replacing graphics with text and reformatting tables does not solve the problem, because deep link structures can still require minutes to traverse. In this paper we develop... | {
"entities": {
"method": [
{
"text": "web interfaces",
"start": 98,
"end": 112
},
{
"text": "MINPATH",
"start": 335,
"end": 342
},
{
"text": "MINPATH",
"start": 446,
"end": 453
},
{
"text": "... | [] |
This paper describes a particular approach to parsing that utilizes recent advances in unification-based parsing and in classification-based knowledge representation. As unification-based grammatical frameworks are extended to handle richer descriptions of linguistic information, they begin to share many of the propert... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 34,
"end": 42
},
{
"text": "they",
"start": 281,
"end": 285
},
{
"text": "system",
"start": 389,
"end": 395
}
],
"task": [
{
... | [] |
In this paper we discuss a proposed user knowledge modeling architecture for the ICICLE system, a language tutoring application for deaf learners of written English. The model will represent the language proficiency of the user and is designed to be referenced during both writing analysis and feedback production. We mo... | {
"entities": {
"method": [
{
"text": "user knowledge modeling architecture",
"start": 36,
"end": 72
}
],
"task": [
{
"text": "ICICLE system",
"start": 81,
"end": 94
},
{
"text": "language tutoring application",
... | [] |
Constraint propagation is one of the key techniques in constraint programming, and a large body of work has built up around it. Special-purpose constraint propagation algorithms frequently make implicit use of short supports -- by examining a subset of the variables, they can infer support -LRB- a justification that a ... | {
"entities": {
"method": [
{
"text": "Constraint propagation",
"start": 0,
"end": 22
},
{
"text": "constraint programming",
"start": 55,
"end": 77
},
{
"text": "Special-purpose constraint propagation algorithms",
"start... | [] |
We propose a detection method for orthographic variants caused by transliteration in a large corpus. The method employs two similarities. One is string similarity based on edit distance. The other is contextual similarity by a vector space model. Experimental results show that the method performed a 0.889 F-measure in ... | {
"entities": {
"method": [
{
"text": "detection method",
"start": 13,
"end": 29
},
{
"text": "edit distance",
"start": 172,
"end": 185
},
{
"text": "vector space model",
"start": 227,
"end": 245
}
],
... | [] |
Uncertainty handling plays an important role during shape tracking. We have recently shown that the fusion of measurement information with system dynamics and shape priors greatly improves the tracking performance for very noisy images such as ultrasound sequences -LSB- 22 -RSB-. Nevertheless, this approach required us... | {
"entities": {
"task": [
{
"text": "Uncertainty handling",
"start": 0,
"end": 20
},
{
"text": "shape tracking",
"start": 52,
"end": 66
},
{
"text": "tracking",
"start": 58,
"end": 66
},
{
"te... | [] |
We present a syntax-based constraint for word alignment, known as the cohesion constraint. It requires disjoint English phrases to be mapped to non-overlapping intervals in the French sentence. We evaluate the utility of this constraint in two different algorithms. The results show that it can provide a significant imp... | {
"entities": {
"other_scientific_term": [
{
"text": "syntax-based constraint",
"start": 13,
"end": 36
},
{
"text": "cohesion constraint",
"start": 70,
"end": 89
}
],
"task": [
{
"text": "word alignment",
"start"... | [] |
This paper considers the problem of automatic assessment of local coherence. We present a novel entity-based representation of discourse which is inspired by Centering Theory and can be computed automatically from raw text. We view coherence assessment as a ranking learning problem and show that the proposed discourse ... | {
"entities": {
"task": [
{
"text": "automatic assessment of local coherence",
"start": 36,
"end": 75
},
{
"text": "coherence assessment",
"start": 232,
"end": 252
},
{
"text": "ranking learning problem",
"start": 258,
... | [] |
This paper introduces a robust interactive method for speech understanding. The generalized LR parsing is enhanced in this approach. Parsing proceeds from left to right correcting minor errors. When a very noisy portion is detected, the parser skips that portion using a fake non-terminal symbol. The unidentified portio... | {
"entities": {
"generic": [
{
"text": "robust interactive method",
"start": 24,
"end": 49
},
{
"text": "approach",
"start": 123,
"end": 131
},
{
"text": "method",
"start": 43,
"end": 49
},
{
... | [] |
This paper shows that it is very often possible to identify the source language of medium-length speeches in the EUROPARL corpus on the basis of frequency counts of word n-grams -LRB- 87.2% -96.7% accuracy depending on classification method -RRB-. The paper also examines in detail which positive markers are most powerf... | {
"entities": {
"material": [
{
"text": "medium-length speeches",
"start": 83,
"end": 105
},
{
"text": "EUROPARL corpus",
"start": 113,
"end": 128
}
],
"method": [
{
"text": "frequency counts of word n-grams",
"s... | [] |
We investigated whether automatic phonetic transcriptions -LRB- APTs -RRB- can replace manually verified phonetic transcriptions -LRB- MPTs -RRB- in a large corpus-based study on pronunciation variation. To this end, we compared the performance of both transcription types in a classification experiment aimed at establi... | {
"entities": {
"other_scientific_term": [
{
"text": "automatic phonetic transcriptions -LRB- APTs -RRB-",
"start": 24,
"end": 74
},
{
"text": "manually verified phonetic transcriptions",
"start": 87,
"end": 128
},
{
"text": "al... | [] |
Machine reading is a relatively new field that features computer programs designed to read flowing text and extract fact assertions expressed by the narrative content. This task involves two core technologies: natural language processing -LRB- NLP -RRB- and information extraction -LRB- IE -RRB-. In this paper we descri... | {
"entities": {
"task": [
{
"text": "Machine reading",
"start": 0,
"end": 15
},
{
"text": "information extraction -LRB- IE -RRB-",
"start": 258,
"end": 295
},
{
"text": "machine reading system",
"start": 325,
"en... | [] |
Nonstationary chaotic behavior is not an oxymoron. We present two methods for capturing nonstationary chaos, then present a few examples including biological signals, ocean waves and traffic flow. The issue is of practical interest because it is often useful to capture when nonstationary events take place and it is des... | {
"entities": {
"other_scientific_term": [
{
"text": "Nonstationary chaotic behavior",
"start": 0,
"end": 30
},
{
"text": "oxymoron",
"start": 41,
"end": 49
},
{
"text": "nonstationary chaos",
"start": 88,
"end":... | [] |
This paper presents a formal analysis for a large class of words called alternative markers, which includes other -LRB- than -RRB-, such -LRB- as -RRB-, and besides. These words appear frequently enough in dialog to warrant serious attention, yet present natural language search engines perform poorly on queries contain... | {
"entities": {
"method": [
{
"text": "formal analysis",
"start": 22,
"end": 37
},
{
"text": "natural language search engines",
"start": 255,
"end": 286
},
{
"text": "search engine",
"start": 272,
"end": 285
... | [] |
In this paper, we address the problem of combining several language models -LRB- LMs -RRB-. We find that simple interpolation methods, like log-linear and linear interpolation, improve the performance but fall short of the performance of an oracle. The oracle knows the reference word string and selects the word string ... | {
"entities": {
"method": [
{
"text": "language models -LRB- LMs -RRB-",
"start": 59,
"end": 90
},
{
"text": "interpolation methods",
"start": 112,
"end": 133
},
{
"text": "log-linear and linear interpolation",
"start": ... | [] |
We describe a new method for the representation of NLP structures within reranking approaches. We make use of a conditional log-linear model, with hidden variables representing the assignment of lexical items to word clusters or word senses. The model learns to automatically make these assignments based on a discrimina... | {
"entities": {
"generic": [
{
"text": "method",
"start": 18,
"end": 24
},
{
"text": "model",
"start": 135,
"end": 140
},
{
"text": "model",
"start": 246,
"end": 251
},
{
"text": "summations",... | [] |
This paper presents an algorithm for learning the time-varying shape of a non-rigid 3D object from uncalibrated 2D tracking data. We model shape motion as a rigid component -LRB- rotation and translation -RRB- combined with a non-rigid deformation. Reconstruction is ill-posed if arbitrary deformations are allowed. We c... | {
"entities": {
"generic": [
{
"text": "algorithm",
"start": 23,
"end": 32
},
{
"text": "algorithm",
"start": 465,
"end": 474
},
{
"text": "algorithm",
"start": 642,
"end": 651
},
{
"text": "i... | [] |
Automatic summarization and information extraction are two important Internet services. MUC and SUMMAC play their appropriate roles in the next generation Internet. This paper focuses on the automatic summarization and proposes two different models to extract sentences for summary generation under two tasks initiated b... | {
"entities": {
"task": [
{
"text": "Automatic summarization",
"start": 0,
"end": 23
},
{
"text": "information extraction",
"start": 28,
"end": 50
},
{
"text": "automatic summarization",
"start": 191,
"end": 214
... | [] |
In real-world action recognition problems, low-level features can not adequately characterize the rich spatial-temporal structures in action videos. In this work, we encode actions based on attributes that describes actions as high-level concepts e.g., jump forward or motion in the air. We base our analysis on two type... | {
"entities": {
"task": [
{
"text": "real-world action recognition problems",
"start": 3,
"end": 41
},
{
"text": "submodular optimization problem",
"start": 818,
"end": 849
}
],
"other_scientific_term": [
{
"text": "low-... | [] |
This paper reports a completed stage of ongoing research at the University of York. Landsbergen's advocacy of analytical inverses for compositional syntax rules encourages the application of Definite Clause Grammar techniques to the construction of a parser returning Montague analysis trees. A parser MDCC is presented ... | {
"entities": {
"method": [
{
"text": "analytical inverses",
"start": 110,
"end": 129
},
{
"text": "Definite Clause Grammar techniques",
"start": 191,
"end": 225
},
{
"text": "parser MDCC",
"start": 295,
"end": 3... | [] |
Despite their success, convolutional neural networks are computationally expensive because they must examine all image locations. Stochastic attention-based models have been shown to improve computational efficiency at test time, but they remain difficult to train because of intractable posterior inference and high var... | {
"entities": {
"method": [
{
"text": "convolutional neural networks",
"start": 23,
"end": 52
},
{
"text": "Stochastic attention-based models",
"start": 130,
"end": 163
},
{
"text": "Borrowing techniques",
"start": 364,
... | [] |
A new exemplar-based framework unifying image completion, texture synthesis and image inpainting is presented in this work. Contrary to existing greedy techniques, these tasks are posed in the form of a discrete global optimization problem with a well defined objective function. For solving this problem a novel optimiz... | {
"entities": {
"method": [
{
"text": "exemplar-based framework",
"start": 6,
"end": 30
},
{
"text": "greedy techniques",
"start": 145,
"end": 162
},
{
"text": "optimization scheme",
"start": 313,
"end": 332
... | [] |
In this paper, we compare the relative effects of segment order, segmentation and segment contiguity on the retrieval performance of a translation memory system. We take a selection of both bag-of-words and segment order-sensitive string comparison methods, and run each over both character-and word-segmented data, in c... | {
"entities": {
"other_scientific_term": [
{
"text": "segment order",
"start": 50,
"end": 63
},
{
"text": "segmentation",
"start": 65,
"end": 77
},
{
"text": "segment contiguity",
"start": 82,
"end": 100
}
... | [] |
In this paper we show how two standard outputs from information extraction -LRB- IE -RRB- systems-named entity annotations and scenario templates-can be used to enhance access to text collections via a standard text browser. We describe how this information is used in a prototype system designed to support information ... | {
"entities": {
"generic": [
{
"text": "outputs",
"start": 39,
"end": 46
},
{
"text": "prototype system",
"start": 271,
"end": 287
},
{
"text": "system",
"start": 90,
"end": 96
}
],
"method": [
... | [] |
We present a new model-based bundle adjustment algorithm to recover the 3D model of a scene/object from a sequence of images with unknown motions. Instead of representing scene/object by a collection of isolated 3D features -LRB- usually points -RRB-, our algorithm uses a surface controlled by a small set of parameters... | {
"entities": {
"method": [
{
"text": "model-based bundle adjustment algorithm",
"start": 17,
"end": 56
},
{
"text": "3D model",
"start": 72,
"end": 80
},
{
"text": "posed system",
"start": 961,
"end": 973
... | [] |
This paper presents an approach to the unsupervised learning of parts of speech which uses both morphological and syntactic information. While the model is more complex than those which have been employed for unsupervised learning of POS tags in English, which use only syntactic information, the variety of languages in... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 23,
"end": 31
},
{
"text": "model",
"start": 147,
"end": 152
},
{
"text": "those",
"start": 174,
"end": 179
},
{
"text": "computatio... | [] |
Words in Chinese text are not naturally separated by delimiters, which poses a challenge to standard machine translation -LRB- MT -RRB- systems. In MT, the widely used approach is to apply a Chinese word segmenter trained from manually annotated data, using a fixed lexicon. Such word segmentation is not necessarily opt... | {
"entities": {
"material": [
{
"text": "Chinese text",
"start": 9,
"end": 21
},
{
"text": "manually annotated data",
"start": 227,
"end": 250
}
],
"task": [
{
"text": "machine translation -LRB- MT -RRB- systems",
... | [] |
In this paper we compare two competing approaches to part-of-speech tagging, statistical and constraint-based disambiguation, using French as our test language. We imposed a time limit on our experiment: the amount of time spent on the design of our constraint system was about the same as the time we used to train and ... | {
"entities": {
"generic": [
{
"text": "approaches",
"start": 39,
"end": 49
},
{
"text": "constraint system",
"start": 250,
"end": 267
},
{
"text": "systems",
"start": 386,
"end": 393
}
],
"task": [... | [] |
Structured-light methods actively generate geometric correspondence data between projectors and cameras in order to facilitate robust 3D reconstruction. In this paper, we present Photogeometric Structured Light whereby a standard structured light method is extended to include photometric methods. Photometric processing... | {
"entities": {
"method": [
{
"text": "Structured-light methods",
"start": 0,
"end": 24
},
{
"text": "Photogeometric Structured Light",
"start": 179,
"end": 210
},
{
"text": "structured light method",
"start": 230,
... | [] |
In this paper, a discrimination and robustness oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of insufficient training data and approximation error introduced by the language model, traditional statistical approaches, which resolve ambiguit... | {
"entities": {
"method": [
{
"text": "adaptive learning procedure",
"start": 56,
"end": 83
},
{
"text": "language model",
"start": 246,
"end": 260
},
{
"text": "statistical approaches",
"start": 274,
"end": 296
... | [] |
This paper presents a new approach to statistical sentence generation in which alternative phrases are represented as packed sets of trees, or forests, and then ranked statistically to choose the best one. This representation offers advantages in compactness and in the ability to represent syntactic information. It als... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 26,
"end": 34
},
{
"text": "representation",
"start": 211,
"end": 225
},
{
"text": "It",
"start": 314,
"end": 316
},
{
"text": "appr... | [] |
This article deals with the interpretation of conceptual operations underlying the communicative use of natural language -LRB- NL -RRB- within the Structured Inheritance Network -LRB- SI-Nets -RRB- paradigm. The operations are reduced to functions of a formal language, thus changing the level of abstraction of the oper... | {
"entities": {
"task": [
{
"text": "conceptual operations",
"start": 46,
"end": 67
}
],
"material": [
{
"text": "natural language -LRB- NL -RRB-",
"start": 104,
"end": 135
},
{
"text": "NL",
"start": 127,
... | [] |
We present an algorithm for calibrated camera relative pose estimation from lines. Given three lines with two of the lines parallel and orthogonal to the third we can compute the relative rotation between two images. We can also compute the relative translation from two intersection points. We also present a framework ... | {
"entities": {
"generic": [
{
"text": "algorithm",
"start": 14,
"end": 23
},
{
"text": "framework",
"start": 310,
"end": 319
},
{
"text": "algorithm",
"start": 392,
"end": 401
},
{
"text": "a... | [] |
In this paper, we present a fully automated extraction system, named IntEx, to identify gene and protein interactions in biomedical text. Our approach is based on first splitting complex sentences into simple clausal structures made up of syntactic roles. Then, tagging biological entities with the help of biomedical an... | {
"entities": {
"method": [
{
"text": "fully automated extraction system",
"start": 28,
"end": 61
},
{
"text": "IntEx",
"start": 69,
"end": 74
},
{
"text": "extraction system",
"start": 44,
"end": 61
},
... | [] |
This paper introduces a method for computational analysis of move structures in abstracts of research articles. In our approach, sentences in a given abstract are analyzed and labeled with a specific move in light of various rhetorical functions. The method involves automatically gathering a large number of abstracts f... | {
"entities": {
"generic": [
{
"text": "method",
"start": 24,
"end": 30
},
{
"text": "approach",
"start": 119,
"end": 127
},
{
"text": "method",
"start": 251,
"end": 257
},
{
"text": "system",... | [] |
This work presents a real-time system for multiple object tracking in dynamic scenes. A unique characteristic of the system is its ability to cope with long-duration and complete occlusion without a prior knowledge about the shape or motion of objects. The system produces good segment and tracking results at a frame ra... | {
"entities": {
"method": [
{
"text": "real-time system",
"start": 21,
"end": 37
}
],
"task": [
{
"text": "multiple object tracking in dynamic scenes",
"start": 42,
"end": 84
},
{
"text": "tracking",
"start": 58,... | [] |
We propose a method of organizing reading materials for vocabulary learning. It enables us to select a concise set of reading texts -LRB- from a target corpus -RRB- that contains all the target vocabulary to be learned. We used a specialized vocabulary for an English certification test as the target vocabulary and used... | {
"entities": {
"generic": [
{
"text": "method",
"start": 13,
"end": 19
},
{
"text": "It",
"start": 77,
"end": 79
}
],
"task": [
{
"text": "organizing reading materials",
"start": 23,
"end": 51
},
... | [] |
A novel bootstrapping approach to Named Entity -LRB- NE -RRB- tagging using concept-based seeds and successive learners is presented. This approach only requires a few common noun or pronoun seeds that correspond to the concept for the targeted NE, e.g. he/she/man/woman for PERSON NE. The bootstrapping procedure is imp... | {
"entities": {
"method": [
{
"text": "bootstrapping approach",
"start": 8,
"end": 30
},
{
"text": "successive learners",
"start": 100,
"end": 119
},
{
"text": "bootstrapping procedure",
"start": 290,
"end": 313
... | [] |
We present the first known empirical test of an increasingly common speculative claim, by evaluating a representative Chinese-to-English SMT model directly on word sense disambiguation performance, using standard WSD evaluation methodology and datasets from the Senseval-3 Chinese lexical sample task. Much effort has be... | {
"entities": {
"method": [
{
"text": "Chinese-to-English SMT model",
"start": 118,
"end": 146
},
{
"text": "WSD evaluation methodology",
"start": 213,
"end": 239
},
{
"text": "dedicated word sense disambiguation -LRB- WSD -RRB-... | [] |
In this paper we present a novel, customizable: IE paradigm that takes advantage of predicate-argument structures. We also introduce a new way of automatically identifying predicate argument structures, which is central to our IE paradigm. It is based on: -LRB- 1 -RRB- an extended set of features; and -LRB- 2 -RRB- ind... | {
"entities": {
"method": [
{
"text": "IE paradigm",
"start": 48,
"end": 59
},
{
"text": "IE paradigm",
"start": 227,
"end": 238
},
{
"text": "inductive decision tree learning",
"start": 317,
"end": 349
}
... | [] |
In this paper we present a statistical profile of the Named Entity task, a specific information extraction task for which corpora in several languages are available. Using the results of the statistical analysis, we propose an algorithm for lower bound estimation for Named Entity corpora and discuss the significance of... | {
"entities": {
"generic": [
{
"text": "statistical profile",
"start": 27,
"end": 46
},
{
"text": "algorithm",
"start": 227,
"end": 236
},
{
"text": "analysis",
"start": 203,
"end": 211
}
],
"task":... | [] |
We attack an inexplicably under-explored language genre of spoken language -- lyrics in music -- via completely unsuper-vised induction of an SMT-style stochastic transduction grammar for hip hop lyrics, yielding a fully-automatically learned challenge-response system that produces rhyming lyrics given an input. Unlike... | {
"entities": {
"material": [
{
"text": "under-explored language genre of spoken language",
"start": 26,
"end": 74
},
{
"text": "lyrics in music",
"start": 78,
"end": 93
},
{
"text": "hip hop lyrics",
"start": 188,
... | [] |
In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches that have been proposed for predicting top-level topic shifts to the problem of identifying subtopic boundaries. We then explore the impact ... | {
"entities": {
"task": [
{
"text": "predicting segment boundaries",
"start": 59,
"end": 88
},
{
"text": "predicting top-level topic shifts",
"start": 208,
"end": 241
},
{
"text": "identifying subtopic boundaries",
"star... | [] |
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than one and out-degree greater than one. We create a word-trie, transform it into a minimal DFA, then identify hubs. Those hubs mark the boundary ... | {
"entities": {
"method": [
{
"text": "unsupervised technique",
"start": 21,
"end": 43
},
{
"text": "word-trie",
"start": 227,
"end": 236
}
],
"task": [
{
"text": "morphology",
"start": 57,
"end": 67
... | [] |
In Bayesian machine learning, conjugate priors are popular, mostly due to mathematical convenience. In this paper, we show that there are deeper reasons for choosing a conjugate prior. Specifically, we formulate the conjugate prior in the form of Bregman divergence and show that it is the inherent geometry of conjugate... | {
"entities": {
"task": [
{
"text": "Bayesian machine learning",
"start": 3,
"end": 28
},
{
"text": "semi-supervised learning",
"start": 725,
"end": 749
}
],
"other_scientific_term": [
{
"text": "conjugate priors",
... | [] |
This paper defines a generative probabilistic model of parse trees, which we call PCFG-LA. This model is an extension of PCFG in which non-terminal symbols are augmented with latent variables. Finegrained CFG rules are automatically induced from a parsed corpus by training a PCFG-LA model using an EM-algorithm. Because... | {
"entities": {
"method": [
{
"text": "generative probabilistic model of parse trees",
"start": 21,
"end": 66
},
{
"text": "PCFG-LA",
"start": 82,
"end": 89
},
{
"text": "PCFG",
"start": 82,
"end": 86
},
... | [] |
This paper reports on two contributions to large vocabulary continuous speech recognition. First, we present a new paradigm for speaker-independent -LRB- SI -RRB- training of hidden Markov models -LRB- HMM -RRB-, which uses a large amount of speech from a few speakers instead of the traditional practice of using a litt... | {
"entities": {
"task": [
{
"text": "large vocabulary continuous speech recognition",
"start": 43,
"end": 89
},
{
"text": "speaker-independent -LRB- SI -RRB- training of hidden Markov models -LRB- HMM -RRB-",
"start": 128,
"end": 211
},
... | [] |
In this paper, we show how to construct a transfer dictionary automatically. Dictionary construction, one of the most difficult tasks in developing a machine translation system, is expensive. To avoid this problem, we investigate how we build a dictionary using existing linguistic resources. Our algorithm can be applie... | {
"entities": {
"material": [
{
"text": "transfer dictionary",
"start": 42,
"end": 61
},
{
"text": "linguistic resources",
"start": 271,
"end": 291
},
{
"text": "Korean-to-Japanese dictionary",
"start": 388,
"end... | [] |
An empirical comparison of CFG filtering techniques for LTAG and HPSG is presented. We demonstrate that an approximation of HPSG produces a more effective CFG filter than that of LTAG. We also investigate the reason for that difference. | {
"entities": {
"method": [
{
"text": "CFG filtering techniques",
"start": 27,
"end": 51
},
{
"text": "LTAG",
"start": 56,
"end": 60
},
{
"text": "HPSG",
"start": 65,
"end": 69
},
{
"text": "a... | [] |
Syntax-based statistical machine translation -LRB- MT -RRB- aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a version o... | {
"entities": {
"task": [
{
"text": "Syntax-based statistical machine translation -LRB- MT -RRB-",
"start": 0,
"end": 59
},
{
"text": "syntax-based statistical machine translation system",
"start": 144,
"end": 195
},
{
"text": "... | [] |
We propose a framework to derive the distance between concepts from distributional measures of word co-occurrences. We use the categories in a published thesaurus as coarse-grained concepts, allowing all possible distance values to be stored in a concept-concept matrix roughly .01% the size of that created by existing ... | {
"entities": {
"generic": [
{
"text": "framework",
"start": 13,
"end": 22
},
{
"text": "tasks",
"start": 456,
"end": 461
},
{
"text": "task",
"start": 456,
"end": 460
}
],
"other_scientific_term": ... | [] |
We focus on the problem of building large repositories of lexical conceptual structure -LRB- LCS -RRB- representations for verbs in multiple languages. One of the main results of this work is the definition of a relation between broad semantic classes and LCS meaning components. Our acquisition program-LEXICALL-takes, ... | {
"entities": {
"method": [
{
"text": "lexical conceptual structure -LRB- LCS -RRB- representations",
"start": 58,
"end": 118
},
{
"text": "LCS meaning components",
"start": 256,
"end": 278
},
{
"text": "acquisition program-LEXI... | [] |
The theoretical study of the range concatenation grammar -LSB- RCG -RSB- formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages -LSB- RCL -RSB- can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent R... | {
"entities": {
"method": [
{
"text": "range concatenation grammar -LSB- RCG -RSB- formalism",
"start": 29,
"end": 82
},
{
"text": "grammatical formalisms",
"start": 262,
"end": 284
},
{
"text": "RCGs",
"start": 319,
... | [] |
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning -LRB- Watkins, 1989 -RRB-, and which we apply to the solution of symmetric and asym-metric instances of the traveling salesman problem -LRB- TSP -RRB-. Ant-Q algorithms were inspired by work on the ant system -LRB- ... | {
"entities": {
"method": [
{
"text": "Ant-Q",
"start": 27,
"end": 32
},
{
"text": "Q-learning",
"start": 94,
"end": 104
},
{
"text": "Ant-Q algorithms",
"start": 257,
"end": 273
},
{
"text": ... | [] |
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptualized as a semi-Riemannian manifold which is considered as a submanifold embedded in an ambient semi-Riemannian space. The class structures ... | {
"entities": {
"method": [
{
"text": "geometric framework",
"start": 28,
"end": 47
},
{
"text": "smoothing of discrete functions",
"start": 476,
"end": 507
},
{
"text": "geometrization of class structures",
"start": 567... | [] |
A deterministic parser is under development which represents a departure from traditional deterministic parsers in that it combines both symbolic and connectionist components. The connectionist component is trained either from patterns derived from the rules of a deterministic grammar. The development and evolution of ... | {
"entities": {
"method": [
{
"text": "deterministic parser",
"start": 2,
"end": 22
},
{
"text": "deterministic parsers",
"start": 90,
"end": 111
},
{
"text": "symbolic and connectionist components",
"start": 137,
... | [] |
Robust natural language interpretation requires strong semantic domain models, fail-soft recovery heuristics, and very flexible control structures. Although single-strategy parsers have met with a measure of success, a multi-strategy approach is shown to provide a much higher degree of flexibility, redundancy, and abil... | {
"entities": {
"task": [
{
"text": "natural language interpretation",
"start": 7,
"end": 38
}
],
"method": [
{
"text": "semantic domain models",
"start": 55,
"end": 77
},
{
"text": "fail-soft recovery heuristics",
... | [] |
Recently, Stacked Auto-Encoders -LRB- SAE -RRB- have been successfully used for learning imbalanced datasets. In this paper, for the first time, we propose to use a Neural Network classifier furnished by an SAE structure for detecting the errors made by a strong Automatic Speech Recognition -LRB- ASR -RRB- system. Erro... | {
"entities": {
"method": [
{
"text": "Stacked Auto-Encoders -LRB- SAE -RRB-",
"start": 10,
"end": 47
},
{
"text": "Neural Network classifier",
"start": 165,
"end": 190
},
{
"text": "SAE structure",
"start": 207,
... | [] |
Within the EU Network of Excellence PASCAL, a challenge was organized to design a statistical machine learning algorithm that segments words into the smallest meaning-bearing units of language, morphemes. Ideally, these are basic vocabulary units suitable for different tasks, such as speech and text understanding, mach... | {
"entities": {
"method": [
{
"text": "statistical machine learning algorithm",
"start": 82,
"end": 120
},
{
"text": "segmen-tation algorithms",
"start": 569,
"end": 593
},
{
"text": "statistical n-gram language models",
... | [] |
This paper describes a recently collected spoken language corpus for the ATIS -LRB- Air Travel Information System -RRB- domain. This data collection effort has been co-ordinated by MADCOW -LRB- Multi-site ATIS Data COllection Working group -RRB-. We summarize the motivation for this effort, the goals, the implementatio... | {
"entities": {
"material": [
{
"text": "spoken language corpus",
"start": 42,
"end": 64
},
{
"text": "spontaneous speech",
"start": 468,
"end": 486
}
],
"task": [
{
"text": "ATIS -LRB- Air Travel Information System -RRB... | [] |
This paper proposes the Hierarchical Directed Acyclic Graph -LRB- HDAG -RRB- Kernel for structured natural language data. The HDAG Kernel directly accepts several levels of both chunks and their relations, and then efficiently computes the weighed sum of the number of common attribute sequences of the HDAGs. We applied... | {
"entities": {
"method": [
{
"text": "Hierarchical Directed Acyclic Graph -LRB- HDAG -RRB- Kernel",
"start": 24,
"end": 83
},
{
"text": "HDAG Kernel",
"start": 126,
"end": 137
},
{
"text": "HDAGs",
"start": 303,
... | [] |
We propose a solution to the challenge of the CoNLL 2008 shared task that uses a generative history-based latent variable model to predict the most likely derivation of a synchronous dependency parser for both syntactic and semantic dependencies. The submitted model yields 79.1% macro-average F1 performance, for the jo... | {
"entities": {
"task": [
{
"text": "CoNLL 2008 shared task",
"start": 46,
"end": 68
},
{
"text": "synchronous dependency parser",
"start": 171,
"end": 200
}
],
"method": [
{
"text": "generative history-based latent vari... | [] |
This paper describes a new, large scale discourse-level annotation project-the Penn Discourse TreeBank -LRB- PDTB -RRB-. We present an approach to annotating a level of discourse structure that is based on identifying discourse connectives and their arguments. The PDTB is being built directly on top of the Penn TreeBan... | {
"entities": {
"task": [
{
"text": "large scale discourse-level annotation",
"start": 28,
"end": 66
},
{
"text": "extraction of useful syntactic and semantic features",
"start": 356,
"end": 408
}
],
"material": [
{
"tex... | [] |
Currently, N-gram models are the most common and widely used models for statistical language modeling. In this paper, we investigated an alternative way to build language models, i.e., using artificial neural networks to learn the language model. Our experiment result shows that the neural network can learn a language ... | {
"entities": {
"method": [
{
"text": "N-gram models",
"start": 11,
"end": 24
},
{
"text": "language models",
"start": 162,
"end": 177
},
{
"text": "artificial neural networks",
"start": 191,
"end": 217
},
... | [] |
Automated facial expression recognition has received increased attention over the past two decades. Existing works in the field usually do not encode either the temporal evolution or the intensity of the observed facial displays. They also fail to jointly model multidimensional -LRB- multi-class -RRB- continuous facial... | {
"entities": {
"task": [
{
"text": "Automated facial expression recognition",
"start": 0,
"end": 39
},
{
"text": "dynamic ordinal regression",
"start": 657,
"end": 683
},
{
"text": "simultaneous dynamic recognition",
"s... | [] |
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing training methods are designed by assuming that data can be stored in the computer memory. These methods can not be easily applied to data larg... | {
"entities": {
"task": [
{
"text": "linear classification",
"start": 19,
"end": 40
},
{
"text": "document classification",
"start": 82,
"end": 105
}
],
"generic": [
{
"text": "applications",
"start": 61,
... | [] |
Instances of a word drawn from different domains may have different sense priors -LRB- the proportions of the different senses of a word -RRB-. This in turn affects the accuracy of word sense disambiguation -LRB- WSD -RRB- systems trained and applied on different domains. This paper presents a method to estimate the se... | {
"entities": {
"other_scientific_term": [
{
"text": "sense priors",
"start": 68,
"end": 80
},
{
"text": "sense priors of words",
"start": 318,
"end": 339
},
{
"text": "well calibrated probabilities",
"start": 404,
... | [] |
In this paper we deal with a recently developed large Czech MWE database containing at the moment 160 000 MWEs -LRB- treated as lexical units -RRB-. It was compiled from various resources such as encyclopedias and dictionaries, public databases of proper names and toponyms, collocations obtained from Czech WordNet, lis... | {
"entities": {
"material": [
{
"text": "large Czech MWE database",
"start": 48,
"end": 72
},
{
"text": "encyclopedias",
"start": 196,
"end": 209
},
{
"text": "dictionaries",
"start": 214,
"end": 226
},
... | [] |
We describe the ongoing construction of a large, semantically annotated corpus resource as reliable basis for the large-scale acquisition of word-semantic information, e.g. the construction of domain-independent lexica. The backbone of the annotation are semantic roles in the frame semantics paradigm. We report experie... | {
"entities": {
"material": [
{
"text": "semantically annotated corpus",
"start": 49,
"end": 78
},
{
"text": "annotated data",
"start": 342,
"end": 356
}
],
"task": [
{
"text": "large-scale acquisition of word-semantic i... | [] |
Statistical machine translation -LRB- SMT -RRB- is currently one of the hot spots in natural language processing. Over the last few years dramatic improvements have been made, and a number of comparative evaluations have shown, that SMT gives competitive results to rule-based translation systems, requiring significantl... | {
"entities": {
"method": [
{
"text": "Statistical machine translation -LRB- SMT -RRB-",
"start": 0,
"end": 47
},
{
"text": "SMT",
"start": 38,
"end": 41
},
{
"text": "rule-based translation systems",
"start": 266,
... | [] |
This paper presents an unsupervised learning approach to building a non-English -LRB- Arabic -RRB- stemmer. The stemming model is based on statistical machine translation and it uses an English stemmer and a small -LRB- 10K sentences -RRB- parallel corpus as its sole training resources. No parallel text is needed after... | {
"entities": {
"method": [
{
"text": "unsupervised learning approach",
"start": 23,
"end": 53
},
{
"text": "stemming model",
"start": 112,
"end": 126
},
{
"text": "statistical machine translation",
"start": 139,
... | [] |
The paper assesses the capability of an HMM-based TTS system to produce German speech. The results are discussed in qualitative terms, and compared over three different choices of context features. In addition, the system is adapted to a small set of football announcements, in an exploratory attempt to synthe-sise expr... | {
"entities": {
"method": [
{
"text": "HMM-based TTS system",
"start": 40,
"end": 60
},
{
"text": "HMMs",
"start": 356,
"end": 360
}
],
"material": [
{
"text": "German speech",
"start": 72,
"end": 85
... | [] |
We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suffer from problems inherent in identity-of-relations analyses. Furthermore, in contrast to the approach of Dalrymple et al. -LSB- 1991 -RSB-, t... | {
"entities": {
"task": [
{
"text": "analysis of ellipsis resolution",
"start": 11,
"end": 42
},
{
"text": "identity-of-relations analyses",
"start": 208,
"end": 238
},
{
"text": "role linking",
"start": 466,
"en... | [] |
How to obtain hierarchical relations -LRB- e.g. superordinate-hyponym relation, synonym relation -RRB- is one of the most important problems for thesaurus construction. A pilot system for extracting these relations automatically from an ordinary Japanese language dictionary -LRB- Shinmeikai Kokugojiten, published by Sa... | {
"entities": {
"other_scientific_term": [
{
"text": "hierarchical relations",
"start": 14,
"end": 36
},
{
"text": "superordinate-hyponym relation",
"start": 48,
"end": 78
},
{
"text": "synonym relation",
"start": 80,
... | [] |
Face images of non-frontal views under poor illumination with low resolution reduce dramatically face recognition accuracy. This is evident most compellingly by the very low recognition rate of all existing face recognition systems when applied to live CCTV camera input. In this paper, we present a Bayesian framework t... | {
"entities": {
"task": [
{
"text": "Face images of non-frontal views",
"start": 0,
"end": 32
},
{
"text": "face image super-resolution",
"start": 403,
"end": 430
},
{
"text": "recognition",
"start": 102,
"end": ... | [] |
In this paper, we describe a phrase-based unigram model for statistical machine translation that uses a much simpler set of model parameters than similar phrase-based models. The units of translation are blocks-pairs of phrases. During decoding, we use a block unigram model and a word-based trigram language model. Duri... | {
"entities": {
"method": [
{
"text": "phrase-based unigram model",
"start": 29,
"end": 55
},
{
"text": "phrase-based models",
"start": 154,
"end": 173
},
{
"text": "block unigram model",
"start": 255,
"end": 274... | [] |
This paper develops a new approach for extremely fast detection in domains where the distribution of positive and negative examples is highly skewed -LRB- e.g. face detection or database retrieval -RRB-. In such domains a cascade of simple classifiers each trained to achieve high detection rates and modest false positi... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 26,
"end": 34
},
{
"text": "detector",
"start": 347,
"end": 355
},
{
"text": "cascade",
"start": 222,
"end": 229
}
],
"task": [
{
... | [] |
This paper proposes a method for learning joint embed-dings of images and text using a two-branch neural network with multiple layers of linear projections followed by nonlinearities. The network is trained using a large-margin objective that combines cross-view ranking constraints with within-view neighborhood structu... | {
"entities": {
"generic": [
{
"text": "method",
"start": 22,
"end": 28
},
{
"text": "network",
"start": 105,
"end": 112
},
{
"text": "approach",
"start": 424,
"end": 432
},
{
"text": "method"... | [] |
State-of-the-art Question Answering -LRB- QA -RRB- systems are very sensitive to variations in the phrasing of an information need. Finding the preferred language for such a need is a valuable task. We investigate that claim by adopting a simple MT-based paraphrasing technique and evaluating QA system performance on pa... | {
"entities": {
"method": [
{
"text": "Question Answering -LRB- QA -RRB- systems",
"start": 17,
"end": 58
},
{
"text": "MT-based paraphrasing technique",
"start": 246,
"end": 277
},
{
"text": "QA system",
"start": 293,
... | [] |
The TAP-XL Automated Analyst's Assistant is an application designed to help an English-speaking analyst write a topical report, culling information from a large inflow of multilingual, multimedia data. It gives users the ability to spend their time finding more data relevant to their task, and gives them translingual r... | {
"entities": {
"task": [
{
"text": "TAP-XL Automated Analyst's Assistant",
"start": 4,
"end": 40
}
],
"material": [
{
"text": "multilingual, multimedia data",
"start": 171,
"end": 200
}
],
"generic": [
{
"text":... | [] |
This paper discusses the application of Unification Categorial Grammar -LRB- UCG -RRB- to the framework of Isomorphic Grammars for Machine Translation pioneered by Landsbergen. The Isomorphic Grammars approach to MT involves developing the grammars of the Source and Target languages in parallel, in order to ensure that... | {
"entities": {
"method": [
{
"text": "Unification Categorial Grammar -LRB- UCG -RRB-",
"start": 40,
"end": 86
},
{
"text": "Isomorphic Grammars",
"start": 107,
"end": 126
},
{
"text": "Isomorphic Grammars approach",
"st... | [] |
In the security domain a key problem is identifying rare behaviours of interest. Training examples for these behaviours may or may not exist, and if they do exist there will be few examples, quite probably one. We present a novel weakly supervised algorithm that can detect behaviours that either have never before been ... | {
"entities": {
"task": [
{
"text": "security domain",
"start": 7,
"end": 22
},
{
"text": "identifying rare behaviours of interest",
"start": 40,
"end": 79
},
{
"text": "detection of abnormal behaviours",
"start": 403,
... | [] |
We have developed a computational model of the process of describing the layout of an apartment or house, a much-studied discourse task first characterized linguistically by Linde -LRB- 1974 -RRB-. The model is embodied in a program, APT, that can reproduce segments of actual tape-recorded descriptions, using organizat... | {
"entities": {
"generic": [
{
"text": "computational model",
"start": 20,
"end": 39
},
{
"text": "model",
"start": 34,
"end": 39
},
{
"text": "program",
"start": 225,
"end": 232
}
],
"task": [
... | [] |
This paper proposes a practical approach employing n-gram models and error-correction rules for Thai key prediction and Thai-English language identification. The paper also proposes rule-reduction algorithm applying mutual information to reduce the error-correction rules. Our algorithm reported more than 99% accuracy i... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 32,
"end": 40
},
{
"text": "algorithm",
"start": 197,
"end": 206
}
],
"method": [
{
"text": "n-gram models",
"start": 51,
"end": 64
},
... | [] |
This paper concerns the discourse understanding process in spoken dialogue systems. This process enables the system to understand user utterances based on the context of a dialogue. Since multiple candidates for the understanding result can be obtained for a user utterance due to the ambiguity of speech understanding, ... | {
"entities": {
"task": [
{
"text": "discourse understanding process",
"start": 24,
"end": 55
},
{
"text": "discourse understanding process",
"start": 806,
"end": 837
}
],
"method": [
{
"text": "spoken dialogue systems",... | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.