input stringlengths 181 1.95k | output dict | schema listlengths 0 0 |
|---|---|---|
In this paper a novel solution to automatic and unsupervised word sense induction -LRB- WSI -RRB- is introduced. It represents an instantiation of the one sense per collocation observation -LRB- Gale et al., 1992 -RRB-. Like most existing approaches it utilizes clustering of word co-occurrences. This approach differs f... | {
"entities": {
"generic": [
{
"text": "solution",
"start": 22,
"end": 30
},
{
"text": "It",
"start": 113,
"end": 115
},
{
"text": "it",
"start": 250,
"end": 252
},
{
"text": "approach",
... | [] |
This abstract describes a natural language system which deals usefully with ungrammatical input and describes some actual and potential applications of it in computer aided second language learning. However, this is not the only area in which the principles of the system might be used, and the aim in building it was si... | {
"entities": {
"method": [
{
"text": "natural language system",
"start": 26,
"end": 49
}
],
"other_scientific_term": [
{
"text": "ungrammatical input",
"start": 76,
"end": 95
}
],
"generic": [
{
"text": "it",
... | [] |
In a motorized vehicle a number of easily measurable signals with frequency components related to the rotational speed of the engine can be found, e.g., vibrations, electrical system voltage level, and ambient sound. These signals could potentially be used to estimate the speed and related states of the vehicle. Unfort... | {
"entities": {
"material": [
{
"text": "measurable signals",
"start": 42,
"end": 60
},
{
"text": "real data",
"start": 959,
"end": 968
}
],
"method": [
{
"text": "frequency components",
"start": 66,
"end... | [] |
LPC based speech coders operating at bit rates below 3.0 kbits/sec are usually associated with buzzy or metallic artefacts in the synthetic speech. These are mainly attributable to the simplifying assumptions made about the excitation source, which are usually required to maintain such low bit rates. In this paper a ne... | {
"entities": {
"method": [
{
"text": "LPC based speech coders",
"start": 0,
"end": 23
},
{
"text": "LPC vocoder",
"start": 322,
"end": 333
},
{
"text": "parameter determination",
"start": 760,
"end": 783
}... | [] |
We consider a problem of blind source separation from a set of instantaneous linear mixtures, where the mixing matrix is unknown. It was discovered recently, that exploiting the sparsity of sources in an appropriate representation according to some signal dictionary, dramatically improves the quality of separation. In ... | {
"entities": {
"task": [
{
"text": "blind source separation",
"start": 25,
"end": 48
}
],
"other_scientific_term": [
{
"text": "instantaneous linear mixtures",
"start": 63,
"end": 92
},
{
"text": "mixing matrix",
... | [] |
In this paper, we explore multilingual feature-level data sharing via Deep Neural Network -LRB- DNN -RRB- stacked bottleneck features. Given a set of available source languages, we apply language identification to pick the language most similar to the target language, for more efficient use of multilingual resources. O... | {
"entities": {
"task": [
{
"text": "multilingual feature-level data sharing",
"start": 26,
"end": 65
},
{
"text": "language identification",
"start": 187,
"end": 210
},
{
"text": "multilingual training",
"start": 591,
... | [] |
This article introduces a bidirectional grammar generation system called feature structure-directed generation, developed for a dialogue translation system. The system utilizes typed feature structures to control the top-down derivation in a declarative way. This generation system also uses disjunctive feature structur... | {
"entities": {
"method": [
{
"text": "bidirectional grammar generation system",
"start": 26,
"end": 65
},
{
"text": "feature structure-directed generation",
"start": 73,
"end": 110
},
{
"text": "generation system",
"sta... | [] |
Automatic image annotation is a newly developed and promising technique to provide semantic image retrieval via text descriptions. It concerns a process of automatically labeling the image contents with a pre-defined set of keywords which are exploited to represent the image semantics. A Maximum Entropy Model-based app... | {
"entities": {
"task": [
{
"text": "Automatic image annotation",
"start": 0,
"end": 26
},
{
"text": "semantic image retrieval",
"start": 83,
"end": 107
},
{
"text": "automatically labeling the image contents",
"start": ... | [] |
Recent years have seen increasing research on extracting and using temporal information in natural language applications. However most of the works found in the literature have focused on identifying and understanding temporal expressions in newswire texts. In this paper we report our work on anchoring temporal express... | {
"entities": {
"other_scientific_term": [
{
"text": "temporal information",
"start": 67,
"end": 87
},
{
"text": "temporal expressions",
"start": 218,
"end": 238
},
{
"text": "temporal expressions in newswire texts",
"st... | [] |
We address the problem of populating object category detection datasets with dense, per-object 3D reconstructions, bootstrapped from class labels, ground truth figure-ground segmentations and a small set of keypoint annotations. Our proposed algorithm first estimates camera viewpoint using rigid structure-from-motion, ... | {
"entities": {
"material": [
{
"text": "object category detection datasets",
"start": 37,
"end": 71
},
{
"text": "object-category detection datasets",
"start": 768,
"end": 802
},
{
"text": "PASCAL VOC",
"start": 804,
... | [] |
Probabilistic models have been previously shown to be efficient and effective for modeling and recognition of human motion. In particular we focus on methods which represent the human motion model as a triangulated graph. Previous approaches learned models based just on positions and velocities of the body parts while ... | {
"entities": {
"method": [
{
"text": "Probabilistic models",
"start": 0,
"end": 20
},
{
"text": "human motion model",
"start": 178,
"end": 196
},
{
"text": "triangulated graph",
"start": 202,
"end": 220
},... | [] |
Factor analysis and principal components analysis can be used to model linear relationships between observed variables and linearly map high-dimensional data to a lower-dimensional hidden space. In factor analysis, the observations are modeled as a linear combination of normally distributed hidden variables. We describ... | {
"entities": {
"method": [
{
"text": "Factor analysis",
"start": 0,
"end": 15
},
{
"text": "principal components analysis",
"start": 20,
"end": 49
},
{
"text": "factor analysis",
"start": 198,
"end": 213
}... | [] |
This paper describes a domain independent strategy for the multimedia articulation of answers elicited by a natural language interface to database query applications. Multimedia answers include videodisc images and heuristically-produced complete sentences in text or text-to-speech form. Deictic reference and feedback ... | {
"entities": {
"method": [
{
"text": "domain independent strategy",
"start": 23,
"end": 50
}
],
"task": [
{
"text": "multimedia articulation of answers",
"start": 59,
"end": 93
},
{
"text": "database query applications"... | [] |
The LOGON MT demonstrator assembles independently valuable general-purpose NLP components into a machine translation pipeline that capitalizes on output quality. The demonstrator embodies an interesting combination of hand-built, symbolic resources and stochastic processes. | {
"entities": {
"method": [
{
"text": "LOGON MT demonstrator",
"start": 4,
"end": 25
},
{
"text": "general-purpose NLP components",
"start": 59,
"end": 89
},
{
"text": "machine translation pipeline",
"start": 97,
... | [] |
In this paper we investigate the simple logical properties of contexts. We describe both the syntax and semantics of a general propositional language of context, and give a Hilbert style proof system for this language. A propositional logic of context extends classical propositional logic in two ways. Firstly, a new mo... | {
"entities": {
"task": [
{
"text": "logical properties of contexts",
"start": 40,
"end": 70
}
],
"other_scientific_term": [
{
"text": "syntax",
"start": 93,
"end": 99
},
{
"text": "semantics",
"start": 104,
... | [] |
Image matching is a fundamental problem in Computer Vision. In the context of feature-based matching, SIFT and its variants have long excelled in a wide array of applications. However, for ultra-wide baselines, as in the case of aerial images captured under large camera rotations, the appearance variation goes beyond t... | {
"entities": {
"task": [
{
"text": "Image matching",
"start": 0,
"end": 14
},
{
"text": "Computer Vision",
"start": 43,
"end": 58
},
{
"text": "feature-based matching",
"start": 78,
"end": 100
},
{
... | [] |
This article is devoted to the problem of quantifying noun groups in German. After a thorough description of the phenomena, the results of corpus-based investigations are described. Moreover, some examples are given that underline the necessity of integrating some kind of information other than grammar sensu stricto in... | {
"entities": {
"task": [
{
"text": "quantifying noun groups in German",
"start": 42,
"end": 75
},
{
"text": "theoretical linguistic investigations",
"start": 608,
"end": 645
}
],
"material": [
{
"text": "German",
... | [] |
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semi-automatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. ... | {
"entities": {
"method": [
{
"text": "paraphrasing",
"start": 6,
"end": 18
},
{
"text": "manual or semi-automatic methods",
"start": 111,
"end": 143
},
{
"text": "unsupervised learning algorithm",
"start": 182,
... | [] |
An efficient bit-vector-based CKY-style parser for context-free parsing is presented. The parser computes a compact parse forest representation of the complete set of possible analyses for large treebank grammars and long input sentences. The parser uses bit-vector operations to parallelise the basic parsing operations... | {
"entities": {
"method": [
{
"text": "bit-vector-based CKY-style parser",
"start": 13,
"end": 46
},
{
"text": "parser",
"start": 40,
"end": 46
},
{
"text": "parse forest representation",
"start": 116,
"end": 143... | [] |
In this paper, we propose a partially-blurred-image classification and analysis framework for automatically detecting images containing blurred regions and recognizing the blur types for those regions without needing to perform blur kernel estimation and image deblurring. We develop several blur features modeled by ima... | {
"entities": {
"method": [
{
"text": "partially-blurred-image classification and analysis framework",
"start": 28,
"end": 89
},
{
"text": "feature parameter training",
"start": 374,
"end": 400
},
{
"text": "blur detection",
... | [] |
It is well-known that there are polysemous words like sentence whose meaning or sense depends on the context of use. We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material -LRB- the Canadian Hansards -RRB- and the other trained on monolingual material -LRB- Roget's The... | {
"entities": {
"other_scientific_term": [
{
"text": "polysemous words",
"start": 32,
"end": 48
},
{
"text": "discourse",
"start": 424,
"end": 433
},
{
"text": "polysemous word",
"start": 32,
"end": 47
},
... | [] |
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two -LRB- uncalibrated -RRB- perspective images. We show that a set of different homographies can be embedded in different ways to a higher-dimensional real or complex space, so that each homography corre... | {
"entities": {
"method": [
{
"text": "embedding methods",
"start": 31,
"end": 48
},
{
"text": "closed-form segmentation solution",
"start": 483,
"end": 516
},
{
"text": "subspace-segmentation methods",
"start": 570,
... | [] |
Background maintenance is a frequent element of video surveillance systems. We develop Wallflower, a three-component system for background maintenance: the pixel-level component performs Wiener filtering to make probabilistic predictions of the expected background; the region-level component fills in homogeneous region... | {
"entities": {
"task": [
{
"text": "Background maintenance",
"start": 0,
"end": 22
},
{
"text": "video surveillance systems",
"start": 48,
"end": 74
},
{
"text": "background maintenance",
"start": 128,
"end": 15... | [] |
Is it possible to use out-of-domain acoustic training data to improve a speech recognizer's performance on a speciic, independent application? In our experiments, we use Wallstreet Journal -LRB- WSJ -RRB- data to train a recognizer, which is adapted and evaluated in the Phonebook domain. Apart from their common languag... | {
"entities": {
"material": [
{
"text": "out-of-domain acoustic training data",
"start": 22,
"end": 58
},
{
"text": "Wallstreet Journal -LRB- WSJ -RRB- data",
"start": 170,
"end": 209
},
{
"text": "Phonebook domain",
"st... | [] |
This paper proposes an approach to full parsing suitable for Information Extraction from texts. Sequences of cascades of rules deterministically analyze the text, building unambiguous structures. Initially basic chunks are analyzed; then argumental relations are recognized; finally modifier attachment is performed and ... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 23,
"end": 31
},
{
"text": "approach",
"start": 356,
"end": 364
},
{
"text": "It",
"start": 427,
"end": 429
}
],
"task": [
{
... | [] |
This paper presents a corpus study that explores the extent to which captions contribute to recognizing the intended message of an information graphic. It then presents an implemented graphic interpretation system that takes into account a variety of communicative signals, and an evaluation study showing that evidence ... | {
"entities": {
"task": [
{
"text": "corpus study",
"start": 22,
"end": 34
}
],
"other_scientific_term": [
{
"text": "information graphic",
"start": 131,
"end": 150
},
{
"text": "sight-impaired users",
"start": 4... | [] |
Graphical models such as Bayesian Networks -LRB- BNs -RRB- are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model parameters often requires a large amount of reliable and representative training data, which proves to be difficult to acquire for many ... | {
"entities": {
"method": [
{
"text": "Graphical models",
"start": 0,
"end": 16
},
{
"text": "Bayesian Networks -LRB- BNs -RRB-",
"start": 25,
"end": 58
},
{
"text": "BN",
"start": 49,
"end": 51
},
{
... | [] |
In this paper we introduce a modal language LT for imposing constraints on trees, and an extension LT -LRB- LF -RRB- for imposing constraints on trees decorated with feature structures. The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper... | {
"entities": {
"method": [
{
"text": "modal language LT",
"start": 29,
"end": 46
},
{
"text": "extension LT -LRB- LF -RRB-",
"start": 89,
"end": 116
},
{
"text": "grammatical frameworks",
"start": 269,
"end": 29... | [] |
Previous research has demonstrated the utility of clustering in inducing semantic verb classes from undisambiguated corpus data. We describe a new approach which involves clustering subcategorization frame -LRB- SCF -RRB- distributions using the Information Bottleneck and nearest neighbour methods. In contrast to previ... | {
"entities": {
"method": [
{
"text": "clustering",
"start": 50,
"end": 60
},
{
"text": "Information Bottleneck and nearest neighbour methods",
"start": 246,
"end": 298
}
],
"task": [
{
"text": "inducing semantic verb cl... | [] |
Due to the capacity of pan-tilt-zoom -LRB- PTZ -RRB- cameras to simultaneously cover a panoramic area and maintain high resolution imagery, researches in automated surveillance systems with multiple PTZ cameras have become increasingly important. Most existing algorithms require the prior knowledge of intrinsic paramet... | {
"entities": {
"other_scientific_term": [
{
"text": "pan-tilt-zoom -LRB- PTZ -RRB- cameras",
"start": 23,
"end": 60
},
{
"text": "panoramic area",
"start": 87,
"end": 101
},
{
"text": "high resolution imagery",
"start":... | [] |
This paper presents a new two-pass algorithm for Extra Large -LRB- more than 1M words -RRB- Vocabulary COntinuous Speech recognition based on the Information Retrieval -LRB- ELVIRCOS -RRB-. The principle of this approach is to decompose a recognition process into two passes where the first pass builds the words subset ... | {
"entities": {
"generic": [
{
"text": "two-pass algorithm",
"start": 26,
"end": 44
},
{
"text": "approach",
"start": 212,
"end": 220
},
{
"text": "passes",
"start": 268,
"end": 274
},
{
"text... | [] |
This paper describes our work on classification of outdoor scenes. First, images are partitioned into regions using one-class classification and patch-based clustering algorithms where one-class classifiers model the regions with relatively uniform color and texture properties, and clustering of patches aims to detect ... | {
"entities": {
"task": [
{
"text": "classification of outdoor scenes",
"start": 33,
"end": 65
},
{
"text": "scene classification",
"start": 734,
"end": 754
}
],
"method": [
{
"text": "one-class classification",
... | [] |
In this paper, we introduce a generative probabilistic optical character recognition -LRB- OCR -RRB- model that describes an end-to-end process in the noisy channel framework, progressing from generation of true text through its transformation into the noisy output of an OCR system. The model is designed for use in err... | {
"entities": {
"method": [
{
"text": "generative probabilistic optical character recognition -LRB- OCR -RRB- model",
"start": 30,
"end": 106
},
{
"text": "noisy channel framework",
"start": 151,
"end": 174
},
{
"text": "finite-... | [] |
We present a framework for word alignment based on log-linear models. All knowledge sources are treated as feature functions, which depend on the source langauge sentence, the target language sentence and possible additional variables. Log-linear models allow statistical alignment models to be easily extended by incorp... | {
"entities": {
"generic": [
{
"text": "framework",
"start": 13,
"end": 22
}
],
"task": [
{
"text": "word alignment",
"start": 27,
"end": 41
}
],
"method": [
{
"text": "log-linear models",
"start": 51,
... | [] |
Hough voting in a geometric transformation space allows us to realize spatial verification, but remains sensitive to feature detection errors because of the inflexible quan-tization of single feature correspondences. To handle this problem, we propose a new method, called adaptive dither voting, for robust spatial veri... | {
"entities": {
"method": [
{
"text": "Hough voting",
"start": 0,
"end": 12
},
{
"text": "adaptive dither voting",
"start": 273,
"end": 295
},
{
"text": "Hough histogram",
"start": 821,
"end": 836
}
],
... | [] |
We propose a novel technique called bispectral photo-metric stereo that makes effective use of fluorescence for shape reconstruction. Fluorescence is a common phenomenon occurring in many objects from natural gems and corals, to fluorescent dyes used in clothing. One of the important characteristics of fluorescence is ... | {
"entities": {
"generic": [
{
"text": "technique",
"start": 19,
"end": 28
},
{
"text": "algorithms",
"start": 547,
"end": 557
},
{
"text": "methods",
"start": 1074,
"end": 1081
}
],
"method": [
... | [] |
In this paper, we present an approach for learning a visual representation from the raw spatiotemporal signals in videos. Our representation is learned without supervision from semantic labels. We formulate our method as an unsupervised sequential verification task, i.e., we determine whether a sequence of frames from ... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 29,
"end": 37
},
{
"text": "representation",
"start": 60,
"end": 74
},
{
"text": "method",
"start": 211,
"end": 217
},
{
"text": "ta... | [] |
``To explain complex phenomena, an explanation system must be able to select information from a formal representation of domain knowledge, organize the selected information into multisentential discourse plans, and realize the discourse plans in text. Although recent years have witnessed significant progress in the dev... | {
"entities": {
"method": [
{
"text": "explanation system",
"start": 35,
"end": 53
},
{
"text": "robust explanation system",
"start": 594,
"end": 619
},
{
"text": "explanation system",
"start": 601,
"end": 619
... | [] |
We present an operable definition of focus which is argued to be of a cognito-pragmatic nature and explore how it is determined in discourse in a formalized manner. For this purpose, a file card model of discourse model and knowledge store is introduced enabling the decomposition and formal representation of its determ... | {
"entities": {
"generic": [
{
"text": "operable definition",
"start": 14,
"end": 33
},
{
"text": "it",
"start": 28,
"end": 30
}
],
"other_scientific_term": [
{
"text": "cognito-pragmatic nature",
"start": 70,
... | [] |
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization problem, with methods such as graph cuts, belief propagation. Although several methods have been proposed to learn the model parameters from train... | {
"entities": {
"method": [
{
"text": "Conditional Random Field models",
"start": 0,
"end": 31
},
{
"text": "graph cuts",
"start": 204,
"end": 214
},
{
"text": "belief propagation",
"start": 216,
"end": 234
... | [] |
Interpreting metaphors is an integral and inescapable process in human understanding of natural language. This paper discusses a method of analyzing metaphors based on the existence of a small number of generalized metaphor mappings. Each generalized metaphor contains a recognition network, a basic mapping, additional ... | {
"entities": {
"task": [
{
"text": "Interpreting metaphors",
"start": 0,
"end": 22
},
{
"text": "human understanding of natural language",
"start": 65,
"end": 104
},
{
"text": "analyzing metaphors",
"start": 139,
... | [] |
This study presents a method to automatically acquire paraphrases using bilingual corpora, which utilizes the bilingual dependency relations obtained by projecting a monolingual dependency parse onto the other language sentence based on statistical alignment techniques. Since the paraphrasing method is capable of clear... | {
"entities": {
"method": [
{
"text": "method to automatically acquire paraphrases",
"start": 22,
"end": 65
},
{
"text": "statistical alignment techniques",
"start": 237,
"end": 269
},
{
"text": "paraphrasing method",
"s... | [] |
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation to categorial grammar, -LRB- yielding a treatment of Montague semantics -RRB-, a parsing-as-deduction in a resource sensitive logic, and a learning al... | {
"entities": {
"method": [
{
"text": "logical definition of Minimalist grammars",
"start": 13,
"end": 54
},
{
"text": "Stabler's formalization of Chomsky's minimalist program",
"start": 65,
"end": 120
},
{
"text": "logical defi... | [] |
There are several approaches that model information extraction as a token classification task, using various tagging strategies to combine multiple tokens. We describe the tagging strategies that can be found in the literature and evaluate their relative performances. We also introduce a new strategy, called Begin/Afte... | {
"entities": {
"generic": [
{
"text": "approaches",
"start": 18,
"end": 28
},
{
"text": "strategy",
"start": 293,
"end": 301
},
{
"text": "it",
"start": 217,
"end": 219
},
{
"text": "strategi... | [] |
The PRC Adaptive Knowledge-based Text Understanding System -LRB- PAKTUS -RRB- has been under development as an Independent Research and Development project at PRC since 1984. The objective is a generic system of tools, including a core English lexicon, grammar, and concept representations, for building natural language... | {
"entities": {
"method": [
{
"text": "PRC Adaptive Knowledge-based Text Understanding System -LRB- PAKTUS -RRB-",
"start": 4,
"end": 77
},
{
"text": "grammar",
"start": 253,
"end": 260
},
{
"text": "concept representations",
... | [] |
A major axis of research at LIMSI is directed at multilingual, speaker-independent, large vocabulary speech dictation. In this paper the LIMSI recognizer which was evaluated in the ARPA NOV93 CSR test is described, and experimental results on the WSJ and BREF corpora under closely matched conditions are reported. For b... | {
"entities": {
"task": [
{
"text": "multilingual, speaker-independent, large vocabulary speech dictation",
"start": 49,
"end": 117
},
{
"text": "word recognition",
"start": 332,
"end": 348
},
{
"text": "acoustic modeling",
... | [] |
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action recognition. We discuss two types of co-occurrence patterns that are complementary to each other, the conjunction -LRB- AND -RRB- and disjunctio... | {
"entities": {
"other_scientific_term": [
{
"text": "co-occurrence pattern",
"start": 4,
"end": 25
},
{
"text": "binary or local features",
"start": 44,
"end": 68
},
{
"text": "co-occurrence patterns",
"start": 213,
... | [] |
Empirical experience and observations have shown us when powerful and highly tunable classifiers such as maximum entropy classifiers, boosting and SVMs are applied to language processing tasks, it is possible to achieve high accuracies, but eventually their performances all tend to plateau out at around the same point.... | {
"entities": {
"method": [
{
"text": "classifiers",
"start": 85,
"end": 96
},
{
"text": "maximum entropy classifiers",
"start": 105,
"end": 132
},
{
"text": "boosting",
"start": 134,
"end": 142
},
{
... | [] |
A flexible parser can deal with input that deviates from its grammar, in addition to input that conforms to it. Ideally, such a parser will correct the deviant input: sometimes, it will be unable to correct it at all; at other times, correction will be possible, but only to within a range of ambiguous possibilities. Th... | {
"entities": {
"method": [
{
"text": "flexible parser",
"start": 2,
"end": 17
},
{
"text": "parser",
"start": 11,
"end": 17
},
{
"text": "parser",
"start": 128,
"end": 134
},
{
"text": "const... | [] |
A proposal to deal with French tenses in the framework of Discourse Representation Theory is presented, as it has been implemented for a fragment at the IMS. It is based on the theory of tenses of H. Kamp and Ch. Rohrer. Instead of using operators to express the meaning of the tenses the Reichenbachian point of view is... | {
"entities": {
"generic": [
{
"text": "proposal",
"start": 2,
"end": 10
},
{
"text": "it",
"start": 20,
"end": 22
},
{
"text": "It",
"start": 158,
"end": 160
},
{
"text": "operators",
... | [] |
The work presented in this paper is the first step in a project which aims to cluster and summarise electronic discussions in the context of help-desk applications. The eventual objective of this project is to use these summaries to assist help-desk users and operators. In this paper, we identify features of electronic... | {
"entities": {
"task": [
{
"text": "electronic discussions",
"start": 100,
"end": 122
},
{
"text": "help-desk applications",
"start": 141,
"end": 163
},
{
"text": "electronic discussions",
"start": 310,
"end": 3... | [] |
The paper presents a method for word sense disambiguation based on parallel corpora. The method exploits recent advances in word alignment and word clustering based on automatic extraction of translation equivalents and being supported by available aligned wordnets for the languages in the corpus. The wordnets are alig... | {
"entities": {
"generic": [
{
"text": "method",
"start": 21,
"end": 27
},
{
"text": "method",
"start": 89,
"end": 95
},
{
"text": "method",
"start": 457,
"end": 463
},
{
"text": "system",
... | [] |
This paper investigates critical configurations for projective reconstruction from multiple images taken by a camera moving in a straight line. Projective reconstruction refers to a determination of the 3D geometrical configuration of a set of 3D points and cameras, given only correspondences between points in the imag... | {
"entities": {
"task": [
{
"text": "projective reconstruction",
"start": 52,
"end": 77
},
{
"text": "Projective reconstruction",
"start": 144,
"end": 169
}
],
"material": [
{
"text": "images",
"start": 92,
... | [] |
Porting a Natural Language Processing -LRB- NLP -RRB- system to a new domain remains one of the bottlenecks in syntactic parsing, because of the amount of effort required to fix gaps in the lexicon, and to attune the existing grammar to the idiosyncracies of the new sublanguage. This paper shows how the process of fitt... | {
"entities": {
"task": [
{
"text": "Natural Language Processing -LRB- NLP -RRB- system",
"start": 10,
"end": 60
},
{
"text": "syntactic parsing",
"start": 111,
"end": 128
}
],
"material": [
{
"text": "new domain",
... | [] |
Chart parsing is directional in the sense that it works from the starting point -LRB- usually the beginning of the sentence -RRB- extending its activity usually in a rightward manner. We shall introduce the concept of a chart that works outward from islands and makes sense of as much of the sentence as it is actually p... | {
"entities": {},
"relations": {}
} | [] |
Unification is often the appropriate method for expressing relations between representations in the form of feature structures; however, there are circumstances in which a different approach is desirable. A declarative formalism is presented which permits direct mappings of one feature structure into another, and illus... | {
"entities": {
"method": [
{
"text": "Unification",
"start": 0,
"end": 11
},
{
"text": "declarative formalism",
"start": 207,
"end": 228
}
],
"generic": [
{
"text": "method",
"start": 37,
"end": 43
... | [] |
To support engaging human users in robust, mixed-initiative speech dialogue interactions which reach beyond current capabilities in dialogue systems, the DARPA Communicator program -LSB- 1 -RSB- is funding the development of a distributed message-passing infrastructure for dialogue systems which all Communicator partic... | {
"entities": {
"method": [
{
"text": "mixed-initiative speech dialogue interactions",
"start": 43,
"end": 88
},
{
"text": "dialogue systems",
"start": 132,
"end": 148
},
{
"text": "distributed message-passing infrastructure",
... | [] |
We propose a novel limited-memory stochastic block BFGS update for incorporating enriched curvature information in stochastic approximation methods. In our method, the estimate of the inverse Hessian matrix that is maintained by it, is updated at each iteration using a sketch of the Hessian, i.e., a randomly generated ... | {
"entities": {
"method": [
{
"text": "limited-memory stochastic block BFGS update",
"start": 19,
"end": 62
},
{
"text": "sketching strategies",
"start": 371,
"end": 391
},
{
"text": "quasi-Newton method",
"start": 407,
... | [] |
The goal of this research is to develop a spoken language system that will demonstrate the usefulness of voice input for interactive problem solving. The system will accept continuous speech, and will handle multiple speakers without explicit speaker enrollment. Combining speech recognition and natural language process... | {
"entities": {
"method": [
{
"text": "spoken language system",
"start": 42,
"end": 64
},
{
"text": "robust and high-performance speech recognition system",
"start": 481,
"end": 534
},
{
"text": "segment-based approach",
... | [] |
Spelling-checkers have become an integral part of most text processing software. From different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead of words. This approach is sufficient for languages with little inflection such as English, but fails for high... | {
"entities": {
"task": [
{
"text": "Spelling-checkers",
"start": 0,
"end": 17
},
{
"text": "text processing software",
"start": 55,
"end": 79
},
{
"text": "spelling-checkers",
"start": 493,
"end": 510
},
... | [] |
We present a new HMM tagger that exploits context on both sides of a word to be tagged, and evaluate it in both the unsupervised and supervised case. Along the way, we present the first comprehensive comparison of unsupervised methods for part-of-speech tagging, noting that published results to date have not been compa... | {
"entities": {
"method": [
{
"text": "HMM tagger",
"start": 17,
"end": 27
},
{
"text": "unsupervised methods",
"start": 214,
"end": 234
},
{
"text": "HMM training",
"start": 488,
"end": 500
}
],
"g... | [] |
We propose a family of non-uniform sampling strategies to provably speed up a class of stochastic optimization algorithms with linear convergence including Stochastic Variance Reduced Gradient -LRB- SVRG -RRB- and Stochastic Dual Coordinate Ascent -LRB- SDCA -RRB-. For a large family of penalized empirical risk minimiz... | {
"entities": {
"method": [
{
"text": "non-uniform sampling strategies",
"start": 23,
"end": 54
},
{
"text": "stochastic optimization algorithms",
"start": 87,
"end": 121
},
{
"text": "Stochastic Variance Reduced Gradient -LRB- ... | [] |
Statistical language modeling remains a challenging task, in particular for morphologically rich languages. Recently, new approaches based on factored language models have been developed to address this problem. These models provide principled ways of including additional conditioning variables other than the preceding... | {
"entities": {
"method": [
{
"text": "Statistical language modeling",
"start": 0,
"end": 29
},
{
"text": "factored language models",
"start": 142,
"end": 166
},
{
"text": "entirely data-driven model selection procedure",
... | [] |
We address appropriate user modeling in order to generate cooperative responses to each user in spoken dialogue systems. Unlike previous studies that focus on user's knowledge or typical kinds of users, the user model we propose is more comprehensive. Specifically, we set up three dimensions of user models: skill level... | {
"entities": {
"method": [
{
"text": "user modeling",
"start": 23,
"end": 36
},
{
"text": "user model",
"start": 23,
"end": 33
},
{
"text": "user models",
"start": 296,
"end": 307
},
{
"text"... | [] |
This paper proposes a novel method of building polarity-tagged corpus from HTML documents. The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents. The idea behind our method is to utilize certain layout structures and linguistic pattern. By using them, we can aut... | {
"entities": {
"generic": [
{
"text": "method",
"start": 28,
"end": 34
},
{
"text": "method",
"start": 119,
"end": 125
},
{
"text": "it",
"start": 52,
"end": 54
},
{
"text": "method",
... | [] |
Previous work has used monolingual parallel corpora to extract and generate paraphrases. We show that this task can be done using bilingual parallel corpora, a much more commonly available resource. Using alignment techniques from phrase-based statistical machine translation, we show how paraphrases in one language can... | {
"entities": {
"material": [
{
"text": "monolingual parallel corpora",
"start": 23,
"end": 51
},
{
"text": "bilingual parallel corpora",
"start": 130,
"end": 156
},
{
"text": "bilingual parallel corpus",
"start": 458,
... | [] |
This paper proposes an automatic, essentially domain-independent means of evaluating Spoken Language Systems -LRB- SLS -RRB- which combines software we have developed for that purpose -LRB- the'' Comparator'' -RRB- and a set of specifications for answer expressions -LRB- the'' Common Answer Specification'', or CAS -RRB... | {
"entities": {
"method": [
{
"text": "domain-independent means of evaluating Spoken Language Systems -LRB- SLS -RRB-",
"start": 46,
"end": 124
},
{
"text": "Comparator",
"start": 196,
"end": 206
},
{
"text": "Common Answer Spec... | [] |
This paper describes an unsupervised learning method for associative relationships between verb phrases, which is important in developing reliable Q&A systems. Consider the situation that a user gives a query ``How much petrol was imported to Japan from Saudi Arabia?'' to a Q&A system, but the text given to the system ... | {
"entities": {
"method": [
{
"text": "unsupervised learning method",
"start": 24,
"end": 52
},
{
"text": "unsupervised learning method",
"start": 651,
"end": 679
},
{
"text": "expectation-maximization -LRB- EM -RRB- based word-... | [] |
We describe the use of text data scraped from the web to augment language models for Automatic Speech Recognition and Keyword Search for Low Resource Languages. We scrape text from multiple genres including blogs, online news, translated TED talks, and subtitles. Using linearly interpolated language models, we find tha... | {
"entities": {
"material": [
{
"text": "text data",
"start": 23,
"end": 32
},
{
"text": "web",
"start": 50,
"end": 53
},
{
"text": "Low Resource Languages",
"start": 137,
"end": 159
},
{
"tex... | [] |
Pipelined Natural Language Generation -LRB- NLG -RRB- systems have grown increasingly complex as architectural modules were added to support language functionalities such as referring expressions, lexical choice, and revision. This has given rise to discussions about the relative placement of these new modules in the o... | {
"entities": {
"method": [
{
"text": "Pipelined Natural Language Generation -LRB- NLG -RRB- systems",
"start": 0,
"end": 61
},
{
"text": "architectural modules",
"start": 97,
"end": 118
},
{
"text": "discourse marker insertion ... | [] |
In this paper a system which understands and conceptualizes scenes descriptions in natural language is presented. Specifically, the following components of the system are described: the syntactic analyzer, based on a Procedural Systemic Grammar, the semantic analyzer relying on the Conceptual Dependency Theory, and the... | {
"entities": {
"generic": [
{
"text": "system",
"start": 16,
"end": 22
},
{
"text": "components",
"start": 142,
"end": 152
},
{
"text": "system",
"start": 160,
"end": 166
}
],
"task": [
{
... | [] |
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon this initial ranking, usin... | {
"entities": {
"generic": [
{
"text": "approaches",
"start": 23,
"end": 33
},
{
"text": "parses",
"start": 139,
"end": 145
},
{
"text": "model",
"start": 258,
"end": 263
},
{
"text": "approac... | [] |
A model is presented to characterize the class of languages obtained by adding reduplication to context-free languages. The model is a pushdown automaton augmented with the ability to check reduplication by using the stack in a new way. The class of languages generated is shown to lie strictly between the context-free ... | {
"entities": {
"generic": [
{
"text": "model",
"start": 2,
"end": 7
},
{
"text": "model",
"start": 361,
"end": 366
},
{
"text": "it",
"start": 165,
"end": 167
}
],
"other_scientific_term": [
... | [] |
We present an image set classification algorithm based on unsupervised clustering of labeled training and unla-beled test data where labels are only used in the stopping criterion. The probability distribution of each class over the set of clusters is used to define a true set based similarity measure. To this end, we ... | {
"entities": {
"method": [
{
"text": "image set classification algorithm",
"start": 14,
"end": 48
},
{
"text": "unsupervised clustering",
"start": 58,
"end": 81
},
{
"text": "iterative sparse spectral clustering algorithm",
... | [] |
This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. These models can be viewed as pairs of probabilistic context-free grammars working in a `synchronous' way. Two hardness results for the class NP ... | {
"entities": {
"other_scientific_term": [
{
"text": "computational problems",
"start": 29,
"end": 51
},
{
"text": "exponential time lower-bound",
"start": 348,
"end": 376
}
],
"method": [
{
"text": "probabilistic transl... | [] |
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a pri-ori knowledge in an efficient and gainful way. However, due to the linearity of PCA, non-linearities like rotations or independently moving sub-parts ... | {
"entities": {
"method": [
{
"text": "Active shape models",
"start": 0,
"end": 19
},
{
"text": "models of shape variation",
"start": 101,
"end": 126
},
{
"text": "search algorithms",
"start": 139,
"end": 156
... | [] |
We describe a set of experiments to explore statistical techniques for ranking and selecting the best translations in a graph of translation hypotheses. In a previous paper -LRB- Carl, 2007 -RRB- we have described how the hypotheses graph is generated through shallow mapping and permutation rules. We have given example... | {
"entities": {
"method": [
{
"text": "statistical techniques",
"start": 44,
"end": 66
},
{
"text": "shallow mapping",
"start": 260,
"end": 275
},
{
"text": "permutation rules",
"start": 280,
"end": 297
},
... | [] |
This paper presents a specialized editor for a highly structured dictionary. The basic goal in building that editor was to provide an adequate tool to help lexicologists produce a valid and coherent dictionary on the basis of a linguistic theory. If we want valuable lexicons and grammars to achieve complex natural lang... | {
"entities": {
"method": [
{
"text": "editor",
"start": 34,
"end": 40
},
{
"text": "editor",
"start": 109,
"end": 115
},
{
"text": "linguistic theory",
"start": 228,
"end": 245
},
{
"text": "... | [] |
Existing techniques extract term candidates by looking for internal and contextual information associated with domain specific terms. The algorithms always face the dilemma that fewer features are not enough to distinguish terms from non-terms whereas more features lead to more conflicts among selected features. This p... | {
"entities": {
"other_scientific_term": [
{
"text": "internal and contextual information",
"start": 59,
"end": 94
},
{
"text": "domain specific terms",
"start": 111,
"end": 132
},
{
"text": "features",
"start": 184,
... | [] |
We describe a method for identifying systematic patterns in translation data using part-of-speech tag sequences. We incorporate this analysis into a diagnostic tool intended for developers of machine translation systems, and demonstrate how our application can be used by developers to explore patterns in machine transl... | {
"entities": {
"generic": [
{
"text": "method",
"start": 14,
"end": 20
},
{
"text": "analysis",
"start": 133,
"end": 141
},
{
"text": "application",
"start": 245,
"end": 256
}
],
"other_scientific_... | [] |
We study the number of hidden layers required by a multilayer neu-ral network with threshold units to compute a function f from n d to -LCB- O, I -RCB-. In dimension d = 2, Gibson characterized the functions computable with just one hidden layer, under the assumption that there is no ``multiple intersection point'' and... | {
"entities": {
"other_scientific_term": [
{
"text": "number of hidden layers",
"start": 13,
"end": 36
},
{
"text": "threshold units",
"start": 83,
"end": 98
},
{
"text": "hidden layer",
"start": 23,
"end": 35
... | [] |
This paper presents an approach to estimate the intrinsic texture properties -LRB- albedo, shading, normal -RRB- of scenes from multiple view acquisition under unknown illumination conditions. We introduce the concept of intrinsic textures, which are pixel-resolution surface textures representing the intrinsic appearan... | {
"entities": {
"generic": [
{
"text": "approach",
"start": 23,
"end": 31
},
{
"text": "approach",
"start": 392,
"end": 400
},
{
"text": "it",
"start": 148,
"end": 150
},
{
"text": "method",
... | [] |
Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, for automatically evaluating answers to definition questions. Until now, the only way to assess the correctness of answers to such question... | {
"entities": {
"task": [
{
"text": "automatic evaluation",
"start": 37,
"end": 57
},
{
"text": "automatic evaluation of machine translation and document summarization",
"start": 37,
"end": 107
},
{
"text": "machine translation"... | [] |
Recent advances in Automatic Speech Recognition technology have put the goal of naturally sounding dialog systems within reach. However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they need to be more sophisticated at responding to ... | {
"entities": {
"method": [
{
"text": "Automatic Speech Recognition technology",
"start": 19,
"end": 58
},
{
"text": "hand-crafting knowledge-based generation systems",
"start": 585,
"end": 633
},
{
"text": "machine learning tec... | [] |
We present a tool, called ILIMP, which takes as input a raw text in French and produces as output the same text in which every occurrence of the pronoun il is tagged either with tag -LSB- ANA -RSB- for anaphoric or -LSB- IMP -RSB- for impersonal or expletive. This tool is therefore designed to distinguish between the a... | {
"entities": {
"generic": [
{
"text": "tool",
"start": 13,
"end": 17
},
{
"text": "tool",
"start": 265,
"end": 269
},
{
"text": "tasks",
"start": 610,
"end": 615
},
{
"text": "method",
... | [] |
Speech-based depression detection has gained importance in recent years, but most research has used relatively quiet conditions or examined a single corpus per study. Little is thus known about the robustness of speech cues in the wild. This study compares the effect of noise and reverberation on depression prediction ... | {
"entities": {
"task": [
{
"text": "Speech-based depression detection",
"start": 0,
"end": 33
},
{
"text": "depression prediction",
"start": 298,
"end": 319
},
{
"text": "real-world robust depression detection",
"start"... | [] |
This paper proposes document oriented preference sets -LRB- DoPS -RRB- for the disambiguation of the dependency structure of sentences. The DoPS system extracts preference knowledge from a target document or other documents automatically. Sentence ambiguities can be resolved by using domain targeted preference knowledg... | {
"entities": {
"method": [
{
"text": "document oriented preference sets -LRB- DoPS -RRB-",
"start": 20,
"end": 70
},
{
"text": "DoPS system",
"start": 140,
"end": 151
}
],
"task": [
{
"text": "disambiguation of the depe... | [] |
Multimodal interfaces require effective parsing and understanding of utterances whose content is distributed across multiple input modes. Johnston 1998 presents an approach in which strategies for multimodal integration are stated declaratively using a unification-based grammar that is used by a multidimensional chart ... | {
"entities": {
"task": [
{
"text": "Multimodal interfaces",
"start": 0,
"end": 21
},
{
"text": "multimodal integration",
"start": 197,
"end": 219
},
{
"text": "multimodal parsing and understanding",
"start": 721,
... | [] |
Recently, we initiated a project to develop a phonetically-based spoken language understanding system called SUMMIT. In contrast to many of the past efforts that make use of heuristic rules whose development requires intense knowledge engineering, our approach attempts to express the speech knowledge within a formal fr... | {
"entities": {
"method": [
{
"text": "phonetically-based spoken language understanding system",
"start": 46,
"end": 101
},
{
"text": "SUMMIT",
"start": 109,
"end": 115
},
{
"text": "heuristic rules",
"start": 174,
... | [] |
This paper describes an implemented program that takes a tagged text corpus and generates a partial list of the subcategorization frames in which each verb occurs. The completeness of the output list increases monotonically with the total occurrences of each verb in the training corpus. False positive rates are one to ... | {
"entities": {
"generic": [
{
"text": "program",
"start": 36,
"end": 43
}
],
"material": [
{
"text": "tagged text corpus",
"start": 57,
"end": 75
},
{
"text": "subcategorization dictionary",
"start": 482,
... | [] |
We present a method for estimating the relative pose of two calibrated or uncalibrated non-overlapping surveillance cameras from observing a moving object. We show how to tackle the problem of missing point correspondences heavily required by SfM pipelines and how to go beyond this basic paradigm. We relax the non-line... | {
"entities": {
"generic": [
{
"text": "method",
"start": 13,
"end": 19
},
{
"text": "paradigm",
"start": 289,
"end": 297
},
{
"text": "problem",
"start": 182,
"end": 189
},
{
"text": "assumpt... | [] |
In this paper, we propose a human action recognition system suitable for embedded computer vision applications in security systems, human-computer interaction and intelligent environments. Our system is suitable for embedded computer vision application based on three reasons. Firstly, the system was based on a linear S... | {
"entities": {
"method": [
{
"text": "human action recognition system",
"start": 28,
"end": 59
},
{
"text": "linear Support Vector Machine -LRB- SVM -RRB- classifier",
"start": 312,
"end": 368
},
{
"text": "classification progr... | [] |
In this paper I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports fl... | {
"entities": {
"method": [
{
"text": "model of grammatical processing",
"start": 33,
"end": 64
},
{
"text": "uniform processing",
"start": 82,
"end": 100
},
{
"text": "parametrized deduction process",
"start": 245,
... | [] |
Link detection has been regarded as a core technology for the Topic Detection and Tracking tasks of new event detection. In this paper we formulate story link detection and new event detection as information retrieval task and hypothesize on the impact of precision and recall on both systems. Motivated by these argumen... | {
"entities": {
"task": [
{
"text": "Link detection",
"start": 0,
"end": 14
},
{
"text": "Topic Detection and Tracking tasks of new event detection",
"start": 62,
"end": 119
},
{
"text": "story link detection",
"start": ... | [] |
We attempt to understand visual classification in humans using both psy-chophysical and machine learning techniques. Frontal views of human faces were used for a gender classification task. Human subjects classified the faces and their gender judgment, reaction time and confidence rating were recorded. Several hyperpla... | {
"entities": {
"task": [
{
"text": "visual classification",
"start": 25,
"end": 46
},
{
"text": "gender classification task",
"start": 162,
"end": 188
},
{
"text": "classification task",
"start": 169,
"end": 188... | [] |
In this paper, we present a corpus-based supervised word sense disambiguation -LRB- WSD -RRB- system for Dutch which combines statistical classification -LRB- maximum entropy -RRB- with linguistic information. Instead of building individual classifiers per ambiguous wordform, we introduce a lemma-based approach. The ad... | {
"entities": {
"method": [
{
"text": "corpus-based supervised word sense disambiguation -LRB- WSD -RRB- system",
"start": 28,
"end": 100
},
{
"text": "statistical classification",
"start": 126,
"end": 152
},
{
"text": "maximum ... | [] |
We propose an exact, general and efficient coarse-to-fine energy minimization strategy for semantic video segmenta-tion. Our strategy is based on a hierarchical abstraction of the supervoxel graph that allows us to minimize an energy defined at the finest level of the hierarchy by minimizing a series of simpler energie... | {
"entities": {
"method": [
{
"text": "coarse-to-fine energy minimization strategy",
"start": 43,
"end": 86
},
{
"text": "energy minimization algorithm",
"start": 591,
"end": 620
},
{
"text": "graph cuts",
"start": 633,
... | [] |
Motivated by the success of ensemble methods in machine learning and other areas of natural language processing, we developed a multi-strategy and multi-source approach to question answering which is based on combining the results from different answering agents searching for answers in multiple corpora. The answering ... | {
"entities": {
"method": [
{
"text": "ensemble methods",
"start": 28,
"end": 44
},
{
"text": "multi-strategy and multi-source approach",
"start": 128,
"end": 168
},
{
"text": "answering agents",
"start": 246,
"e... | [] |
Word Identification has been an important and active issue in Chinese Natural Language Processing. In this paper, a new mechanism, based on the concept of sublanguage, is proposed for identifying unknown words, especially personal names, in Chinese newspapers. The proposed mechanism includes title-driven name recogniti... | {
"entities": {
"task": [
{
"text": "Word Identification",
"start": 0,
"end": 19
},
{
"text": "Chinese Natural Language Processing",
"start": 62,
"end": 97
},
{
"text": "title-driven name recognition",
"start": 293,
... | [] |
In this paper we summarize the experiences gained from a field trial of a speaker verification system. In the test implementation access to two rooms at the University of Frankfurt had been controlled by a speaker verification system. The paper is organized as follows: Firstly, we will describe the system concepts and ... | {
"entities": {
"method": [
{
"text": "speaker verification system",
"start": 74,
"end": 101
},
{
"text": "speaker verification system",
"start": 206,
"end": 233
},
{
"text": "user evaluation",
"start": 368,
"end... | [] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.