doc_key stringlengths 8 24 | sentences listlengths 1 1 | tokens listlengths 23 316 | text stringlengths 181 2.06k | entities listlengths 0 50 | gold_relations listlengths 0 31 | coreference_clusters listlengths 0 10 |
|---|---|---|---|---|---|---|
A00-1024 | [
[
"This",
"paper",
"introduces",
"a",
"system",
"for",
"categorizing",
"unknown",
"words",
".",
"The",
"system",
"is",
"based",
"on",
"a",
"multi-component",
"architecture",
"where",
"each",
"component",
"is",
"responsible",... | [
"This",
"paper",
"introduces",
"a",
"system",
"for",
"categorizing",
"unknown",
"words",
".",
"The",
"system",
"is",
"based",
"on",
"a",
"multi-component",
"architecture",
"where",
"each",
"component",
"is",
"responsible",
"for",
"identifying",
"one",
"class",
"... |
This paper introduces a system for categorizing unknown words . The system is based on a multi-component architecture where each component is responsible for identifying one class of unknown words . The focus of this paper is the components that identify names and spelling errors . Each component uses a... | [
{
"end": 32,
"id": "T1",
"label": "Generic",
"start": 26,
"text": "system"
},
{
"end": 63,
"id": "T2",
"label": "Task",
"start": 37,
"text": "categorizing unknown words"
},
{
"end": 77,
"id": "T3",
"label": "Generic",
"start": 71,
"text": "system"
... | [
{
"head": "multi-component architecture",
"head_span": [
94,
122
],
"relation": "USED-FOR",
"tail": "system",
"tail_span": [
71,
77
]
},
{
"head": "components",
"head_span": [
240,
250
],
"relation": "USED-FOR",
"tail": "names",... | [
[
"system",
"system",
"system"
],
[
"component",
"components"
]
] |
A00-2023 | [
[
"This",
"paper",
"presents",
"a",
"new",
"approach",
"to",
"statistical",
"sentence",
"generation",
"in",
"which",
"alternative",
"phrases",
"are",
"represented",
"as",
"packed",
"sets",
"of",
"trees",
",",
"or",
"fore... | [
"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",
"stati... |
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 informati... | [
{
"end": 35,
"id": "T1",
"label": "Generic",
"start": 27,
"text": "approach"
},
{
"end": 71,
"id": "T2",
"label": "Task",
"start": 40,
"text": "statistical sentence generation"
},
{
"end": 144,
"id": "T3",
"label": "OtherScientificTerm",
"start": 139,
... | [
{
"head": "ranking algorithm",
"head_span": [
450,
467
],
"relation": "COMPARE",
"tail": "lattice-based approach",
"tail_span": [
581,
603
]
},
{
"head": "ranking algorithm",
"head_span": [
450,
467
],
"relation": "COMPARE",
"ta... | [
[
"approach",
"representation",
"It"
]
] |
A88-1001 | [
[
"This",
"paper",
"describes",
"a",
"domain",
"independent",
"strategy",
"for",
"the",
"multimedia",
"articulation",
"of",
"answers",
"elicited",
"by",
"a",
"natural",
"language",
"interface",
"to",
"database",
"query",
"ap... | [
"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",
... |
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 r... | [
{
"end": 53,
"id": "T1",
"label": "Method",
"start": 26,
"text": "domain independent strategy"
},
{
"end": 97,
"id": "T2",
"label": "Task",
"start": 63,
"text": "multimedia articulation of answers"
},
{
"end": 140,
"id": "T3",
"label": "OtherScientificTerm... | [
{
"head": "feedback",
"head_span": [
335,
343
],
"relation": "FEATURE-OF",
"tail": "discourse",
"tail_span": [
356,
365
]
},
{
"head": "videodisc images",
"head_span": [
207,
223
],
"relation": "PART-OF",
"tail": "Multimedia ans... | [
[
"interface",
"natural language interface"
],
[
"application",
"database query applications"
]
] |
A88-1003 | [
[
"In",
"this",
"paper,",
"we",
"describe",
"the",
"pronominal",
"anaphora",
"resolution",
"module",
"of",
"Lucy",
",",
"a",
"portable",
"English",
"understanding",
"system",
".",
"The",
"design",
"of",
"this",
"module",... | [
"In",
"this",
"paper,",
"we",
"describe",
"the",
"pronominal",
"anaphora",
"resolution",
"module",
"of",
"Lucy",
",",
"a",
"portable",
"English",
"understanding",
"system",
".",
"The",
"design",
"of",
"this",
"module",
"was",
"motivated",
"by",
"the",
"observa... |
In this paper, we describe the pronominal anaphora resolution module of Lucy , a portable English understanding system . The design of this module was motivated by the observation that, although there exist many theories of anaphora resolution , no one of these theories is complete. Thus we have implemented ... | [
{
"end": 72,
"id": "T1",
"label": "Method",
"start": 35,
"text": "pronominal anaphora resolution module"
},
{
"end": 82,
"id": "T2",
"label": "Method",
"start": 78,
"text": "Lucy"
},
{
"end": 126,
"id": "T3",
"label": "Method",
"start": 98,
"text":... | [
{
"head": "pronominal anaphora resolution module",
"head_span": [
35,
72
],
"relation": "PART-OF",
"tail": "Lucy",
"tail_span": [
78,
82
]
},
{
"head": "Lucy",
"head_span": [
78,
82
],
"relation": "HYPONYM-OF",
"tail": "English ... | [
[
"pronominal anaphora resolution module",
"module"
]
] |
A92-1010 | [
[
"In",
"our",
"current",
"research",
"into",
"the",
"design",
"of",
"cognitively",
"well-motivated",
"interfaces",
"relying",
"primarily",
"on",
"the",
"display",
"of",
"graphical",
"information",
",",
"we",
"have",
"observ... | [
"In",
"our",
"current",
"research",
"into",
"the",
"design",
"of",
"cognitively",
"well-motivated",
"interfaces",
"relying",
"primarily",
"on",
"the",
"display",
"of",
"graphical",
"information",
",",
"we",
"have",
"observed",
"that",
"graphical",
"information",
"... |
In our current research into the design of cognitively well-motivated interfaces relying primarily on the display of graphical information , we have observed that graphical information alone does not provide sufficient support to users - particularly when situations arise that do not simply conform to the users' ... | [
{
"end": 82,
"id": "T1",
"label": "Task",
"start": 45,
"text": "cognitively well-motivated interfaces"
},
{
"end": 142,
"id": "T2",
"label": "OtherScientificTerm",
"start": 110,
"text": "display of graphical information"
},
{
"end": 189,
"id": "T3",
"label... | [
{
"head": "display of graphical information",
"head_span": [
110,
142
],
"relation": "USED-FOR",
"tail": "cognitively well-motivated interfaces",
"tail_span": [
45,
82
]
},
{
"head": "natural language generation",
"head_span": [
512,
539
... | [
[
"display of graphical information",
"graphical information"
]
] |
A92-1023 | [
[
"A",
"meaningful",
"evaluation",
"methodology",
"can",
"advance",
"the",
"state-of-the-art",
"by",
"encouraging",
"mature,",
"practical",
"applications",
"rather",
"than",
"\"toy\"",
"implementations.",
"Evaluation",
"is",
"also",
... | [
"A",
"meaningful",
"evaluation",
"methodology",
"can",
"advance",
"the",
"state-of-the-art",
"by",
"encouraging",
"mature,",
"practical",
"applications",
"rather",
"than",
"\"toy\"",
"implementations.",
"Evaluation",
"is",
"also",
"crucial",
"to",
"assessing",
"competin... |
A meaningful evaluation methodology can advance the state-of-the-art by encouraging mature, practical applications rather than "toy" implementations. Evaluation is also crucial to assessing competing claims and identifying promising technical approaches. While work in speech recognition (SR) has a history of evaluat... | [
{
"end": 36,
"id": "T1",
"label": "Task",
"start": 14,
"text": "evaluation methodology"
},
{
"end": 161,
"id": "T2",
"label": "Task",
"start": 151,
"text": "Evaluation"
},
{
"end": 254,
"id": "T3",
"label": "Generic",
"start": 244,
"text": "approac... | [
{
"head": "methodology",
"head_span": [
789,
800
],
"relation": "EVALUATE-FOR",
"tail": "SLS systems",
"tail_span": [
875,
886
]
},
{
"head": "evaluations",
"head_span": [
895,
906
],
"relation": "HYPONYM-OF",
"tail": "NL evalua... | [
[
"SLS systems",
"SLS systems"
],
[
"\"black-box\" methodology",
"methodology",
"it",
"approach"
],
[
"methodology",
"methodology"
],
[
"evaluation methodology",
"Evaluation",
"evaluation methodologies"
],
[
"evaluations",
"evaluation of SLS syste... |
A92-1026 | [
[
"It",
"is",
"often",
"assumed",
"that",
"when",
"natural",
"language",
"processing",
"meets",
"the",
"real",
"world,",
"the",
"ideal",
"of",
"aiming",
"for",
"complete",
"and",
"correct",
"interpretations",
"has",
"to"... | [
"It",
"is",
"often",
"assumed",
"that",
"when",
"natural",
"language",
"processing",
"meets",
"the",
"real",
"world,",
"the",
"ideal",
"of",
"aiming",
"for",
"complete",
"and",
"correct",
"interpretations",
"has",
"to",
"be",
"abandoned.",
"However,",
"our",
"... |
It is often assumed that when natural language processing meets the real world, the ideal of aiming for complete and correct interpretations has to be abandoned. However, our experience with TACITUS ; especially in the MUC-3 evaluation , has shown that principled techniques for syntactic and pragmatic analysi... | [
{
"end": 61,
"id": "T1",
"label": "Task",
"start": 34,
"text": "natural language processing"
},
{
"end": 204,
"id": "T2",
"label": "Method",
"start": 197,
"text": "TACITUS"
},
{
"end": 243,
"id": "T3",
"label": "Metric",
"start": 227,
"text": "MUC-... | [
{
"head": "abductive inference",
"head_span": [
654,
673
],
"relation": "USED-FOR",
"tail": "pragmatics processing",
"tail_span": [
598,
619
]
},
{
"head": "pragmatics processing",
"head_span": [
598,
619
],
"relation": "HYPONYM-OF"... | [
[
"technique",
"terminal substring parsing"
]
] |
A92-1027 | [
[
"We",
"present",
"an",
"efficient",
"algorithm",
"for",
"chart-based",
"phrase",
"structure",
"parsing",
"of",
"natural",
"language",
"that",
"is",
"tailored",
"to",
"the",
"problem",
"of",
"extracting",
"specific",
"infor... | [
"We",
"present",
"an",
"efficient",
"algorithm",
"for",
"chart-based",
"phrase",
"structure",
"parsing",
"of",
"natural",
"language",
"that",
"is",
"tailored",
"to",
"the",
"problem",
"of",
"extracting",
"specific",
"information",
"from",
"unrestricted",
"texts",
... |
We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tailored to the problem of extracting specific information from unrestricted texts where many of the words are unknown and much of the text is irrelevant to the task. The parser gains algorithmic effici... | [
{
"end": 36,
"id": "T1",
"label": "Generic",
"start": 27,
"text": "algorithm"
},
{
"end": 78,
"id": "T2",
"label": "Task",
"start": 42,
"text": "chart-based phrase structure parsing"
},
{
"end": 100,
"id": "T3",
"label": "Material",
"start": 84,
"t... | [
{
"head": "natural language",
"head_span": [
84,
100
],
"relation": "USED-FOR",
"tail": "chart-based phrase structure parsing",
"tail_span": [
42,
78
]
},
{
"head": "function words",
"head_span": [
844,
858
],
"relation": "USED-FOR"... | [
[
"algorithm",
"parser"
]
] |
A94-1037 | [
[
"Methods",
"developed",
"for",
"spelling",
"correction",
"for",
"languages",
"like",
"English",
"(see",
"the",
"review",
"by",
"Kukich",
"(Kukich,",
"1992))",
"are",
"not",
"readily",
"applicable",
"to",
"agglutinative",
"... | [
"Methods",
"developed",
"for",
"spelling",
"correction",
"for",
"languages",
"like",
"English",
"(see",
"the",
"review",
"by",
"Kukich",
"(Kukich,",
"1992))",
"are",
"not",
"readily",
"applicable",
"to",
"agglutinative",
"languages",
".",
"This",
"poster",
"presen... |
Methods developed for spelling correction for languages like English (see the review by Kukich (Kukich, 1992)) are not readily applicable to agglutinative languages . This poster presents an approach to spelling correction in agglutinative languages that is based on two-level morphology and a dynamic-pro... | [
{
"end": 8,
"id": "T1",
"label": "Generic",
"start": 1,
"text": "Methods"
},
{
"end": 43,
"id": "T2",
"label": "Task",
"start": 24,
"text": "spelling correction"
},
{
"end": 59,
"id": "T3",
"label": "OtherScientificTerm",
"start": 50,
"text": "lang... | [
{
"head": "spelling correction",
"head_span": [
24,
43
],
"relation": "USED-FOR",
"tail": "languages",
"tail_span": [
50,
59
]
},
{
"head": "agglutinative languages",
"head_span": [
237,
260
],
"relation": "USED-FOR",
"tail": "s... | [
[
"spelling correction",
"spelling correction",
"spelling correction"
],
[
"approach",
"approach"
]
] |
A97-1020 | [
[
"GLOSSER",
"is",
"designed",
"to",
"support",
"reading",
"and",
"learning",
"to",
"read",
"in",
"a",
"foreign",
"language",
".",
"There",
"are",
"four",
"language",
"pairs",
"currently",
"supported",
"by",
"GLOSSER",
... | [
"GLOSSER",
"is",
"designed",
"to",
"support",
"reading",
"and",
"learning",
"to",
"read",
"in",
"a",
"foreign",
"language",
".",
"There",
"are",
"four",
"language",
"pairs",
"currently",
"supported",
"by",
"GLOSSER",
":",
"English-Bulgarian",
",",
"English-Eston... |
GLOSSER is designed to support reading and learning to read in a foreign language . There are four language pairs currently supported by GLOSSER : English-Bulgarian , English-Estonian , English-Hungarian and French-Dutch . The program is operational on UNIX and Windows '95 platforms, and has undergone a pil... | [
{
"end": 9,
"id": "T1",
"label": "Method",
"start": 2,
"text": "GLOSSER"
},
{
"end": 54,
"id": "T2",
"label": "Task",
"start": 34,
"text": "reading and learning"
},
{
"end": 118,
"id": "T3",
"label": "Generic",
"start": 104,
"text": "language pairs... | [
{
"head": "components",
"head_span": [
414,
424
],
"relation": "USED-FOR",
"tail": "intelligent computer-assisted morphological analysis (ICALL)",
"tail_span": [
457,
517
]
},
{
"head": "English-Bulgarian",
"head_span": [
155,
172
],
... | [
[
"GLOSSER",
"GLOSSER",
"program"
]
] |
A97-1021 | [
[
"We",
"focus",
"on",
"the",
"problem",
"of",
"building",
"large",
"repositories",
"of",
"lexical",
"conceptual",
"structure",
"(LCS)",
"representations",
"for",
"verbs",
"in",
"multiple",
"languages",
".",
"One",
"of",
... | [
"We",
"focus",
"on",
"the",
"problem",
"of",
"building",
"large",
"repositories",
"of",
"lexical",
"conceptual",
"structure",
"(LCS)",
"representations",
"for",
"verbs",
"in",
"multiple",
"languages",
".",
"One",
"of",
"the",
"main",
"results",
"of",
"this",
"... |
We focus on the problem of building large repositories of lexical conceptual structure (LCS) 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 -... | [
{
"end": 112,
"id": "T1",
"label": "Method",
"start": 62,
"text": "lexical conceptual structure (LCS) representations"
},
{
"end": 251,
"id": "T2",
"label": "OtherScientificTerm",
"start": 229,
"text": "broad semantic classes"
},
{
"end": 280,
"id": "T3",
... | [
{
"head": "representations",
"head_span": [
489,
504
],
"relation": "USED-FOR",
"tail": "English, Arabic and Spanish lexicons",
"tail_span": [
529,
565
]
},
{
"head": "lexicons",
"head_span": [
642,
650
],
"relation": "USED-FOR",
... | [
[
"lexical conceptual structure (LCS) representations",
"LCS representations",
"representations"
],
[
"lexicons",
"English, Arabic and Spanish lexicons"
]
] |
A97-1027 | [
[
"In",
"this",
"paper,",
"we",
"want",
"to",
"show",
"how",
"the",
"morphological",
"component",
"of",
"an",
"existing",
"NLP-system",
"for",
"Dutch",
"(Dutch",
"Medical",
"Language",
"Processor",
"-",
"DMLP)",
"has",
... | [
"In",
"this",
"paper,",
"we",
"want",
"to",
"show",
"how",
"the",
"morphological",
"component",
"of",
"an",
"existing",
"NLP-system",
"for",
"Dutch",
"(Dutch",
"Medical",
"Language",
"Processor",
"-",
"DMLP)",
"has",
"been",
"extended",
"in",
"order",
"to",
... |
In this paper, we want to show how the morphological component of an existing NLP-system for Dutch (Dutch Medical Language Processor - DMLP) has been extended in order to produce output that is compatible with the language independent modules of the LSP-MLP system (Linguistic String Project - Medical Language P... | [
{
"end": 64,
"id": "T1",
"label": "Method",
"start": 41,
"text": "morphological component"
},
{
"end": 144,
"id": "T2",
"label": "Method",
"start": 82,
"text": "NLP-system for Dutch (Dutch Medical Language Processor - DMLP)"
},
{
"end": 248,
"id": "T3",
"l... | [
{
"head": "morphological component",
"head_span": [
41,
64
],
"relation": "PART-OF",
"tail": "NLP-system for Dutch (Dutch Medical Language Processor - DMLP)",
"tail_span": [
82,
144
]
},
{
"head": "language independent modules",
"head_span": [
22... | [
[
"highlighting of relevant information",
"application",
"application"
],
[
"morphological component",
"former"
],
[
"language independent modules",
"latter"
]
] |
A97-1028 | [
[
"In",
"this",
"paper",
"we",
"present",
"a",
"statistical",
"profile",
"of",
"the",
"Named",
"Entity",
"task",
",",
"a",
"specific",
"information",
"extraction",
"task",
"for",
"which",
"corpora",
"in",
"several",
... | [
"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",
"th... |
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 discus... | [
{
"end": 48,
"id": "T1",
"label": "Generic",
"start": 29,
"text": "statistical profile"
},
{
"end": 75,
"id": "T2",
"label": "Task",
"start": 58,
"text": "Named Entity task"
},
{
"end": 117,
"id": "T3",
"label": "Task",
"start": 90,
"text": "inform... | [
{
"head": "statistical profile",
"head_span": [
29,
48
],
"relation": "USED-FOR",
"tail": "Named Entity task",
"tail_span": [
58,
75
]
},
{
"head": "algorithm",
"head_span": [
243,
252
],
"relation": "USED-FOR",
"tail": "lower b... | [
[
"statistical profile",
"statistical analysis",
"analysis"
]
] |
A97-1042 | [
[
"This",
"paper",
"addresses",
"the",
"problem",
"of",
"identifying",
"likely",
"topics",
"of",
"texts",
"by",
"their",
"position",
"in",
"the",
"text",
".",
"It",
"describes",
"the",
"automated",
"training",
"and",
... | [
"This",
"paper",
"addresses",
"the",
"problem",
"of",
"identifying",
"likely",
"topics",
"of",
"texts",
"by",
"their",
"position",
"in",
"the",
"text",
".",
"It",
"describes",
"the",
"automated",
"training",
"and",
"evaluation",
"of",
"an",
"Optimal",
"Positio... |
This paper addresses the problem of identifying likely topics of texts by their position in the text . It describes the automated training and evaluation of an Optimal Position Policy , a method of locating the likely positions of topic-bearing sentences based on genre-specific regularities of discourse s... | [
{
"end": 192,
"id": "T1",
"label": "Method",
"start": 169,
"text": "Optimal Position Policy"
},
{
"end": 203,
"id": "T2",
"label": "Generic",
"start": 197,
"text": "method"
},
{
"end": 264,
"id": "T3",
"label": "OtherScientificTerm",
"start": 227,
... | [
{
"head": "information retrieval",
"head_span": [
380,
401
],
"relation": "CONJUNCTION",
"tail": "routing",
"tail_span": [
405,
412
]
},
{
"head": "routing",
"head_span": [
405,
412
],
"relation": "CONJUNCTION",
"tail": "text su... | [
[
"Optimal Position Policy",
"method",
"method"
]
] |
A97-1050 | [
[
"We",
"investigate",
"the",
"utility",
"of",
"an",
"algorithm",
"for",
"translation",
"lexicon",
"acquisition",
"(SABLE)",
",",
"used",
"previously",
"on",
"a",
"very",
"large",
"corpus",
"to",
"acquire",
"general",
"t... | [
"We",
"investigate",
"the",
"utility",
"of",
"an",
"algorithm",
"for",
"translation",
"lexicon",
"acquisition",
"(SABLE)",
",",
"used",
"previously",
"on",
"a",
"very",
"large",
"corpus",
"to",
"acquire",
"general",
"translation",
"lexicons",
",",
"when",
"that"... |
We investigate the utility of an algorithm for translation lexicon acquisition (SABLE) , used previously on a very large corpus to acquire general translation lexicons , when that algorithm is applied to a much smaller corpus to produce candidates for domain-specific translation lexicons .
| [
{
"end": 44,
"id": "T1",
"label": "Generic",
"start": 35,
"text": "algorithm"
},
{
"end": 88,
"id": "T2",
"label": "Task",
"start": 49,
"text": "translation lexicon acquisition (SABLE)"
},
{
"end": 172,
"id": "T3",
"label": "OtherScientificTerm",
"star... | [
{
"head": "algorithm",
"head_span": [
186,
195
],
"relation": "USED-FOR",
"tail": "domain-specific translation lexicons",
"tail_span": [
262,
298
]
},
{
"head": "algorithm",
"head_span": [
35,
44
],
"relation": "USED-FOR",
"tail... | [
[
"algorithm",
"algorithm"
]
] |
A97-1052 | [
[
"We",
"describe",
"a",
"novel",
"technique",
"and",
"implemented",
"system",
"for",
"constructing",
"a",
"subcategorization",
"dictionary",
"from",
"textual",
"corpora",
".",
"Each",
"dictionary",
"entry",
"encodes",
"the",
... | [
"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... |
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 whi... | [
{
"end": 53,
"id": "T1",
"label": "Generic",
"start": 47,
"text": "system"
},
{
"end": 102,
"id": "T2",
"label": "OtherScientificTerm",
"start": 74,
"text": "subcategorization dictionary"
},
{
"end": 125,
"id": "T3",
"label": "Material",
"start": 110,
... | [
{
"head": "parser",
"head_span": [
646,
652
],
"relation": "EVALUATE-FOR",
"tail": "subcategorization dictionary",
"tail_span": [
564,
592
]
},
{
"head": "system",
"head_span": [
47,
53
],
"relation": "USED-FOR",
"tail": "subcat... | [
[
"system",
"system"
]
] |
AAAI_1993_70_abs | [
[
"The",
"Rete",
"and",
"Treat",
"algorithms",
"are",
"considered",
"the",
"most",
"efficient",
"implementation",
"techniques",
"for",
"Forward",
"Chaining",
"rule",
"systems.",
"These",
"algorithms",
"support",
"a",
"language",... | [
"The",
"Rete",
"and",
"Treat",
"algorithms",
"are",
"considered",
"the",
"most",
"efficient",
"implementation",
"techniques",
"for",
"Forward",
"Chaining",
"rule",
"systems.",
"These",
"algorithms",
"support",
"a",
"language",
"of",
"limited",
"expressive",
"power."... | The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited expressive power. Assertions are not allowed to contain variables, making universal quantification impossible to express except as a rule. In this p... | [
{
"end": 29,
"id": "T1",
"label": "Method",
"start": 4,
"text": "Rete and Treat algorithms"
},
{
"end": 89,
"id": "T2",
"label": "Method",
"start": 64,
"text": "implementation techniques"
},
{
"end": 123,
"id": "T3",
"label": "Task",
"start": 94,
"... | [
{
"head": "Rete and Treat algorithms",
"head_span": [
4,
29
],
"relation": "HYPONYM-OF",
"tail": "implementation techniques",
"tail_span": [
64,
89
]
},
{
"head": "Rete and Treat algorithms",
"head_span": [
4,
29
],
"relation": "USE... | [
[
"Rete and Treat algorithms",
"algorithms",
"algorithms"
],
[
"full unification",
"full unification",
"Full unification",
"full unification",
"full unification",
"it"
]
] |
AAAI_1993_71_abs | [
[
"In",
"this",
"paper",
"we",
"investigate",
"the",
"simple",
"logical",
"properties",
"of",
"contexts.",
"We",
"describe",
"both",
"the",
"syntax",
"and",
"semantics",
"of",
"a",
"general",
"propositional",
"language",
... | [
"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",
"Hi... | 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... | [
{
"end": 70,
"id": "T1",
"label": "Task",
"start": 40,
"text": "logical properties of contexts"
},
{
"end": 99,
"id": "T2",
"label": "OtherScientificTerm",
"start": 93,
"text": "syntax"
},
{
"end": 113,
"id": "T3",
"label": "OtherScientificTerm",
"star... | [
{
"head": "semantics",
"head_span": [
104,
113
],
"relation": "FEATURE-OF",
"tail": "propositional language of context",
"tail_span": [
127,
160
]
},
{
"head": "syntax",
"head_span": [
93,
99
],
"relation": "FEATURE-OF",
"tail":... | [
[
"propositional language of context",
"language"
],
[
"It",
"modality"
],
[
"Hilbert style proof system",
"Hilbert style proof system"
]
] |
AAAI_2008_254_abs | [
[
"The",
"construction",
"of",
"causal",
"graphs",
"from",
"non-experimental",
"data",
"rests",
"on",
"a",
"set",
"of",
"constraints",
"that",
"the",
"graph",
"structure",
"imposes",
"on",
"all",
"probability",
"distribution... | [
"The",
"construction",
"of",
"causal",
"graphs",
"from",
"non-experimental",
"data",
"rests",
"on",
"a",
"set",
"of",
"constraints",
"that",
"the",
"graph",
"structure",
"imposes",
"on",
"all",
"probability",
"distributions",
"compatible",
"with",
"the",
"graph.",... | The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the graph. These constraints are of two types: conditional inde-pendencies and algebraic constraints, first noted by Verma. While conditional indep... | [
{
"end": 33,
"id": "T1",
"label": "Task",
"start": 4,
"text": "construction of causal graphs"
},
{
"end": 60,
"id": "T2",
"label": "Material",
"start": 39,
"text": "non-experimental data"
},
{
"end": 90,
"id": "T3",
"label": "OtherScientificTerm",
"sta... | [
{
"head": "conditional inde-pendencies",
"head_span": [
220,
247
],
"relation": "HYPONYM-OF",
"tail": "constraints",
"tail_span": [
190,
201
]
},
{
"head": "algebraic constraints",
"head_span": [
252,
273
],
"relation": "HYPONYM-OF"... | [
[
"dormant independence",
"independence",
"it"
],
[
"Verma constraints",
"they"
],
[
"constraints",
"constraints"
]
] |
AAAI_2008_255_abs | [
[
"It",
"is",
"well-known",
"that",
"diversity",
"among",
"base",
"classifiers",
"is",
"crucial",
"for",
"constructing",
"a",
"strong",
"ensemble.",
"Most",
"existing",
"ensemble",
"methods",
"obtain",
"diverse",
"individual",
... | [
"It",
"is",
"well-known",
"that",
"diversity",
"among",
"base",
"classifiers",
"is",
"crucial",
"for",
"constructing",
"a",
"strong",
"ensemble.",
"Most",
"existing",
"ensemble",
"methods",
"obtain",
"diverse",
"individual",
"learners",
"through",
"resampling",
"the... | It is well-known that diversity among base classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods obtain diverse individual learners through resampling the instances or features. In this paper, we propose an alternative way for ensemble construction by resampling pairwise constraints ... | [
{
"end": 54,
"id": "T1",
"label": "Method",
"start": 38,
"text": "base classifiers"
},
{
"end": 100,
"id": "T2",
"label": "Task",
"start": 92,
"text": "ensemble"
},
{
"end": 132,
"id": "T3",
"label": "Method",
"start": 116,
"text": "ensemble method... | [
{
"head": "base classifiers",
"head_span": [
38,
54
],
"relation": "USED-FOR",
"tail": "ensemble",
"tail_span": [
92,
100
]
},
{
"head": "pairwise constraints",
"head_span": [
401,
421
],
"relation": "USED-FOR",
"tail": "ensembl... | [
[
"ensemble",
"ensemble construction",
"ensemble construction"
],
[
"base classifiers",
"base clas-sifiers",
"base classifiers"
],
[
"resampling pairwise constraints",
"resampling pairwise constraints"
],
[
"data representation",
"data representation"
]
] |
AAAI_2008_262_abs | [
[
"We",
"describe",
"Yoopick,",
"a",
"combinatorial",
"sports",
"prediction",
"market",
"that",
"implements",
"a",
"flexible",
"betting",
"language,",
"and",
"in",
"turn",
"facilitates",
"fine-grained",
"probabilistic",
"estimation"... | [
"We",
"describe",
"Yoopick,",
"a",
"combinatorial",
"sports",
"prediction",
"market",
"that",
"implements",
"a",
"flexible",
"betting",
"language,",
"and",
"in",
"turn",
"facilitates",
"fine-grained",
"probabilistic",
"estimation",
"of",
"outcomes."
] | We describe Yoopick, a combinatorial sports prediction market that implements a flexible betting language, and in turn facilitates fine-grained probabilistic estimation of outcomes. | [
{
"end": 19,
"id": "T1",
"label": "Method",
"start": 12,
"text": "Yoopick"
},
{
"end": 61,
"id": "T2",
"label": "Method",
"start": 23,
"text": "combinatorial sports prediction market"
},
{
"end": 105,
"id": "T3",
"label": "OtherScientificTerm",
"start"... | [
{
"head": "Yoopick",
"head_span": [
12,
19
],
"relation": "HYPONYM-OF",
"tail": "combinatorial sports prediction market",
"tail_span": [
23,
61
]
},
{
"head": "flexible betting language",
"head_span": [
80,
105
],
"relation": "USED-... | [] |
AAAI_2015_10_abs | [
[
"Machine",
"reading",
"is",
"a",
"relatively",
"new",
"field",
"that",
"features",
"computer",
"programs",
"designed",
"to",
"read",
"flowing",
"text",
"and",
"extract",
"fact",
"assertions",
"expressed",
"by",
"the",
... | [
"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",
"in... | 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 (NLP) and information extraction (IE). In this paper we describe a machine reading... | [
{
"end": 15,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Machine reading"
},
{
"end": 41,
"id": "T2",
"label": "Generic",
"start": 36,
"text": "field"
},
{
"end": 73,
"id": "T3",
"label": "Method",
"start": 56,
"text": "computer programs"
}... | [
{
"head": "computer programs",
"head_span": [
56,
73
],
"relation": "USED-FOR",
"tail": "flowing text",
"tail_span": [
91,
103
]
},
{
"head": "computer programs",
"head_span": [
56,
73
],
"relation": "USED-FOR",
"tail": "fact as... | [
[
"Machine reading",
"field",
"task"
],
[
"machine reading system",
"system",
"system"
]
] |
AAAI_2015_11_abs | [
[
"We",
"derive",
"a",
"convex",
"optimization",
"problem",
"for",
"the",
"task",
"of",
"segmenting",
"sequential",
"data,",
"which",
"explicitly",
"treats",
"presence",
"of",
"outliers.",
"We",
"describe",
"two",
"algorithm... | [
"We",
"derive",
"a",
"convex",
"optimization",
"problem",
"for",
"the",
"task",
"of",
"segmenting",
"sequential",
"data,",
"which",
"explicitly",
"treats",
"presence",
"of",
"outliers.",
"We",
"describe",
"two",
"algorithms",
"for",
"solving",
"this",
"problem,",
... | We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach , and we derive a consistency results for the case of two segments and no outliers. Robustnes... | [
{
"end": 39,
"id": "T1",
"label": "Task",
"start": 12,
"text": "convex optimization problem"
},
{
"end": 82,
"id": "T2",
"label": "Task",
"start": 56,
"text": "segmenting sequential data"
},
{
"end": 128,
"id": "T3",
"label": "OtherScientificTerm",
"st... | [
{
"head": "convex optimization problem",
"head_span": [
12,
39
],
"relation": "USED-FOR",
"tail": "segmenting sequential data",
"tail_span": [
56,
82
]
},
{
"head": "algorithms",
"head_span": [
146,
156
],
"relation": "USED-FOR",
... | [
[
"convex optimization problem",
"problem"
],
[
"algorithms",
"algorithms"
]
] |
AAAI_2015_21_abs | [
[
"Semantic",
"Web",
"documents",
"that",
"encode",
"facts",
"about",
"entities",
"on",
"the",
"Web",
"have",
"been",
"growing",
"rapidly",
"in",
"size",
"and",
"evolving",
"over",
"time.",
"Creating",
"summaries",
"on",... | [
"Semantic",
"Web",
"documents",
"that",
"encode",
"facts",
"about",
"entities",
"on",
"the",
"Web",
"have",
"been",
"growing",
"rapidly",
"in",
"size",
"and",
"evolving",
"over",
"time.",
"Creating",
"summaries",
"on",
"lengthy",
"Semantic",
"Web",
"documents",
... | Semantic Web documents that encode facts about entities on the Web have been growing rapidly in size and evolving over time. Creating summaries on lengthy Semantic Web documents for quick identification of the corresponding entity has been of great contemporary interest. In this paper, we explore automatic summa-rizati... | [
{
"end": 22,
"id": "T1",
"label": "Material",
"start": 0,
"text": "Semantic Web documents"
},
{
"end": 143,
"id": "T2",
"label": "Task",
"start": 125,
"text": "Creating summaries"
},
{
"end": 177,
"id": "T3",
"label": "Material",
"start": 147,
"tex... | [
{
"head": "lengthy Semantic Web documents",
"head_span": [
147,
177
],
"relation": "USED-FOR",
"tail": "Creating summaries",
"tail_span": [
125,
143
]
},
{
"head": "Creating summaries",
"head_span": [
125,
143
],
"relation": "USED-F... | [
[
"diversity-aware entity summarization approach",
"approach"
]
] |
C00-1054 | [
[
"Multimodal",
"interfaces",
"require",
"effective",
"parsing",
"and",
"understanding",
"of",
"utterances",
"whose",
"content",
"is",
"distributed",
"across",
"multiple",
"input",
"modes.",
"Johnston",
"1998",
"presents",
"an",
... | [
"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",
... |
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 multidimensi... | [
{
"end": 23,
"id": "T1",
"label": "Task",
"start": 2,
"text": "Multimodal interfaces"
},
{
"end": 50,
"id": "T2",
"label": "Method",
"start": 43,
"text": "parsing"
},
{
"end": 178,
"id": "T3",
"label": "Generic",
"start": 170,
"text": "approach"
... | [
{
"head": "unification-based grammar",
"head_span": [
262,
287
],
"relation": "USED-FOR",
"tail": "multidimensional chart parser",
"tail_span": [
308,
337
]
},
{
"head": "weighted finite-state device",
"head_span": [
796,
824
],
"re... | [
[
"approach",
"approach"
],
[
"approach",
"approach"
]
] |
C00-2123 | [
[
"In",
"this",
"paper,",
"we",
"describe",
"a",
"search",
"procedure",
"for",
"statistical",
"machine",
"translation",
"(MT)",
"based",
"on",
"dynamic",
"programming",
"(DP)",
".",
"Starting",
"from",
"a",
"DP-based",
"... | [
"In",
"this",
"paper,",
"we",
"describe",
"a",
"search",
"procedure",
"for",
"statistical",
"machine",
"translation",
"(MT)",
"based",
"on",
"dynamic",
"programming",
"(DP)",
".",
"Starting",
"from",
"a",
"DP-based",
"solution",
"to",
"the",
"traveling",
"salesm... |
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynamic programming (DP) . Starting from a DP-based solution to the traveling salesman problem, we present a novel technique to restrict the possible word reordering between source and target language in order to ach... | [
{
"end": 46,
"id": "T1",
"label": "Generic",
"start": 30,
"text": "search procedure"
},
{
"end": 88,
"id": "T2",
"label": "Task",
"start": 52,
"text": "statistical machine translation (MT)"
},
{
"end": 124,
"id": "T3",
"label": "Method",
"start": 100,
... | [
{
"head": "dynamic programming (DP)",
"head_span": [
100,
124
],
"relation": "USED-FOR",
"tail": "statistical machine translation (MT)",
"tail_span": [
52,
88
]
},
{
"head": "search procedure",
"head_span": [
30,
46
],
"relation": "... | [] |
C02-1071 | [
[
"This",
"paper",
"describes",
"to",
"what",
"extent",
"deep",
"processing",
"may",
"benefit",
"from",
"shallow",
"techniques",
"and",
"it",
"presents",
"a",
"NLP",
"system",
"which",
"integrates",
"a",
"linguistic",
"P... | [
"This",
"paper",
"describes",
"to",
"what",
"extent",
"deep",
"processing",
"may",
"benefit",
"from",
"shallow",
"techniques",
"and",
"it",
"presents",
"a",
"NLP",
"system",
"which",
"integrates",
"a",
"linguistic",
"PoS",
"tagger",
"and",
"chunker",
"as",
"a"... |
This paper describes to what extent deep processing may benefit from shallow techniques and it presents a NLP system which integrates a linguistic PoS tagger and chunker as a preprocessing module of a broad coverage unification based grammar of Spanish . Experiments show that the efficiency of the overall a... | [
{
"end": 53,
"id": "T1",
"label": "Task",
"start": 38,
"text": "deep processing"
},
{
"end": 91,
"id": "T2",
"label": "Method",
"start": 73,
"text": "shallow techniques"
},
{
"end": 122,
"id": "T3",
"label": "Method",
"start": 112,
"text": "NLP sys... | [
{
"head": "shallow techniques",
"head_span": [
73,
91
],
"relation": "USED-FOR",
"tail": "deep processing",
"tail_span": [
38,
53
]
},
{
"head": "robustness",
"head_span": [
386,
396
],
"relation": "EVALUATE-FOR",
"tail": "syste... | [
[
"NLP system",
"system"
]
] |
C02-1120 | [
[
"This",
"paper",
"describes",
"an",
"unsupervised",
"learning",
"method",
"for",
"associative",
"relationships",
"between",
"verb",
"phrases",
",",
"which",
"is",
"important",
"in",
"developing",
"reliable",
"Q&A",
"systems",
... | [
"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",
"... |
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 ... | [
{
"end": 54,
"id": "T1",
"label": "Method",
"start": 26,
"text": "unsupervised learning method"
},
{
"end": 107,
"id": "T2",
"label": "OtherScientificTerm",
"start": 61,
"text": "associative relationships between verb phrases"
},
{
"end": 164,
"id": "T3",
... | [
{
"head": "unsupervised learning method",
"head_span": [
26,
54
],
"relation": "USED-FOR",
"tail": "associative relationships between verb phrases",
"tail_span": [
61,
107
]
},
{
"head": "unsupervised learning method",
"head_span": [
665,
6... | [
[
"method",
"method",
"unsupervised learning method"
],
[
"associative relationship",
"associative relationship",
"scenario consistency"
]
] |
C04-1011 | [
[
"We",
"consider",
"the",
"problem",
"of",
"computing",
"the",
"Kullback-Leibler",
"distance",
",",
"also",
"called",
"the",
"relative",
"entropy",
",",
"between",
"a",
"probabilistic",
"context-free",
"grammar",
"and",
"a"... | [
"We",
"consider",
"the",
"problem",
"of",
"computing",
"the",
"Kullback-Leibler",
"distance",
",",
"also",
"called",
"the",
"relative",
"entropy",
",",
"between",
"a",
"probabilistic",
"context-free",
"grammar",
"and",
"a",
"probabilistic",
"finite",
"automaton",
... |
We consider the problem of computing the Kullback-Leibler distance , also called the relative entropy , between a probabilistic context-free grammar and a probabilistic finite automaton . We show that there is a closed-form (analytical) solution for one part of the Kullback-Leibler distance , viz the cross-en... | [
{
"end": 68,
"id": "T1",
"label": "Method",
"start": 43,
"text": "Kullback-Leibler distance"
},
{
"end": 104,
"id": "T2",
"label": "Method",
"start": 88,
"text": "relative entropy"
},
{
"end": 152,
"id": "T3",
"label": "Method",
"start": 118,
"text... | [
{
"head": "probabilistic context-free grammar",
"head_span": [
118,
152
],
"relation": "COMPARE",
"tail": "probabilistic finite automaton",
"tail_span": [
161,
191
]
},
{
"head": "cross-entropy",
"head_span": [
312,
325
],
"relation... | [
[
"Kullback-Leibler distance",
"relative entropy",
"Kullback-Leibler distance"
],
[
"probabilistic finite automata",
"probabilistic finite automaton"
],
[
"probabilistic context-free grammar",
"probabilistic context-free grammars"
]
] |
C04-1022 | [
[
"Statistical",
"language",
"modeling",
"remains",
"a",
"challenging",
"task,",
"in",
"particular",
"for",
"morphologically",
"rich",
"languages",
".",
"Recently,",
"new",
"approaches",
"based",
"on",
"factored",
"language",
"m... | [
"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... |
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 th... | [
{
"end": 31,
"id": "T1",
"label": "Method",
"start": 2,
"text": "Statistical language modeling"
},
{
"end": 59,
"id": "T2",
"label": "Generic",
"start": 55,
"text": "task"
},
{
"end": 110,
"id": "T3",
"label": "Material",
"start": 80,
"text": "morp... | [
{
"head": "genetic search",
"head_span": [
605,
619
],
"relation": "USED-FOR",
"tail": "entirely data-driven model selection procedure",
"tail_span": [
547,
593
]
},
{
"head": "knowledge-based and random selection procedures",
"head_span": [
657,... | [
[
"approaches",
"models"
],
[
"Statistical language modeling",
"task"
]
] |
C04-1024 | [
[
"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",
"se... | [
"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",... |
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 ... | [
{
"end": 48,
"id": "T1",
"label": "Method",
"start": 15,
"text": "bit-vector-based CKY-style parser"
},
{
"end": 75,
"id": "T2",
"label": "Task",
"start": 55,
"text": "context-free parsing"
},
{
"end": 102,
"id": "T3",
"label": "Method",
"start": 96,
... | [
{
"head": "bit-vector-based CKY-style parser",
"head_span": [
15,
48
],
"relation": "USED-FOR",
"tail": "context-free parsing",
"tail_span": [
55,
75
]
},
{
"head": "bit-vector operations",
"head_span": [
271,
292
],
"relation": "US... | [
[
"bit-vector-based CKY-style parser",
"parser",
"parser",
"parser"
]
] |
C04-1035 | [
[
"This",
"paper",
"presents",
"a",
"machine",
"learning",
"approach",
"to",
"bare",
"slice",
"disambiguation",
"in",
"dialogue",
".",
"We",
"extract",
"a",
"set",
"of",
"heuristic",
"principles",
"from",
"a",
"corpus-ba... | [
"This",
"paper",
"presents",
"a",
"machine",
"learning",
"approach",
"to",
"bare",
"slice",
"disambiguation",
"in",
"dialogue",
".",
"We",
"extract",
"a",
"set",
"of",
"heuristic",
"principles",
"from",
"a",
"corpus-based",
"sample",
"and",
"formulate",
"them",
... |
This paper presents a machine learning approach to bare slice disambiguation in dialogue . We extract a set of heuristic principles from a corpus-based sample and formulate them as probabilistic Horn clauses . We then use the predicates of such clauses to create a set of domain independent features to an... | [
{
"end": 49,
"id": "T1",
"label": "Method",
"start": 24,
"text": "machine learning approach"
},
{
"end": 80,
"id": "T2",
"label": "Task",
"start": 55,
"text": "bare slice disambiguation"
},
{
"end": 94,
"id": "T3",
"label": "Material",
"start": 86,
... | [
{
"head": "machine learning approach",
"head_span": [
24,
49
],
"relation": "USED-FOR",
"tail": "bare slice disambiguation",
"tail_span": [
55,
80
]
},
{
"head": "probabilistic Horn clauses",
"head_span": [
192,
218
],
"relation": "... | [
[
"machine learning approach",
"machine learning algorithms"
],
[
"heuristic principles",
"heuristic principles"
],
[
"Horn clauses",
"probabilistic Horn clauses",
"clauses"
],
[
"features",
"features"
]
] |
C04-1036 | [
[
"We",
"suggest",
"a",
"new",
"goal",
"and",
"evaluation",
"criterion",
"for",
"word",
"similarity",
"measures",
".",
"The",
"new",
"criterion",
"–",
"meaning-entailing",
"substitutability",
"–",
"fits",
"the",
"needs",
... | [
"We",
"suggest",
"a",
"new",
"goal",
"and",
"evaluation",
"criterion",
"for",
"word",
"similarity",
"measures",
".",
"The",
"new",
"criterion",
"–",
"meaning-entailing",
"substitutability",
"–",
"fits",
"the",
"needs",
"of",
"semantic-oriented",
"NLP",
"applicatio... |
We suggest a new goal and evaluation criterion for word similarity measures . The new criterion – meaning-entailing substitutability – fits the needs of semantic-oriented NLP applications and can be evaluated directly (independent of an application) at a good level of human agreement . Motivated by this seman... | [
{
"end": 48,
"id": "T1",
"label": "Metric",
"start": 28,
"text": "evaluation criterion"
},
{
"end": 79,
"id": "T2",
"label": "Metric",
"start": 55,
"text": "word similarity measures"
},
{
"end": 99,
"id": "T3",
"label": "Generic",
"start": 90,
"tex... | [
{
"head": "meaning-entailing substitutability",
"head_span": [
103,
137
],
"relation": "USED-FOR",
"tail": "semantic-oriented NLP applications",
"tail_span": [
160,
194
]
},
{
"head": "semantic criterion",
"head_span": [
315,
333
],
... | [
[
"evaluation criterion",
"criterion",
"meaning-entailing substitutability",
"semantic criterion"
]
] |
C04-1058 | [
[
"Empirical",
"experience",
"and",
"observations",
"have",
"shown",
"us",
"when",
"powerful",
"and",
"highly",
"tunable",
"classifiers",
"such",
"as",
"maximum",
"entropy",
"classifiers",
",",
"boosting",
"and",
"SVMs",
"ar... | [
"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",
"processi... |
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 ... | [
{
"end": 98,
"id": "T1",
"label": "Method",
"start": 87,
"text": "classifiers"
},
{
"end": 136,
"id": "T2",
"label": "Method",
"start": 109,
"text": "maximum entropy classifiers"
},
{
"end": 148,
"id": "T3",
"label": "Method",
"start": 140,
"text":... | [
{
"head": "maximum entropy classifiers",
"head_span": [
109,
136
],
"relation": "HYPONYM-OF",
"tail": "classifiers",
"tail_span": [
87,
98
]
},
{
"head": "boosting",
"head_span": [
140,
148
],
"relation": "HYPONYM-OF",
"tail": "... | [
[
"error correction mechanisms",
"error corrector"
],
[
"it",
"NTPC",
"N-fold Templated Piped Correction, or NTPC (\"nitpick\")"
],
[
"base models",
"base classifier"
]
] |
C04-1068 | [
[
"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"... | [
"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",
"... |
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 ... | [
{
"end": 124,
"id": "T1",
"label": "Task",
"start": 102,
"text": "electronic discussions"
},
{
"end": 167,
"id": "T2",
"label": "Task",
"start": 145,
"text": "help-desk applications"
},
{
"end": 314,
"id": "T3",
"label": "OtherScientificTerm",
"start":... | [
{
"head": "electronic newsgroup discussions",
"head_span": [
513,
545
],
"relation": "EVALUATE-FOR",
"tail": "clustering and filtering processes",
"tail_span": [
473,
507
]
},
{
"head": "coarse-level clustering",
"head_span": [
613,
636
... | [
[
"electronic discussions",
"electronic discussions"
]
] |
C04-1080 | [
[
"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",... | [
"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",
... |
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 b... | [
{
"end": 28,
"id": "T1",
"label": "Method",
"start": 18,
"text": "HMM tagger"
},
{
"end": 108,
"id": "T2",
"label": "Generic",
"start": 106,
"text": "it"
},
{
"end": 154,
"id": "T3",
"label": "Task",
"start": 122,
"text": "unsupervised and supervis... | [
{
"head": "unsupervised methods",
"head_span": [
222,
242
],
"relation": "USED-FOR",
"tail": "part-of-speech tagging",
"tail_span": [
247,
269
]
},
{
"head": "unsupervised and supervised case",
"head_span": [
122,
154
],
"relation":... | [
[
"HMM tagger",
"tagger",
"it"
],
[
"unsupervised methods",
"algorithms"
]
] |
C04-1096 | [
[
"Past",
"work",
"of",
"generating",
"referring",
"expressions",
"mainly",
"utilized",
"attributes",
"of",
"objects",
"and",
"binary",
"relations",
"between",
"objects",
".",
"However,",
"such",
"an",
"approach",
"does",
"n... | [
"Past",
"work",
"of",
"generating",
"referring",
"expressions",
"mainly",
"utilized",
"attributes",
"of",
"objects",
"and",
"binary",
"relations",
"between",
"objects",
".",
"However,",
"such",
"an",
"approach",
"does",
"not",
"work",
"well",
"when",
"there",
"i... |
Past work of generating referring expressions mainly utilized attributes of objects and binary relations between objects . However, such an approach does not work well when there is no distinctive attribute among objects . To overcome this limitation, this paper proposes a method utilizing the perceptual group... | [
{
"end": 47,
"id": "T1",
"label": "OtherScientificTerm",
"start": 26,
"text": "referring expressions"
},
{
"end": 110,
"id": "T2",
"label": "OtherScientificTerm",
"start": 94,
"text": "binary relations"
},
{
"end": 355,
"id": "T3",
"label": "OtherScientifi... | [] | [
[
"generation algorithm",
"method"
]
] |
C04-1102 | [
[
"We",
"propose",
"a",
"detection",
"method",
"for",
"orthographic",
"variants",
"caused",
"by",
"transliteration",
"in",
"a",
"large",
"corpus",
".",
"The",
"method",
"employs",
"two",
"similarities",
".",
"One",
"is",... | [
"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",
"e... |
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.... | [
{
"end": 31,
"id": "T1",
"label": "Method",
"start": 15,
"text": "detection method"
},
{
"end": 58,
"id": "T2",
"label": "OtherScientificTerm",
"start": 37,
"text": "orthographic variants"
},
{
"end": 85,
"id": "T3",
"label": "Task",
"start": 70,
"... | [
{
"head": "edit distance",
"head_span": [
184,
197
],
"relation": "USED-FOR",
"tail": "string similarity",
"tail_span": [
155,
172
]
},
{
"head": "vector space model",
"head_span": [
243,
261
],
"relation": "USED-FOR",
"tail": "... | [
[
"detection method",
"method",
"method"
]
] |
C04-1103 | [
[
"Machine",
"transliteration/back-transliteration",
"plays",
"an",
"important",
"role",
"in",
"many",
"multilingual",
"speech",
"and",
"language",
"applications",
".",
"In",
"this",
"paper,",
"a",
"novel",
"framework",
"for",
"... | [
"Machine",
"transliteration/back-transliteration",
"plays",
"an",
"important",
"role",
"in",
"many",
"multilingual",
"speech",
"and",
"language",
"applications",
".",
"In",
"this",
"paper,",
"a",
"novel",
"framework",
"for",
"machine",
"transliteration/backtransliteration... |
Machine transliteration/back-transliteration plays an important role in many multilingual speech and language applications . In this paper, a novel framework for machine transliteration/backtransliteration that allows us to carry out direct orthographical mapping (DOM) between two different languages is prese... | [
{
"end": 46,
"id": "T1",
"label": "Task",
"start": 2,
"text": "Machine transliteration/back-transliteration"
},
{
"end": 126,
"id": "T2",
"label": "Task",
"start": 81,
"text": "multilingual speech and language applications"
},
{
"end": 161,
"id": "T3",
"la... | [
{
"head": "Machine transliteration/back-transliteration",
"head_span": [
2,
46
],
"relation": "USED-FOR",
"tail": "multilingual speech and language applications",
"tail_span": [
81,
126
]
},
{
"head": "machine transliteration/backtransliteration",
"hea... | [
[
"Machine transliteration/back-transliteration",
"transliteration/backtransliteration",
"machine transliteration/backtransliteration"
],
[
"methods",
"method",
"joint source-channel transliteration model",
"n-gram transliteration model (n-gram TM)"
],
[
"framework",
"fra... |
C04-1106 | [
[
"The",
"reality",
"of",
"analogies",
"between",
"words",
"is",
"refuted",
"by",
"noone",
"(e.g.,",
"I",
"walked",
"is",
"to",
"to",
"walk",
"as",
"I",
"laughed",
"is",
"to",
"to",
"laugh,",
"noted",
"I",
"w... | [
"The",
"reality",
"of",
"analogies",
"between",
"words",
"is",
"refuted",
"by",
"noone",
"(e.g.,",
"I",
"walked",
"is",
"to",
"to",
"walk",
"as",
"I",
"laughed",
"is",
"to",
"to",
"laugh,",
"noted",
"I",
"walked",
":",
"to",
"walk",
"::",
"I",
"laughed... | The reality of analogies between words is refuted by noone (e.g., I walked is to to walk as I laughed is to to laugh, noted I walked : to walk :: I laughed : to laugh). But computational linguists seem to be quite dubious about analogies between sentences : they would not be enough numerous to be of any use. We ... | [
{
"end": 40,
"id": "T1",
"label": "Task",
"start": 17,
"text": "analogies between words"
},
{
"end": 261,
"id": "T2",
"label": "Task",
"start": 234,
"text": "analogies between sentences"
},
{
"end": 374,
"id": "T3",
"label": "Material",
"start": 355,
... | [
{
"head": "multilingual corpus",
"head_span": [
355,
374
],
"relation": "EVALUATE-FOR",
"tail": "analogies",
"tail_span": [
403,
412
]
}
] | [] |
C04-1112 | [
[
"In",
"this",
"paper,",
"we",
"present",
"a",
"corpus-based",
"supervised",
"word",
"sense",
"disambiguation",
"(WSD)",
"system",
"for",
"Dutch",
"which",
"combines",
"statistical",
"classification",
"(",
"maximum",
"entropy",... | [
"In",
"this",
"paper,",
"we",
"present",
"a",
"corpus-based",
"supervised",
"word",
"sense",
"disambiguation",
"(WSD)",
"system",
"for",
"Dutch",
"which",
"combines",
"statistical",
"classification",
"(",
"maximum",
"entropy",
")",
"with",
"linguistic",
"information... |
In this paper, we present a corpus-based supervised word sense disambiguation (WSD) system for Dutch which combines statistical classification ( maximum entropy ) with linguistic information . Instead of building individual classifiers per ambiguous wordform , we introduce a lemma-based approach . The advan... | [
{
"end": 92,
"id": "T1",
"label": "Method",
"start": 30,
"text": "corpus-based supervised word sense disambiguation (WSD) system"
},
{
"end": 104,
"id": "T2",
"label": "Material",
"start": 99,
"text": "Dutch"
},
{
"end": 148,
"id": "T3",
"label": "Method",... | [
{
"head": "corpus-based supervised word sense disambiguation (WSD) system",
"head_span": [
30,
92
],
"relation": "USED-FOR",
"tail": "Dutch",
"tail_span": [
99,
104
]
},
{
"head": "classifiers",
"head_span": [
233,
244
],
"relation"... | [
[
"statistical classification",
"maximum entropy"
],
[
"corpus-based supervised word sense disambiguation (WSD) system",
"it",
"algorithm",
"lemma-based model",
"WSD system based on lemmas",
"lemma-based approach",
"method"
]
] |
C04-1116 | [
[
"We",
"present",
"a",
"text",
"mining",
"method",
"for",
"finding",
"synonymous",
"expressions",
"based",
"on",
"the",
"distributional",
"hypothesis",
"in",
"a",
"set",
"of",
"coherent",
"corpora",
".",
"This",
"paper"... | [
"We",
"present",
"a",
"text",
"mining",
"method",
"for",
"finding",
"synonymous",
"expressions",
"based",
"on",
"the",
"distributional",
"hypothesis",
"in",
"a",
"set",
"of",
"coherent",
"corpora",
".",
"This",
"paper",
"proposes",
"a",
"new",
"methodology",
"... |
We present a text mining method for finding synonymous expressions based on the distributional hypothesis in a set of coherent corpora . This paper proposes a new methodology to improve the accuracy of a term aggregation system using each author's text as a coherent corpus . Our approach is based on the ... | [
{
"end": 33,
"id": "T1",
"label": "Method",
"start": 15,
"text": "text mining method"
},
{
"end": 70,
"id": "T2",
"label": "OtherScientificTerm",
"start": 48,
"text": "synonymous expressions"
},
{
"end": 111,
"id": "T3",
"label": "OtherScientificTerm",
... | [
{
"head": "distributional hypothesis",
"head_span": [
86,
111
],
"relation": "USED-FOR",
"tail": "text mining method",
"tail_span": [
15,
33
]
},
{
"head": "text mining method",
"head_span": [
15,
33
],
"relation": "USED-FOR",
"... | [
[
"text mining method",
"method",
"approach",
"methodology",
"approach"
],
[
"term aggregation system",
"term aggregation system"
]
] |
C04-1128 | [
[
"While",
"sentence",
"extraction",
"as",
"an",
"approach",
"to",
"summarization",
"has",
"been",
"shown",
"to",
"work",
"in",
"documents",
"of",
"certain",
"genres",
",",
"because",
"of",
"the",
"conversational",
"natu... | [
"While",
"sentence",
"extraction",
"as",
"an",
"approach",
"to",
"summarization",
"has",
"been",
"shown",
"to",
"work",
"in",
"documents",
"of",
"certain",
"genres",
",",
"because",
"of",
"the",
"conversational",
"nature",
"of",
"email",
"communication",
"where"... |
While sentence extraction as an approach to summarization has been shown to work in documents of certain genres , because of the conversational nature of email communication where utterances are made in relation to one made previously, sentence extraction may not capture the necessary segments of dialo... | [
{
"end": 27,
"id": "T1",
"label": "Method",
"start": 8,
"text": "sentence extraction"
},
{
"end": 61,
"id": "T2",
"label": "Task",
"start": 48,
"text": "summarization"
},
{
"end": 182,
"id": "T3",
"label": "Material",
"start": 163,
"text": "email c... | [
{
"head": "sentence extraction",
"head_span": [
8,
27
],
"relation": "USED-FOR",
"tail": "summarization",
"tail_span": [
48,
61
]
},
{
"head": "features",
"head_span": [
530,
538
],
"relation": "USED-FOR",
"tail": "lexical simil... | [
[
"sentence extraction",
"sentence extraction"
]
] |
C04-1147 | [
[
"We",
"present",
"a",
"framework",
"for",
"the",
"fast",
"computation",
"of",
"lexical",
"affinity",
"models",
".",
"The",
"framework",
"is",
"composed",
"of",
"a",
"novel",
"algorithm",
"to",
"efficiently",
"compute",... | [
"We",
"present",
"a",
"framework",
"for",
"the",
"fast",
"computation",
"of",
"lexical",
"affinity",
"models",
".",
"The",
"framework",
"is",
"composed",
"of",
"a",
"novel",
"algorithm",
"to",
"efficiently",
"compute",
"the",
"co-occurrence",
"distribution",
"be... |
We present a framework for the fast computation of lexical affinity models . The framework is composed of a novel algorithm to efficiently compute the co-occurrence distribution between pairs of terms , an independence model , and a parametric affinity model . In comparison with previous models , which either... | [
{
"end": 23,
"id": "T1",
"label": "Generic",
"start": 14,
"text": "framework"
},
{
"end": 78,
"id": "T2",
"label": "Task",
"start": 32,
"text": "fast computation of lexical affinity models"
},
{
"end": 94,
"id": "T3",
"label": "Generic",
"start": 85... | [
{
"head": "lexical affinity",
"head_span": [
391,
407
],
"relation": "USED-FOR",
"tail": "sequential models",
"tail_span": [
420,
437
]
},
{
"head": "algorithm",
"head_span": [
118,
127
],
"relation": "PART-OF",
"tail": "framewo... | [
[
"framework",
"framework",
"it",
"framework"
]
] |
C04-1192 | [
[
"The",
"paper",
"presents",
"a",
"method",
"for",
"word",
"sense",
"disambiguation",
"based",
"on",
"parallel",
"corpora",
".",
"The",
"method",
"exploits",
"recent",
"advances",
"in",
"word",
"alignment",
"and",
"word... | [
"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",... |
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 . Th... | [
{
"end": 28,
"id": "T1",
"label": "Generic",
"start": 22,
"text": "method"
},
{
"end": 59,
"id": "T2",
"label": "Task",
"start": 34,
"text": "word sense disambiguation"
},
{
"end": 87,
"id": "T3",
"label": "Material",
"start": 71,
"text": "parallel... | [
{
"head": "method",
"head_span": [
22,
28
],
"relation": "USED-FOR",
"tail": "word sense disambiguation",
"tail_span": [
34,
59
]
},
{
"head": "method",
"head_span": [
94,
100
],
"relation": "USED-FOR",
"tail": "word alignment",... | [
[
"method",
"method",
"method"
],
[
"WSD system",
"system",
"word sense disambiguation"
],
[
"aligned wordnets",
"wordnets"
]
] |
C08-1118 | [
[
"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",
... | [
"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",
"... |
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 (87.2%-96.7% accuracy depending on classification method ). The paper also examines in detail which positive markers are most po... | [
{
"end": 108,
"id": "T1",
"label": "Material",
"start": 86,
"text": "medium-length speeches"
},
{
"end": 132,
"id": "T2",
"label": "Material",
"start": 117,
"text": "EUROPARL corpus"
},
{
"end": 185,
"id": "T3",
"label": "Method",
"start": 151,
"te... | [
{
"head": "medium-length speeches",
"head_span": [
86,
108
],
"relation": "PART-OF",
"tail": "EUROPARL corpus",
"tail_span": [
117,
132
]
},
{
"head": "accuracy",
"head_span": [
201,
209
],
"relation": "EVALUATE-FOR",
"tail": "c... | [] |
C08-1128 | [
[
"Words",
"in",
"Chinese",
"text",
"are",
"not",
"naturally",
"separated",
"by",
"delimiters",
",",
"which",
"poses",
"a",
"challenge",
"to",
"standard",
"machine",
"translation",
"(MT)",
"systems",
".",
"In",
"MT",
... | [
"Words",
"in",
"Chinese",
"text",
"are",
"not",
"naturally",
"separated",
"by",
"delimiters",
",",
"which",
"poses",
"a",
"challenge",
"to",
"standard",
"machine",
"translation",
"(MT)",
"systems",
".",
"In",
"MT",
",",
"the",
"widely",
"used",
"approach",
"... |
Words in Chinese text are not naturally separated by delimiters , which poses a challenge to standard machine translation (MT) 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 necess... | [
{
"end": 25,
"id": "T1",
"label": "Material",
"start": 13,
"text": "Chinese text"
},
{
"end": 141,
"id": "T2",
"label": "Task",
"start": 109,
"text": "machine translation (MT) systems"
},
{
"end": 150,
"id": "T3",
"label": "Task",
"start": 148,
"te... | [
{
"head": "Chinese word segmenter",
"head_span": [
193,
215
],
"relation": "USED-FOR",
"tail": "MT",
"tail_span": [
148,
150
]
},
{
"head": "monolingual and bilingual information",
"head_span": [
442,
479
],
"relation": "USED-FOR",
... | [
[
"MT",
"machine translation (MT) systems",
"MT",
"translation"
],
[
"Chinese word segmenter",
"word segmentation"
],
[
"method",
"Bayesian semi-supervised Chinese word segmentation model"
]
] |
C08-2010 | [
[
"Language",
"resource",
"quality",
"is",
"crucial",
"in",
"NLP",
".",
"Many",
"of",
"the",
"resources",
"used",
"are",
"derived",
"from",
"data",
"created",
"by",
"human",
"beings",
"out",
"of",
"an",
"NLP",
"c... | [
"Language",
"resource",
"quality",
"is",
"crucial",
"in",
"NLP",
".",
"Many",
"of",
"the",
"resources",
"used",
"are",
"derived",
"from",
"data",
"created",
"by",
"human",
"beings",
"out",
"of",
"an",
"NLP",
"context,",
"especially",
"regarding",
"MT",
"and"... |
Language resource quality is crucial in NLP . Many of the resources used are derived from data created by human beings out of an NLP context, especially regarding MT and reference translations . Indeed, automatic evaluations need high-quality data that allow the comparison of both automatic and human tran... | [
{
"end": 27,
"id": "T1",
"label": "Metric",
"start": 2,
"text": "Language resource quality"
},
{
"end": 47,
"id": "T2",
"label": "Task",
"start": 44,
"text": "NLP"
},
{
"end": 137,
"id": "T3",
"label": "Task",
"start": 134,
"text": "NLP"
},
{
... | [
{
"head": "high-quality data",
"head_span": [
242,
259
],
"relation": "EVALUATE-FOR",
"tail": "automatic evaluations",
"tail_span": [
213,
234
]
},
{
"head": "automatic metrics",
"head_span": [
615,
632
],
"relation": "EVALUATE-FOR"... | [
[
"evaluation",
"automatic evaluations"
],
[
"MT",
"MT"
],
[
"NLP",
"NLP"
],
[
"high-quality data",
"resources"
]
] |
C08-3010 | [
[
"In",
"this",
"paper,",
"we",
"will",
"describe",
"a",
"search",
"tool",
"for",
"a",
"huge",
"set",
"of",
"ngrams",
".",
"The",
"tool",
"supports",
"queries",
"with",
"an",
"arbitrary",
"number",
"of",
"wildcar... | [
"In",
"this",
"paper,",
"we",
"will",
"describe",
"a",
"search",
"tool",
"for",
"a",
"huge",
"set",
"of",
"ngrams",
".",
"The",
"tool",
"supports",
"queries",
"with",
"an",
"arbitrary",
"number",
"of",
"wildcards",
".",
"It",
"takes",
"a",
"fraction",
"o... |
In this paper, we will describe a search tool for a huge set of ngrams . The tool supports queries with an arbitrary number of wildcards . It takes a fraction of a second for a search, and can provide the fillers of the wildcards . The system runs on a single Linux PC with reasonable size memory (less than ... | [
{
"end": 47,
"id": "T1",
"label": "Method",
"start": 36,
"text": "search tool"
},
{
"end": 74,
"id": "T2",
"label": "OtherScientificTerm",
"start": 68,
"text": "ngrams"
},
{
"end": 85,
"id": "T3",
"label": "Generic",
"start": 81,
"text": "tool"
}... | [
{
"head": "search tool",
"head_span": [
36,
47
],
"relation": "USED-FOR",
"tail": "ngrams",
"tail_span": [
68,
74
]
},
{
"head": "tool",
"head_span": [
394,
398
],
"relation": "USED-FOR",
"tail": "linguistic knowledge discovery"... | [
[
"search tool",
"tool",
"It",
"system",
"system",
"tool"
]
] |
C80-1039 | [
[
"In",
"order",
"to",
"meet",
"the",
"needs",
"of",
"a",
"publication",
"of",
"papers",
"in",
"English,",
"many",
"systems",
"to",
"run",
"off",
"texts",
"have",
"been",
"developed.",
"In",
"this",
"paper,",
"we... | [
"In",
"order",
"to",
"meet",
"the",
"needs",
"of",
"a",
"publication",
"of",
"papers",
"in",
"English,",
"many",
"systems",
"to",
"run",
"off",
"texts",
"have",
"been",
"developed.",
"In",
"this",
"paper,",
"we",
"report",
"a",
"system",
"FROFF",
"which",
... |
In order to meet the needs of a publication of papers in English, many systems to run off texts have been developed. In this paper, we report a system FROFF which can make a fair copy of not only texts but also graphs and tables indispensable to our papers. Its selection of fonts , specification of character s... | [
{
"end": 153,
"id": "T1",
"label": "Generic",
"start": 147,
"text": "system"
},
{
"end": 160,
"id": "T2",
"label": "Method",
"start": 155,
"text": "FROFF"
},
{
"end": 376,
"id": "T3",
"label": "OtherScientificTerm",
"start": 361,
"text": "typing lo... | [
{
"head": "rules",
"head_span": [
556,
561
],
"relation": "USED-FOR",
"tail": "mathematical expressions",
"tail_span": [
640,
664
]
},
{
"head": "commands",
"head_span": [
543,
551
],
"relation": "USED-FOR",
"tail": "mathematica... | [
[
"system",
"FROFF"
]
] |
C80-1073 | [
[
"An",
"attempt",
"has",
"been",
"made",
"to",
"use",
"an",
"Augmented",
"Transition",
"Network",
"as",
"a",
"procedural",
"dialog",
"model",
".",
"The",
"development",
"of",
"such",
"a",
"model",
"appears",
"to",
... | [
"An",
"attempt",
"has",
"been",
"made",
"to",
"use",
"an",
"Augmented",
"Transition",
"Network",
"as",
"a",
"procedural",
"dialog",
"model",
".",
"The",
"development",
"of",
"such",
"a",
"model",
"appears",
"to",
"be",
"important",
"in",
"several",
"respects... |
An attempt has been made to use an Augmented Transition Network as a procedural dialog model . The development of such a model appears to be important in several respects: as a device to represent and to use different dialog schemata proposed in empirical conversation analysis ; as a device to represent an... | [
{
"end": 67,
"id": "T1",
"label": "Method",
"start": 39,
"text": "Augmented Transition Network"
},
{
"end": 98,
"id": "T2",
"label": "Method",
"start": 86,
"text": "dialog model"
},
{
"end": 134,
"id": "T3",
"label": "Generic",
"start": 129,
"text"... | [
{
"head": "Augmented Transition Network",
"head_span": [
39,
67
],
"relation": "HYPONYM-OF",
"tail": "dialog model",
"tail_span": [
86,
98
]
},
{
"head": "verbal interactions",
"head_span": [
588,
607
],
"relation": "FEATURE-OF",
... | [
[
"Augmented Transition Network",
"device",
"ATN",
"model",
"device",
"device"
],
[
"verbal interaction",
"verbal interactions",
"verbal interaction"
],
[
"dialog schemata",
"dialog schemata"
]
] |
C82-1054 | [
[
"This",
"paper",
"proposes",
"a",
"series",
"of",
"modifications",
"to",
"the",
"left",
"corner",
"parsing",
"algorithm",
"for",
"context-free",
"grammars",
".",
"It",
"is",
"argued",
"that",
"the",
"resulting",
"algor... | [
"This",
"paper",
"proposes",
"a",
"series",
"of",
"modifications",
"to",
"the",
"left",
"corner",
"parsing",
"algorithm",
"for",
"context-free",
"grammars",
".",
"It",
"is",
"argued",
"that",
"the",
"resulting",
"algorithm",
"is",
"both",
"efficient",
"and",
"... |
This paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars . It is argued that the resulting algorithm is both efficient and flexible and is, therefore, a good choice for the parser used in a natural language interface . | [
{
"end": 86,
"id": "T1",
"label": "Method",
"start": 57,
"text": "left corner parsing algorithm"
},
{
"end": 114,
"id": "T2",
"label": "Method",
"start": 93,
"text": "context-free grammars"
},
{
"end": 159,
"id": "T3",
"label": "Generic",
"start": 150,... | [
{
"head": "left corner parsing algorithm",
"head_span": [
57,
86
],
"relation": "USED-FOR",
"tail": "context-free grammars",
"tail_span": [
93,
114
]
},
{
"head": "parser",
"head_span": [
233,
239
],
"relation": "USED-FOR",
"tai... | [
[
"left corner parsing algorithm",
"algorithm"
]
] |
C86-1021 | [
[
"The",
"interlingual",
"approach",
"to",
"MT",
"has",
"been",
"repeatedly",
"advocated",
"by",
"researchers",
"originally",
"interested",
"in",
"natural",
"language",
"understanding",
"who",
"take",
"machine",
"translation",
"... | [
"The",
"interlingual",
"approach",
"to",
"MT",
"has",
"been",
"repeatedly",
"advocated",
"by",
"researchers",
"originally",
"interested",
"in",
"natural",
"language",
"understanding",
"who",
"take",
"machine",
"translation",
"to",
"be",
"one",
"possible",
"applicati... |
The interlingual approach to MT has been repeatedly advocated by researchers originally interested in natural language understanding who take machine translation to be one possible application. However, not only the ambiguity but also the vagueness which every natural language inevitably has leads this appro... | [
{
"end": 27,
"id": "T1",
"label": "Method",
"start": 6,
"text": "interlingual approach"
},
{
"end": 33,
"id": "T2",
"label": "Generic",
"start": 31,
"text": "MT"
},
{
"end": 136,
"id": "T3",
"label": "Task",
"start": 106,
"text": "natural language ... | [
{
"head": "interlingual approach",
"head_span": [
6,
27
],
"relation": "USED-FOR",
"tail": "MT",
"tail_span": [
31,
33
]
},
{
"head": "Mu-project",
"head_span": [
384,
394
],
"relation": "USED-FOR",
"tail": "MT",
"tail_span"... | [
[
"MT",
"machine translation"
],
[
"system",
"system",
"Mu-project",
"system"
],
[
"transfer phase",
"transfer approach",
"transfer phase"
],
[
"principles",
"principles"
],
[
"interlingual approach",
"interlingual approach"
]
] |
C86-1081 | [
[
"Determiners",
"play",
"an",
"important",
"role",
"in",
"conveying",
"the",
"meaning",
"of",
"an",
"utterance",
",",
"but",
"they",
"have",
"often",
"been",
"disregarded,",
"perhaps",
"because",
"it",
"seemed",
"more",... | [
"Determiners",
"play",
"an",
"important",
"role",
"in",
"conveying",
"the",
"meaning",
"of",
"an",
"utterance",
",",
"but",
"they",
"have",
"often",
"been",
"disregarded,",
"perhaps",
"because",
"it",
"seemed",
"more",
"important",
"to",
"devise",
"methods",
"... |
Determiners play an important role in conveying the meaning of an utterance , but they have often been disregarded, perhaps because it seemed more important to devise methods to grasp the global meaning of a sentence , even if not in a precise way. Another problem with determiners is their inherent ambi... | [
{
"end": 15,
"id": "T1",
"label": "Method",
"start": 4,
"text": "Determiners"
},
{
"end": 295,
"id": "T2",
"label": "Method",
"start": 284,
"text": "determiners"
},
{
"end": 325,
"id": "T3",
"label": "OtherScientificTerm",
"start": 316,
"text": "am... | [
{
"head": "ambiguity",
"head_span": [
316,
325
],
"relation": "FEATURE-OF",
"tail": "determiners",
"tail_span": [
284,
295
]
},
{
"head": "logical formalism",
"head_span": [
357,
374
],
"relation": "USED-FOR",
"tail": "determine... | [
[
"Determiners",
"determiners",
"determiners"
]
] |
C86-1105 | [
[
"How",
"to",
"obtain",
"hierarchical",
"relations",
"(e.g.",
"superordinate",
"-hyponym",
"relation",
",",
"synonym",
"relation",
")",
"is",
"one",
"of",
"the",
"most",
"important",
"problems",
"for",
"thesaurus",
"constru... | [
"How",
"to",
"obtain",
"hierarchical",
"relations",
"(e.g.",
"superordinate",
"-hyponym",
"relation",
",",
"synonym",
"relation",
")",
"is",
"one",
"of",
"the",
"most",
"important",
"problems",
"for",
"thesaurus",
"construction",
".",
"A",
"pilot",
"system",
"fo... |
How to obtain hierarchical relations (e.g. superordinate -hyponym relation , synonym relation ) is one of the most important problems for thesaurus construction . A pilot system for extracting these relations automatically from an ordinary Japanese language dictionary (Shinmeikai Kokugojiten, published by Sans... | [
{
"end": 38,
"id": "T1",
"label": "OtherScientificTerm",
"start": 16,
"text": "hierarchical relations"
},
{
"end": 77,
"id": "T2",
"label": "OtherScientificTerm",
"start": 46,
"text": "superordinate -hyponym relation"
},
{
"end": 97,
"id": "T3",
"label": "... | [
{
"head": "hierarchical relations",
"head_span": [
16,
38
],
"relation": "PART-OF",
"tail": "thesaurus construction",
"tail_span": [
143,
165
]
},
{
"head": "Japanese language dictionary",
"head_span": [
248,
276
],
"relation": "USE... | [
[
"hierarchical relations",
"hierarchical relations",
"relations"
],
[
"Japanese language dictionary",
"dictionary"
]
] |
C86-1132 | [
[
"This",
"paper",
"describes",
"a",
"system",
"(",
"RAREAS",
")",
"which",
"synthesizes",
"marine",
"weather",
"forecasts",
"directly",
"from",
"formatted",
"weather",
"data",
".",
"Such",
"synthesis",
"appears",
"feasible"... | [
"This",
"paper",
"describes",
"a",
"system",
"(",
"RAREAS",
")",
"which",
"synthesizes",
"marine",
"weather",
"forecasts",
"directly",
"from",
"formatted",
"weather",
"data",
".",
"Such",
"synthesis",
"appears",
"feasible",
"in",
"certain",
"natural",
"sublanguage... |
This paper describes a system ( RAREAS ) which synthesizes marine weather forecasts directly from formatted weather data . Such synthesis appears feasible in certain natural sublanguages with stereotyped text structure . RAREAS draws on several kinds of linguistic and non-linguistic knowledge and mirro... | [
{
"end": 32,
"id": "T1",
"label": "Generic",
"start": 26,
"text": "system"
},
{
"end": 42,
"id": "T2",
"label": "Method",
"start": 36,
"text": "RAREAS"
},
{
"end": 88,
"id": "T3",
"label": "Task",
"start": 64,
"text": "marine weather forecasts"
}... | [
{
"head": "linguistic and non-linguistic knowledge",
"head_span": [
270,
309
],
"relation": "USED-FOR",
"tail": "RAREAS",
"tail_span": [
235,
241
]
},
{
"head": "bilingual or multi-lingual texts",
"head_span": [
487,
519
],
"relatio... | [
[
"system",
"RAREAS",
"synthesis",
"RAREAS",
"approach"
]
] |
C88-1007 | [
[
"This",
"paper",
"discusses",
"the",
"application",
"of",
"Unification",
"Categorial",
"Grammar",
"(UCG)",
"to",
"the",
"framework",
"of",
"Isomorphic",
"Grammars",
"for",
"Machine",
"Translation",
"pioneered",
"by",
"Landsber... | [
"This",
"paper",
"discusses",
"the",
"application",
"of",
"Unification",
"Categorial",
"Grammar",
"(UCG)",
"to",
"the",
"framework",
"of",
"Isomorphic",
"Grammars",
"for",
"Machine",
"Translation",
"pioneered",
"by",
"Landsbergen.",
"The",
"Isomorphic",
"Grammars",
... |
This paper discusses the application of Unification Categorial Grammar (UCG) 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... | [
{
"end": 80,
"id": "T1",
"label": "Method",
"start": 44,
"text": "Unification Categorial Grammar (UCG)"
},
{
"end": 122,
"id": "T2",
"label": "Method",
"start": 103,
"text": "Isomorphic Grammars"
},
{
"end": 148,
"id": "T3",
"label": "Task",
"start": 1... | [
{
"head": "Isomorphic Grammars",
"head_span": [
103,
122
],
"relation": "USED-FOR",
"tail": "Machine Translation",
"tail_span": [
129,
148
]
},
{
"head": "approach",
"head_span": [
820,
828
],
"relation": "USED-FOR",
"tail": "mo... | [
[
"approach",
"approach",
"Isomorphic Grammars",
"Isomorphic Grammars approach"
],
[
"MT system design",
"Machine Translation",
"MT"
]
] |
C88-1044 | [
[
"This",
"paper",
"presents",
"necessary",
"and",
"sufficient",
"conditions",
"for",
"the",
"use",
"of",
"demonstrative",
"expressions",
"in",
"English",
"and",
"discusses",
"implications",
"for",
"current",
"discourse",
"proce... | [
"This",
"paper",
"presents",
"necessary",
"and",
"sufficient",
"conditions",
"for",
"the",
"use",
"of",
"demonstrative",
"expressions",
"in",
"English",
"and",
"discusses",
"implications",
"for",
"current",
"discourse",
"processing",
"algorithms",
".",
"We",
"examin... |
This paper presents necessary and sufficient conditions for the use of demonstrative expressions in English and discusses implications for current discourse processing algorithms . We examine a broad range of texts to show how the distribution of demonstrative forms and functions is genre dependent . Thi... | [
{
"end": 100,
"id": "T1",
"label": "OtherScientificTerm",
"start": 75,
"text": "demonstrative expressions"
},
{
"end": 113,
"id": "T2",
"label": "Material",
"start": 106,
"text": "English"
},
{
"end": 141,
"id": "T3",
"label": "Generic",
"start": 129,
... | [
{
"head": "demonstrative expressions",
"head_span": [
75,
100
],
"relation": "FEATURE-OF",
"tail": "English",
"tail_span": [
106,
113
]
},
{
"head": "anaphoric expressions",
"head_span": [
361,
382
],
"relation": "USED-FOR",
"ta... | [] |
C88-1066 | [
[
"This",
"paper",
"summarizes",
"the",
"formalism",
"of",
"Category",
"Cooccurrence",
"Restrictions",
"(CCRs)",
"and",
"describes",
"two",
"parsing",
"algorithms",
"that",
"interpret",
"it.",
"CCRs",
"are",
"Boolean",
"conditio... | [
"This",
"paper",
"summarizes",
"the",
"formalism",
"of",
"Category",
"Cooccurrence",
"Restrictions",
"(CCRs)",
"and",
"describes",
"two",
"parsing",
"algorithms",
"that",
"interpret",
"it.",
"CCRs",
"are",
"Boolean",
"conditions",
"on",
"the",
"cooccurrence",
"of",
... |
This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes two parsing algorithms that interpret it. CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current s... | [
{
"end": 84,
"id": "T1",
"label": "Task",
"start": 29,
"text": "formalism of Category Cooccurrence Restrictions (CCRs)"
},
{
"end": 84,
"id": "T2",
"label": "OtherScientificTerm",
"start": 43,
"text": "Category Cooccurrence Restrictions (CCRs)"
},
{
"end": 123,
... | [
{
"head": "restrictive statements",
"head_span": [
418,
440
],
"relation": "FEATURE-OF",
"tail": "syntactic descriptions",
"tail_span": [
368,
390
]
},
{
"head": "logical well-formedness conditions",
"head_span": [
660,
694
],
"rela... | [
[
"CCRs",
"Category Cooccurrence Restrictions (CCRs)",
"CCRs"
],
[
"algorithms",
"parser",
"parsing algorithms"
],
[
"formalism of Category Cooccurrence Restrictions (CCRs)",
"CCR formalism"
]
] |
C88-2086 | [
[
"Soames",
"1979",
"provides",
"some",
"counterexamples",
"to",
"the",
"theory",
"of",
"natural",
"language",
"presuppositions",
"that",
"is",
"presented",
"in",
"Gazdar",
"1979.",
"Soames",
"1982",
"provides",
"a",
"theory... | [
"Soames",
"1979",
"provides",
"some",
"counterexamples",
"to",
"the",
"theory",
"of",
"natural",
"language",
"presuppositions",
"that",
"is",
"presented",
"in",
"Gazdar",
"1979.",
"Soames",
"1982",
"provides",
"a",
"theory",
"which",
"explains",
"these",
"countere... |
Soames 1979 provides some counterexamples to the theory of natural language presuppositions that is presented in Gazdar 1979. Soames 1982 provides a theory which explains these counterexamples. Mercer 1987 rejects the solution found in Soames 1982 leaving these counterexamples unexplained. By reappraising these in... | [
{
"end": 95,
"id": "T1",
"label": "Task",
"start": 63,
"text": "natural language presuppositions"
},
{
"end": 406,
"id": "T2",
"label": "Task",
"start": 374,
"text": "natural language presuppositions"
},
{
"end": 518,
"id": "T3",
"label": "OtherScientificT... | [] | [
[
"natural language presuppositions",
"natural language presuppositions"
]
] |
C88-2130 | [
[
"We",
"have",
"developed",
"a",
"computational",
"model",
"of",
"the",
"process",
"of",
"describing",
"the",
"layout",
"of",
"an",
"apartment",
"or",
"house,",
"a",
"much-studied",
"discourse",
"task",
"first",
"charac... | [
"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",
"... |
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 (1974). The model is embodied in a program, APT , that can reproduce segments of actual tape-recorded descriptions, using organi... | [
{
"end": 43,
"id": "T1",
"label": "Generic",
"start": 24,
"text": "computational model"
},
{
"end": 141,
"id": "T2",
"label": "Task",
"start": 127,
"text": "discourse task"
},
{
"end": 205,
"id": "T3",
"label": "Generic",
"start": 200,
"text": "mod... | [
{
"head": "computational model",
"head_span": [
24,
43
],
"relation": "USED-FOR",
"tail": "discourse task",
"tail_span": [
127,
141
]
},
{
"head": "model",
"head_span": [
200,
205
],
"relation": "PART-OF",
"tail": "program",
... | [
[
"computational model",
"model"
],
[
"program",
"APT"
]
] |
C88-2132 | [
[
"Chart",
"parsing",
"is",
"directional",
"in",
"the",
"sense",
"that",
"it",
"works",
"from",
"the",
"starting",
"point",
"(usually",
"the",
"beginning",
"of",
"the",
"sentence)",
"extending",
"its",
"activity",
"usual... | [
"Chart",
"parsing",
"is",
"directional",
"in",
"the",
"sense",
"that",
"it",
"works",
"from",
"the",
"starting",
"point",
"(usually",
"the",
"beginning",
"of",
"the",
"sentence)",
"extending",
"its",
"activity",
"usually",
"in",
"a",
"rightward",
"manner.",
"W... |
Chart parsing is directional in the sense that it works from the starting point (usually the beginning of the sentence) 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 actuall... | [] | [] | [] |
C88-2160 | [
[
"A",
"new",
"approach",
"for",
"Interactive",
"Machine",
"Translation",
"where",
"the",
"author",
"interacts",
"during",
"the",
"creation",
"or",
"the",
"modification",
"of",
"the",
"document",
"is",
"proposed.",
"The",
... | [
"A",
"new",
"approach",
"for",
"Interactive",
"Machine",
"Translation",
"where",
"the",
"author",
"interacts",
"during",
"the",
"creation",
"or",
"the",
"modification",
"of",
"the",
"document",
"is",
"proposed.",
"The",
"explanation",
"of",
"an",
"ambiguity",
"o... |
A new approach for Interactive Machine Translation where the author interacts during the creation or the modification of the document is proposed. The explanation of an ambiguity or an error for the purposes of correction does not use any concepts of the underlying linguistic theory : it is a reformulation... | [
{
"end": 17,
"id": "T1",
"label": "Generic",
"start": 9,
"text": "approach"
},
{
"end": 54,
"id": "T2",
"label": "Task",
"start": 23,
"text": "Interactive Machine Translation"
},
{
"end": 295,
"id": "T3",
"label": "Method",
"start": 278,
"text": "l... | [
{
"head": "approach",
"head_span": [
9,
17
],
"relation": "USED-FOR",
"tail": "Interactive Machine Translation",
"tail_span": [
23,
54
]
},
{
"head": "paraphrasing",
"head_span": [
519,
531
],
"relation": "USED-FOR",
"tail": "in... | [
[
"approach",
"interactive disambiguation scheme"
]
] |
C88-2162 | [
[
"Computer",
"programs",
"so",
"far",
"have",
"not",
"fared",
"well",
"in",
"modeling",
"language",
"acquisition",
".",
"For",
"one",
"thing,",
"learning",
"methodology",
"applicable",
"in",
"general",
"domains",
"does",
... | [
"Computer",
"programs",
"so",
"far",
"have",
"not",
"fared",
"well",
"in",
"modeling",
"language",
"acquisition",
".",
"For",
"one",
"thing,",
"learning",
"methodology",
"applicable",
"in",
"general",
"domains",
"does",
"not",
"readily",
"lend",
"itself",
"in",
... |
Computer programs so far have not fared well in modeling language acquisition . For one thing, learning methodology applicable in general domains does not readily lend itself in the linguistic domain . For another, linguistic representation used by language processing systems is not geared to learning ... | [
{
"end": 20,
"id": "T1",
"label": "Generic",
"start": 3,
"text": "Computer programs"
},
{
"end": 81,
"id": "T2",
"label": "Task",
"start": 61,
"text": "language acquisition"
},
{
"end": 121,
"id": "T3",
"label": "Method",
"start": 101,
"text": "lea... | [
{
"head": "general domains",
"head_span": [
138,
153
],
"relation": "COMPARE",
"tail": "linguistic domain",
"tail_span": [
192,
209
]
},
{
"head": "linguistic representation",
"head_span": [
227,
252
],
"relation": "USED-FOR",
"... | [
[
"Computer programs",
"program"
],
[
"linguistic concepts",
"linguistic concepts"
],
[
"language acquisition",
"language acquisition"
]
] |
C88-2166 | [
[
"Although",
"every",
"natural",
"language",
"system",
"needs",
"a",
"computational",
"lexicon",
",",
"each",
"system",
"puts",
"different",
"amounts",
"and",
"types",
"of",
"information",
"into",
"its",
"lexicon",
"accordi... | [
"Although",
"every",
"natural",
"language",
"system",
"needs",
"a",
"computational",
"lexicon",
",",
"each",
"system",
"puts",
"different",
"amounts",
"and",
"types",
"of",
"information",
"into",
"its",
"lexicon",
"according",
"to",
"its",
"individual",
"needs.",
... |
Although every natural language system needs a computational lexicon , each system puts different amounts and types of information into its lexicon according to its individual needs. However, some of the information needed across systems is shared or identical information. This paper presents our experience in... | [
{
"end": 42,
"id": "T1",
"label": "Method",
"start": 19,
"text": "natural language system"
},
{
"end": 74,
"id": "T2",
"label": "OtherScientificTerm",
"start": 53,
"text": "computational lexicon"
},
{
"end": 89,
"id": "T3",
"label": "Generic",
"start":... | [
{
"head": "computational lexicon",
"head_span": [
53,
74
],
"relation": "USED-FOR",
"tail": "natural language system",
"tail_span": [
19,
42
]
},
{
"head": "COMPLEX",
"head_span": [
344,
351
],
"relation": "HYPONYM-OF",
"tail": ... | [
[
"natural language system",
"system"
],
[
"computational lexicon",
"computational lexicon"
]
] |
C90-1002 | [
[
"A",
"deterministic",
"parser",
"is",
"under",
"development",
"which",
"represents",
"a",
"departure",
"from",
"traditional",
"deterministic",
"parsers",
"in",
"that",
"it",
"combines",
"both",
"symbolic",
"and",
"connectionis... | [
"A",
"deterministic",
"parser",
"is",
"under",
"development",
"which",
"represents",
"a",
"departure",
"from",
"traditional",
"deterministic",
"parsers",
"in",
"that",
"it",
"combines",
"both",
"symbolic",
"and",
"connectionist",
"components",
".",
"The",
"connectio... |
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 ... | [
{
"end": 24,
"id": "T1",
"label": "Method",
"start": 4,
"text": "deterministic parser"
},
{
"end": 115,
"id": "T2",
"label": "Method",
"start": 94,
"text": "deterministic parsers"
},
{
"end": 127,
"id": "T3",
"label": "Generic",
"start": 125,
"text... | [
{
"head": "training techniques",
"head_span": [
480,
499
],
"relation": "USED-FOR",
"tail": "decision-making",
"tail_span": [
531,
546
]
},
{
"head": "connectionist component",
"head_span": [
556,
579
],
"relation": "PART-OF",
"... | [
[
"deterministic parser",
"it",
"parser"
],
[
"symbolic and connectionist components",
"hybrid architecture"
],
[
"training techniques",
"approach"
],
[
"deterministic parser",
"deterministic parsers"
]
] |
C90-1013 | [
[
"This",
"article",
"introduces",
"a",
"bidirectional",
"grammar",
"generation",
"system",
"called",
"feature",
"structure-directed",
"generation",
",",
"developed",
"for",
"a",
"dialogue",
"translation",
"system",
".",
"The",
... | [
"This",
"article",
"introduces",
"a",
"bidirectional",
"grammar",
"generation",
"system",
"called",
"feature",
"structure-directed",
"generation",
",",
"developed",
"for",
"a",
"dialogue",
"translation",
"system",
".",
"The",
"system",
"utilizes",
"typed",
"feature",
... |
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 disjunctiv... | [
{
"end": 69,
"id": "T1",
"label": "Method",
"start": 30,
"text": "bidirectional grammar generation system"
},
{
"end": 116,
"id": "T2",
"label": "Method",
"start": 79,
"text": "feature structure-directed generation"
},
{
"end": 164,
"id": "T3",
"label": "T... | [
{
"head": "feature structure-directed generation",
"head_span": [
79,
116
],
"relation": "USED-FOR",
"tail": "dialogue translation system",
"tail_span": [
137,
164
]
},
{
"head": "typed feature structures",
"head_span": [
189,
213
],
... | [
[
"generator",
"feature structure-directed generation",
"system",
"generation system"
]
] |
C90-2032 | [
[
"This",
"paper",
"proposes",
"document",
"oriented",
"preference",
"sets(DoPS)",
"for",
"the",
"disambiguation",
"of",
"the",
"dependency",
"structure",
"of",
"sentences",
".",
"The",
"DoPS",
"system",
"extracts",
"preference"... | [
"This",
"paper",
"proposes",
"document",
"oriented",
"preference",
"sets(DoPS)",
"for",
"the",
"disambiguation",
"of",
"the",
"dependency",
"structure",
"of",
"sentences",
".",
"The",
"DoPS",
"system",
"extracts",
"preference",
"knowledge",
"from",
"a",
"target",
... |
This paper proposes document oriented preference sets(DoPS) 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 k... | [
{
"end": 63,
"id": "T1",
"label": "Method",
"start": 24,
"text": "document oriented preference sets(DoPS)"
},
{
"end": 116,
"id": "T2",
"label": "Task",
"start": 73,
"text": "disambiguation of the dependency structure"
},
{
"end": 151,
"id": "T3",
"label"... | [
{
"head": "dependency structures",
"head_span": [
460,
481
],
"relation": "FEATURE-OF",
"tail": "Japanese patent claim sentences",
"tail_span": [
487,
518
]
},
{
"head": "domain targeted preference knowledge",
"head_span": [
292,
328
],... | [
[
"document oriented preference sets(DoPS)",
"DoPS system"
]
] |
C90-3007 | [
[
"This",
"paper",
"examines",
"the",
"properties",
"of",
"feature-based",
"partial",
"descriptions",
"built",
"on",
"top",
"of",
"Halliday's",
"systemic",
"networks",
".",
"We",
"show",
"that",
"the",
"crucial",
"operation"... | [
"This",
"paper",
"examines",
"the",
"properties",
"of",
"feature-based",
"partial",
"descriptions",
"built",
"on",
"top",
"of",
"Halliday's",
"systemic",
"networks",
".",
"We",
"show",
"that",
"the",
"crucial",
"operation",
"of",
"consistency",
"checking",
"for",
... |
This paper examines the properties of feature-based partial descriptions built on top of Halliday's systemic networks . We show that the crucial operation of consistency checking for such descriptions is NP-complete, and therefore probably intractable, but proceed to develop algorithms which can sometimes allev... | [
{
"end": 74,
"id": "T1",
"label": "OtherScientificTerm",
"start": 40,
"text": "feature-based partial descriptions"
},
{
"end": 121,
"id": "T2",
"label": "Method",
"start": 93,
"text": "Halliday's systemic networks"
},
{
"end": 183,
"id": "T3",
"label": "Me... | [
{
"head": "consistency checking",
"head_span": [
163,
183
],
"relation": "USED-FOR",
"tail": "descriptions",
"tail_span": [
194,
206
]
},
{
"head": "Halliday's systemic networks",
"head_span": [
93,
121
],
"relation": "USED-FOR",
... | [
[
"feature-based partial descriptions",
"descriptions"
]
] |
C90-3014 | [
[
"This",
"paper",
"describes",
"the",
"framework",
"of",
"a",
"Korean",
"phonological",
"knowledge",
"base",
"system",
"using",
"the",
"unification-based",
"grammar",
"formalism",
":",
"Korean",
"Phonology",
"Structure",
"Gramm... | [
"This",
"paper",
"describes",
"the",
"framework",
"of",
"a",
"Korean",
"phonological",
"knowledge",
"base",
"system",
"using",
"the",
"unification-based",
"grammar",
"formalism",
":",
"Korean",
"Phonology",
"Structure",
"Grammar",
"(KPSG)",
".",
"The",
"approach",
... |
This paper describes the framework of a Korean phonological knowledge base system using the unification-based grammar formalism : Korean Phonology Structure Grammar (KPSG) . The approach of KPSG provides an explicit development model for constructing a computational phonological system : speech recognitio... | [
{
"end": 85,
"id": "T1",
"label": "Task",
"start": 44,
"text": "Korean phonological knowledge base system"
},
{
"end": 133,
"id": "T2",
"label": "Method",
"start": 98,
"text": "unification-based grammar formalism"
},
{
"end": 179,
"id": "T3",
"label": "Met... | [
{
"head": "unification-based grammar formalism",
"head_span": [
98,
133
],
"relation": "USED-FOR",
"tail": "Korean phonological knowledge base system",
"tail_span": [
44,
85
]
},
{
"head": "KPSG",
"head_span": [
200,
204
],
"relatio... | [
[
"Korean Phonology Structure Grammar (KPSG)",
"KPSG"
],
[
"approach",
"approach"
],
[
"those",
"approaches"
],
[
"phonological system",
"speech recognition and synthesis system"
]
] |
C90-3045 | [
[
"The",
"unique",
"properties",
"of",
"tree-adjoining",
"grammars",
"(TAG)",
"present",
"a",
"challenge",
"for",
"the",
"application",
"of",
"TAGs",
"beyond",
"the",
"limited",
"confines",
"of",
"syntax",
",",
"for",
"i... | [
"The",
"unique",
"properties",
"of",
"tree-adjoining",
"grammars",
"(TAG)",
"present",
"a",
"challenge",
"for",
"the",
"application",
"of",
"TAGs",
"beyond",
"the",
"limited",
"confines",
"of",
"syntax",
",",
"for",
"instance,",
"to",
"the",
"task",
"of",
"sem... |
The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax , for instance, to the task of semantic interpretation or automatic translation of natural language . We present a variant of TAGs , called synchronous TAGs , whi... | [
{
"end": 58,
"id": "T1",
"label": "Method",
"start": 29,
"text": "tree-adjoining grammars (TAG)"
},
{
"end": 108,
"id": "T2",
"label": "Method",
"start": 104,
"text": "TAGs"
},
{
"end": 148,
"id": "T3",
"label": "OtherScientificTerm",
"start": 142,
... | [
{
"head": "logical form language",
"head_span": [
503,
524
],
"relation": "USED-FOR",
"tail": "semantics",
"tail_span": [
474,
483
]
},
{
"head": "TAGs",
"head_span": [
620,
624
],
"relation": "USED-FOR",
"tail": "syntax proper"... | [
[
"tree-adjoining grammars (TAG)",
"TAGs",
"TAGs",
"TAGs"
],
[
"synchronous TAGs",
"variant of TAGs",
"synchronous TAGs"
]
] |
C90-3046 | [
[
"This",
"paper",
"proposes",
"that",
"sentence",
"analysis",
"should",
"be",
"treated",
"as",
"defeasible",
"reasoning",
",",
"and",
"presents",
"such",
"a",
"treatment",
"for",
"Japanese",
"sentence",
"analyses",
"using",... | [
"This",
"paper",
"proposes",
"that",
"sentence",
"analysis",
"should",
"be",
"treated",
"as",
"defeasible",
"reasoning",
",",
"and",
"presents",
"such",
"a",
"treatment",
"for",
"Japanese",
"sentence",
"analyses",
"using",
"an",
"argumentation",
"system",
"by",
... |
This paper proposes that sentence analysis should be treated as defeasible reasoning , and presents such a treatment for Japanese sentence analyses using an argumentation system by Konolige, which is a formalization of defeasible reasoning , that includes arguments and defeat rules that capture defe... | [
{
"end": 46,
"id": "T1",
"label": "Task",
"start": 29,
"text": "sentence analysis"
},
{
"end": 90,
"id": "T2",
"label": "Method",
"start": 70,
"text": "defeasible reasoning"
},
{
"end": 123,
"id": "T3",
"label": "Generic",
"start": 114,
"text": "tr... | [
{
"head": "argumentation system",
"head_span": [
167,
187
],
"relation": "USED-FOR",
"tail": "Japanese sentence analyses",
"tail_span": [
129,
155
]
},
{
"head": "defeasibility",
"head_span": [
316,
329
],
"relation": "FEATURE-OF",
... | [
[
"defeasible reasoning",
"treatment",
"defeasible reasoning"
]
] |
C90-3063 | [
[
"Manual",
"acquisition",
"of",
"semantic",
"constraints",
"in",
"broad",
"domains",
"is",
"very",
"expensive.",
"This",
"paper",
"presents",
"an",
"automatic",
"scheme",
"for",
"collecting",
"statistics",
"on",
"cooccurrence",... | [
"Manual",
"acquisition",
"of",
"semantic",
"constraints",
"in",
"broad",
"domains",
"is",
"very",
"expensive.",
"This",
"paper",
"presents",
"an",
"automatic",
"scheme",
"for",
"collecting",
"statistics",
"on",
"cooccurrence",
"patterns",
"in",
"a",
"large",
"corp... |
Manual acquisition of semantic constraints in broad domains is very expensive. This paper presents an automatic scheme for collecting statistics on cooccurrence patterns in a large corpus . To a large extent, these statistics reflect semantic constraints and thus are used to disambiguate anaphora references ... | [
{
"end": 46,
"id": "T1",
"label": "Task",
"start": 2,
"text": "Manual acquisition of semantic constraints"
},
{
"end": 175,
"id": "T2",
"label": "OtherScientificTerm",
"start": 154,
"text": "cooccurrence patterns"
},
{
"end": 263,
"id": "T3",
"label": "O... | [
{
"head": "semantic constraints",
"head_span": [
243,
263
],
"relation": "USED-FOR",
"tail": "anaphora references",
"tail_span": [
300,
319
]
},
{
"head": "cooccurrence statistics",
"head_span": [
644,
667
],
"relation": "USED-FOR",... | [] |
C90-3072 | [
[
"Spelling-checkers",
"have",
"become",
"an",
"integral",
"part",
"of",
"most",
"text",
"processing",
"software",
".",
"From",
"different",
"reasons",
"among",
"which",
"the",
"speed",
"of",
"processing",
"prevails",
"they"... | [
"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",
"dict... |
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 , ... | [
{
"end": 21,
"id": "T1",
"label": "Task",
"start": 4,
"text": "Spelling-checkers"
},
{
"end": 85,
"id": "T2",
"label": "Task",
"start": 61,
"text": "text processing software"
},
{
"end": 161,
"id": "T3",
"label": "Generic",
"start": 157,
"text": "t... | [
{
"head": "Spelling-checkers",
"head_span": [
4,
21
],
"relation": "PART-OF",
"tail": "text processing software",
"tail_span": [
61,
85
]
},
{
"head": "English",
"head_span": [
680,
687
],
"relation": "USED-FOR",
"tail": "spelli... | [
[
"Spelling-checkers",
"spelling-checkers",
"they"
],
[
"dictionaries of word forms",
"approach"
],
[
"languages",
"highly inflective languages"
],
[
"method",
"program"
]
] |
C92-1052 | [
[
"In",
"this",
"paper",
"discourse",
"segments",
"are",
"defined",
"and",
"a",
"method",
"for",
"discourse",
"segmentation",
"primarily",
"based",
"on",
"abduction",
"of",
"temporal",
"relations",
"between",
"segments",
"is... | [
"In",
"this",
"paper",
"discourse",
"segments",
"are",
"defined",
"and",
"a",
"method",
"for",
"discourse",
"segmentation",
"primarily",
"based",
"on",
"abduction",
"of",
"temporal",
"relations",
"between",
"segments",
"is",
"proposed.",
"This",
"method",
"is",
... |
In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed. This method is precise and computationally feasible and is supported by previous work in the area of temporal anaphora resolution . | [
{
"end": 36,
"id": "T1",
"label": "OtherScientificTerm",
"start": 18,
"text": "discourse segments"
},
{
"end": 62,
"id": "T2",
"label": "Generic",
"start": 56,
"text": "method"
},
{
"end": 90,
"id": "T3",
"label": "Task",
"start": 68,
"text": "disc... | [
{
"head": "method",
"head_span": [
56,
62
],
"relation": "USED-FOR",
"tail": "discourse segmentation",
"tail_span": [
68,
90
]
},
{
"head": "temporal anaphora resolution",
"head_span": [
283,
311
],
"relation": "USED-FOR",
"tail... | [
[
"method",
"method"
]
] |
C92-1055 | [
[
"In",
"this",
"paper,",
"a",
"discrimination",
"and",
"robustness",
"oriented",
"adaptive",
"learning",
"procedure",
"is",
"proposed",
"to",
"deal",
"with",
"the",
"task",
"of",
"syntactic",
"ambiguity",
"resolution",
".",... | [
"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",
... |
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 , whic... | [
{
"end": 87,
"id": "T1",
"label": "Method",
"start": 60,
"text": "adaptive learning procedure"
},
{
"end": 157,
"id": "T2",
"label": "Task",
"start": 127,
"text": "syntactic ambiguity resolution"
},
{
"end": 212,
"id": "T3",
"label": "OtherScientificTerm",... | [
{
"head": "adaptive learning procedure",
"head_span": [
60,
87
],
"relation": "USED-FOR",
"tail": "syntactic ambiguity resolution",
"tail_span": [
127,
157
]
},
{
"head": "maximum likelihood method",
"head_span": [
380,
405
],
"rela... | [
[
"adaptive learning procedure",
"algorithm",
"approach",
"method"
],
[
"syntactic disambiguation",
"syntactic ambiguity resolution"
]
] |
C92-2068 | [
[
"Graph",
"unification",
"remains",
"the",
"most",
"expensive",
"part",
"of",
"unification-based",
"grammar",
"parsing",
".",
"We",
"focus",
"on",
"one",
"speed-up",
"element",
"in",
"the",
"design",
"of",
"unification",
... | [
"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",
"cop... |
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 avo... | [
{
"end": 21,
"id": "T1",
"label": "Task",
"start": 4,
"text": "Graph unification"
},
{
"end": 92,
"id": "T2",
"label": "Task",
"start": 59,
"text": "unification-based grammar parsing"
},
{
"end": 128,
"id": "T3",
"label": "Method",
"start": 112,
"t... | [
{
"head": "Graph unification",
"head_span": [
4,
21
],
"relation": "PART-OF",
"tail": "unification-based grammar parsing",
"tail_span": [
59,
92
]
},
{
"head": "over copying",
"head_span": [
565,
577
],
"relation": "CONJUNCTION",
... | [
[
"scheme",
"method"
]
] |
C92-2115 | [
[
"The",
"transfer",
"phase",
"in",
"machine",
"translation",
"(MT)",
"systems",
"has",
"been",
"considered",
"to",
"be",
"more",
"complicated",
"than",
"analysis",
"and",
"generation",
",",
"since",
"it",
"is",
"inheren... | [
"The",
"transfer",
"phase",
"in",
"machine",
"translation",
"(MT)",
"systems",
"has",
"been",
"considered",
"to",
"be",
"more",
"complicated",
"than",
"analysis",
"and",
"generation",
",",
"since",
"it",
"is",
"inherently",
"a",
"conglomeration",
"of",
"individu... |
The transfer phase in machine translation (MT) systems has been considered to be more complicated than analysis and generation , since it is inherently a conglomeration of individual lexical rules . Currently some attempts are being made to use case-based reasoning in machine translation , that is, to ... | [
{
"end": 22,
"id": "T1",
"label": "Task",
"start": 8,
"text": "transfer phase"
},
{
"end": 60,
"id": "T2",
"label": "Task",
"start": 28,
"text": "machine translation (MT) systems"
},
{
"end": 119,
"id": "T3",
"label": "Task",
"start": 111,
"text": ... | [
{
"head": "transfer phase",
"head_span": [
8,
22
],
"relation": "COMPARE",
"tail": "analysis",
"tail_span": [
111,
119
]
},
{
"head": "case-based reasoning",
"head_span": [
259,
279
],
"relation": "USED-FOR",
"tail": "machine tr... | [
[
"machine translation (MT) systems",
"machine translation",
"MT"
],
[
"transfer phase",
"it"
]
] |
C92-3165 | [
[
"This",
"paper",
"introduces",
"a",
"robust",
"interactive",
"method",
"for",
"speech",
"understanding",
".",
"The",
"generalized",
"LR",
"parsing",
"is",
"enhanced",
"in",
"this",
"approach.",
"Parsing",
"proceeds",
"from... | [
"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",
... |
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 ... | [
{
"end": 53,
"id": "T1",
"label": "Generic",
"start": 27,
"text": "robust interactive method"
},
{
"end": 78,
"id": "T2",
"label": "Task",
"start": 58,
"text": "speech understanding"
},
{
"end": 109,
"id": "T3",
"label": "Method",
"start": 87,
"te... | [
{
"head": "non-terminal symbol",
"head_span": [
293,
312
],
"relation": "USED-FOR",
"tail": "parser",
"tail_span": [
250,
256
]
},
{
"head": "robust interactive method",
"head_span": [
27,
53
],
"relation": "USED-FOR",
"tail": ... | [
[
"robust interactive method",
"approach",
"approach",
"method"
],
[
"Parsing",
"parser"
]
] |
C92-4199 | [
[
"Word",
"Identification",
"has",
"been",
"an",
"important",
"and",
"active",
"issue",
"in",
"Chinese",
"Natural",
"Language",
"Processing",
".",
"In",
"this",
"paper,",
"a",
"new",
"mechanism,",
"based",
"on",
"the",
... | [
"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",
... |
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-... | [
{
"end": 23,
"id": "T1",
"label": "Task",
"start": 4,
"text": "Word Identification"
},
{
"end": 103,
"id": "T2",
"label": "Task",
"start": 68,
"text": "Chinese Natural Language Processing"
},
{
"end": 137,
"id": "T3",
"label": "Generic",
"start": 128,
... | [
{
"head": "Word Identification",
"head_span": [
4,
23
],
"relation": "HYPONYM-OF",
"tail": "Chinese Natural Language Processing",
"tail_span": [
68,
103
]
},
{
"head": "mechanism",
"head_span": [
128,
137
],
"relation": "USED-FOR",
... | [
[
"mechanism",
"mechanism"
],
[
"NTHU's statistic-based system",
"system"
]
] |
C92-4207 | [
[
"This",
"paper",
"describes",
"the",
"understanding",
"process",
"of",
"the",
"spatial",
"descriptions",
"in",
"Japanese",
".",
"In",
"order",
"to",
"understand",
"the",
"described",
"world",
",",
"the",
"authors",
"tr... | [
"This",
"paper",
"describes",
"the",
"understanding",
"process",
"of",
"the",
"spatial",
"descriptions",
"in",
"Japanese",
".",
"In",
"order",
"to",
"understand",
"the",
"described",
"world",
",",
"the",
"authors",
"try",
"to",
"reconstruct",
"the",
"geometric",... |
This paper describes the understanding process of the spatial descriptions in Japanese . In order to understand the described world , the authors try to reconstruct the geometric model of the global scene from the scenic descriptions drawing a space. It is done by an experimental computer program SPRINT , ... | [
{
"end": 78,
"id": "T1",
"label": "OtherScientificTerm",
"start": 58,
"text": "spatial descriptions"
},
{
"end": 92,
"id": "T2",
"label": "Material",
"start": 84,
"text": "Japanese"
},
{
"end": 193,
"id": "T3",
"label": "Method",
"start": 178,
"tex... | [
{
"head": "Japanese",
"head_span": [
84,
92
],
"relation": "FEATURE-OF",
"tail": "spatial descriptions",
"tail_span": [
58,
78
]
},
{
"head": "spatial attributes of the entities",
"head_span": [
570,
606
],
"relation": "USED-FOR",... | [
[
"model",
"model"
]
] |
C94-1088 | [
[
"This",
"paper",
"describes",
"a",
"characters-based",
"Chinese",
"collocation",
"system",
"and",
"discusses",
"the",
"advantages",
"of",
"it",
"over",
"a",
"traditional",
"word-based",
"system",
".",
"Since",
"wordbreaks",
... | [
"This",
"paper",
"describes",
"a",
"characters-based",
"Chinese",
"collocation",
"system",
"and",
"discusses",
"the",
"advantages",
"of",
"it",
"over",
"a",
"traditional",
"word-based",
"system",
".",
"Since",
"wordbreaks",
"are",
"not",
"conventionally",
"marked",
... |
This paper describes a characters-based Chinese collocation system and discusses the advantages of it over a traditional word-based system . Since wordbreaks are not conventionally marked in Chinese text corpora , a character-based collocation system has the dual advantages of avoiding pre-processing distorti... | [
{
"end": 68,
"id": "T1",
"label": "Method",
"start": 25,
"text": "characters-based Chinese collocation system"
},
{
"end": 104,
"id": "T2",
"label": "Generic",
"start": 102,
"text": "it"
},
{
"end": 142,
"id": "T3",
"label": "Method",
"start": 125,
... | [
{
"head": "it",
"head_span": [
102,
104
],
"relation": "COMPARE",
"tail": "word-based system",
"tail_span": [
125,
142
]
},
{
"head": "avoiding pre-processing distortion",
"head_span": [
287,
322
],
"relation": "FEATURE-OF",
"t... | [
[
"characters-based Chinese collocation system",
"it",
"character-based collocation system"
]
] |
C94-1091 | [
[
"This",
"paper",
"presents",
"an",
"algorithm",
"for",
"selecting",
"an",
"appropriate",
"classifier",
"word",
"for",
"a",
"noun",
".",
"In",
"Thai",
"language",
",",
"it",
"frequently",
"happens",
"that",
"there",
... | [
"This",
"paper",
"presents",
"an",
"algorithm",
"for",
"selecting",
"an",
"appropriate",
"classifier",
"word",
"for",
"a",
"noun",
".",
"In",
"Thai",
"language",
",",
"it",
"frequently",
"happens",
"that",
"there",
"is",
"fluctuation",
"in",
"the",
"choice",
... |
This paper presents an algorithm for selecting an appropriate classifier word for a noun . In Thai language , it frequently happens that there is fluctuation in the choice of classifier for a given concrete noun , both from the point of view of the whole speech community and individual speakers . Basically, ... | [
{
"end": 112,
"id": "T1",
"label": "Material",
"start": 99,
"text": "Thai language"
},
{
"end": 191,
"id": "T2",
"label": "Method",
"start": 181,
"text": "classifier"
},
{
"end": 368,
"id": "T3",
"label": "Task",
"start": 348,
"text": "classifier s... | [
{
"head": "corpus-based method",
"head_span": [
674,
693
],
"relation": "USED-FOR",
"tail": "classifier assignment",
"tail_span": [
815,
836
]
},
{
"head": "corpus-based method",
"head_span": [
674,
693
],
"relation": "USED-FOR",
... | [
[
"NCA",
"Noun Classifier Associations (NCA)"
]
] |
C96-1055 | [
[
"This",
"paper",
"addresses",
"the",
"issue",
"of",
"word-sense",
"ambiguity",
"in",
"extraction",
"from",
"machine-readable",
"resources",
"for",
"the",
"construction",
"of",
"large-scale",
"knowledge",
"sources",
".",
"We",
... | [
"This",
"paper",
"addresses",
"the",
"issue",
"of",
"word-sense",
"ambiguity",
"in",
"extraction",
"from",
"machine-readable",
"resources",
"for",
"the",
"construction",
"of",
"large-scale",
"knowledge",
"sources",
".",
"We",
"describe",
"two",
"experiments:",
"one"... |
This paper addresses the issue of word-sense ambiguity in extraction from machine-readable resources for the construction of large-scale knowledge sources . We describe two experiments: one which ignored word-sense distinctions , resulting in 6.3% accuracy for semantic classification of verbs based on (Levin... | [
{
"end": 56,
"id": "T1",
"label": "Task",
"start": 36,
"text": "word-sense ambiguity"
},
{
"end": 104,
"id": "T2",
"label": "Material",
"start": 78,
"text": "machine-readable resources"
},
{
"end": 160,
"id": "T3",
"label": "Task",
"start": 114,
"t... | [
{
"head": "verb semantics",
"head_span": [
523,
537
],
"relation": "CONJUNCTION",
"tail": "syntactic behavior",
"tail_span": [
544,
562
]
},
{
"head": "machine-readable resources",
"head_span": [
78,
104
],
"relation": "USED-FOR",
... | [
[
"word-sense ambiguity",
"word-sense distinctions",
"word-sense distinctions"
]
] |
C96-1062 | [
[
"A",
"domain",
"independent",
"model",
"is",
"proposed",
"for",
"the",
"automated",
"interpretation",
"of",
"nominal",
"compounds",
"in",
"English",
".",
"This",
"model",
"is",
"meant",
"to",
"account",
"for",
"product... | [
"A",
"domain",
"independent",
"model",
"is",
"proposed",
"for",
"the",
"automated",
"interpretation",
"of",
"nominal",
"compounds",
"in",
"English",
".",
"This",
"model",
"is",
"meant",
"to",
"account",
"for",
"productive",
"rules",
"of",
"interpretation",
"whic... |
A domain independent model is proposed for the automated interpretation of nominal compounds in English . This model is meant to account for productive rules of interpretation which are inferred from the morpho-syntactic and semantic characteristics of the nominal constituents . In particular, we make ex... | [
{
"end": 28,
"id": "T1",
"label": "Method",
"start": 4,
"text": "domain independent model"
},
{
"end": 98,
"id": "T2",
"label": "Task",
"start": 51,
"text": "automated interpretation of nominal compounds"
},
{
"end": 98,
"id": "T3",
"label": "OtherScient... | [
{
"head": "morpho-syntactic and semantic characteristics",
"head_span": [
217,
262
],
"relation": "FEATURE-OF",
"tail": "nominal constituents",
"tail_span": [
272,
292
]
},
{
"head": "nominals",
"head_span": [
418,
426
],
"relation"... | [
[
"domain independent model",
"model",
"model"
],
[
"nominal compounds",
"nominal constituents"
]
] |
C96-2213 | [
[
"Porting",
"a",
"Natural",
"Language",
"Processing",
"(NLP)",
"system",
"to",
"a",
"new",
"domain",
"remains",
"one",
"of",
"the",
"bottlenecks",
"in",
"syntactic",
"parsing",
",",
"because",
"of",
"the",
"amount",
... | [
"Porting",
"a",
"Natural",
"Language",
"Processing",
"(NLP)",
"system",
"to",
"a",
"new",
"domain",
"remains",
"one",
"of",
"the",
"bottlenecks",
"in",
"syntactic",
"parsing",
",",
"because",
"of",
"the",
"amount",
"of",
"effort",
"required",
"to",
"fix",
"g... |
Porting a Natural Language Processing (NLP) 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 f... | [
{
"end": 52,
"id": "T1",
"label": "Task",
"start": 12,
"text": "Natural Language Processing (NLP) system"
},
{
"end": 70,
"id": "T2",
"label": "Material",
"start": 60,
"text": "new domain"
},
{
"end": 124,
"id": "T3",
"label": "Task",
"start": 107,
... | [
{
"head": "knowledge-based techniques",
"head_span": [
454,
480
],
"relation": "CONJUNCTION",
"tail": "corpus-based approach",
"tail_span": [
490,
511
]
},
{
"head": "knowledge-based techniques",
"head_span": [
454,
480
],
"relation... | [] |
CVPR_1992_10_abs | [
[
"This",
"paper",
"presents",
"an",
"algorithm",
"for",
"labeling",
"curvilinear",
"structure",
"at",
"multiple",
"scales",
"in",
"line",
"drawings",
"and",
"edge",
"images",
"Symbolic",
"CURVE-ELEMENT",
"tokens",
"residing",
... | [
"This",
"paper",
"presents",
"an",
"algorithm",
"for",
"labeling",
"curvilinear",
"structure",
"at",
"multiple",
"scales",
"in",
"line",
"drawings",
"and",
"edge",
"images",
"Symbolic",
"CURVE-ELEMENT",
"tokens",
"residing",
"in",
"a",
"spatially-indexed",
"and",
... | This paper presents an algorithm for labeling curvilinear structure at multiple scales in line drawings and edge images Symbolic CURVE-ELEMENT tokens residing in a spatially-indexed and scale-indexed data structure denote circular arcs fit to image data. Tokens are computed via a small-to-large scale grouping procedure... | [
{
"end": 32,
"id": "T1",
"label": "Generic",
"start": 23,
"text": "algorithm"
},
{
"end": 67,
"id": "T2",
"label": "Task",
"start": 37,
"text": "labeling curvilinear structure"
},
{
"end": 103,
"id": "T3",
"label": "Material",
"start": 90,
"text": ... | [
{
"head": "algorithm",
"head_span": [
23,
32
],
"relation": "USED-FOR",
"tail": "labeling curvilinear structure",
"tail_span": [
37,
67
]
},
{
"head": "line drawings",
"head_span": [
90,
103
],
"relation": "FEATURE-OF",
"tail": ... | [] |
CVPR_1993_10_abs | [
[
"A",
"model-based",
"approach",
"to",
"on-line",
"cursive",
"handwriting",
"analysis",
"and",
"recognition",
"is",
"presented",
"and",
"evaluated.",
"In",
"this",
"model,",
"on-line",
"handwriting",
"is",
"considered",
"as",
... | [
"A",
"model-based",
"approach",
"to",
"on-line",
"cursive",
"handwriting",
"analysis",
"and",
"recognition",
"is",
"presented",
"and",
"evaluated.",
"In",
"this",
"model,",
"on-line",
"handwriting",
"is",
"considered",
"as",
"a",
"modulation",
"of",
"a",
"simple",... | A model-based approach to on-line cursive handwriting analysis and recognition is presented and evaluated. In this model, on-line handwriting is considered as a modulation of a simple cycloidal pen motion, described by two coupled oscillations with a constant linear drift along the line of the writing. By slow modulati... | [
{
"end": 22,
"id": "T1",
"label": "Method",
"start": 2,
"text": "model-based approach"
},
{
"end": 78,
"id": "T2",
"label": "Task",
"start": 26,
"text": "on-line cursive handwriting analysis and recognition"
},
{
"end": 120,
"id": "T3",
"label": "Generic",... | [
{
"head": "model-based approach",
"head_span": [
2,
22
],
"relation": "USED-FOR",
"tail": "on-line cursive handwriting analysis and recognition",
"tail_span": [
26,
78
]
},
{
"head": "on-line handwriting",
"head_span": [
122,
141
],
... | [
[
"model-based approach",
"model"
],
[
"discrete motor control representation",
"motor control representation",
"dynamic representation"
]
] |
CVPR_1994_10_abs | [
[
"MINPRAN,",
"a",
"new",
"robust",
"operator,",
"nds",
"good",
"ts",
"in",
"data",
"sets",
"where",
"more",
"than",
"50%",
"of",
"the",
"points",
"are",
"outliers.",
"Unlike",
"other",
"techniques",
"that",
"handle"... | [
"MINPRAN,",
"a",
"new",
"robust",
"operator,",
"nds",
"good",
"ts",
"in",
"data",
"sets",
"where",
"more",
"than",
"50%",
"of",
"the",
"points",
"are",
"outliers.",
"Unlike",
"other",
"techniques",
"that",
"handle",
"large",
"outlier",
"percentages,",
"MINPRAN... | MINPRAN, a new robust operator, nds good ts in data sets where more than 50% of the points are outliers. Unlike other techniques that handle large outlier percentages, MINPRAN does not rely on a known error bound for the good data. Instead it assumes that the bad data are randomly (uniformly) distributed within the dyn... | [
{
"end": 7,
"id": "T1",
"label": "Method",
"start": 0,
"text": "MINPRAN"
},
{
"end": 30,
"id": "T2",
"label": "Method",
"start": 15,
"text": "robust operator"
},
{
"end": 128,
"id": "T3",
"label": "Generic",
"start": 118,
"text": "techniques"
},
... | [
{
"head": "MINPRAN",
"head_span": [
0,
7
],
"relation": "HYPONYM-OF",
"tail": "robust operator",
"tail_span": [
15,
30
]
},
{
"head": "techniques",
"head_span": [
118,
128
],
"relation": "USED-FOR",
"tail": "large outlier percen... | [
[
"MINPRAN",
"It",
"MINPRAN",
"MINPRAN",
"MINPRAN",
"MINPRAN",
"MINPRAN",
"it",
"MINPRAN"
]
] |
CVPR_1996_15_abs | [
[
"We",
"previously",
"presented",
"a",
"framework",
"for",
"segmentation",
"of",
"complex",
"scenes",
"using",
"multiple",
"physical",
"hypotheses",
"for",
"simple",
"image",
"regions.",
"A",
"consequence",
"of",
"that",
"f... | [
"We",
"previously",
"presented",
"a",
"framework",
"for",
"segmentation",
"of",
"complex",
"scenes",
"using",
"multiple",
"physical",
"hypotheses",
"for",
"simple",
"image",
"regions.",
"A",
"consequence",
"of",
"that",
"framework",
"was",
"a",
"proposal",
"for",
... | We previously presented a framework for segmentation of complex scenes using multiple physical hypotheses for simple image regions. A consequence of that framework was a proposal for a new approach to the segmentation of complex scenes into regions corresponding to coherent surfaces rather than merely regions of simila... | [
{
"end": 35,
"id": "T1",
"label": "Generic",
"start": 26,
"text": "framework"
},
{
"end": 70,
"id": "T2",
"label": "Task",
"start": 40,
"text": "segmentation of complex scenes"
},
{
"end": 105,
"id": "T3",
"label": "OtherScientificTerm",
"start": 86,
... | [
{
"head": "physical hypotheses",
"head_span": [
86,
105
],
"relation": "USED-FOR",
"tail": "simple image regions",
"tail_span": [
110,
130
]
},
{
"head": "framework",
"head_span": [
26,
35
],
"relation": "USED-FOR",
"tail": "seg... | [
[
"framework",
"framework"
],
[
"segmentation of complex scenes",
"segmentation of complex scenes"
],
[
"approach",
"approach",
"approach"
]
] |
CVPR_1998_10_abs | [
[
"The",
"compact",
"description",
"of",
"a",
"video",
"sequence",
"through",
"a",
"single",
"image",
"map",
"and",
"a",
"dominant",
"motion",
"has",
"applications",
"in",
"several",
"domains,",
"including",
"video",
"br... | [
"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,",
... | 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... | [
{
"end": 43,
"id": "T1",
"label": "Task",
"start": 4,
"text": "compact description of a video sequence"
},
{
"end": 70,
"id": "T2",
"label": "OtherScientificTerm",
"start": 61,
"text": "image map"
},
{
"end": 92,
"id": "T3",
"label": "OtherScientificTerm",... | [
{
"head": "video browsing and retrieval",
"head_span": [
140,
168
],
"relation": "CONJUNCTION",
"tail": "compression",
"tail_span": [
170,
181
]
},
{
"head": "compression",
"head_span": [
170,
181
],
"relation": "CONJUNCTION",
"... | [
[
"compact description of a video sequence",
"representation"
],
[
"localized motion estimates",
"estimates"
],
[
"oscillation between different scene interpretations and poor registration",
"oscillation"
]
] |
CVPR_1999_15_abs | [
[
"In",
"this",
"paper",
"we",
"specialize",
"the",
"projective",
"unifocal,",
"bifo-cal,",
"and",
"trifocal",
"tensors",
"to",
"the",
"affine",
"case,",
"and",
"show",
"how",
"the",
"tensors",
"obtained",
"relate",
"to"... | [
"In",
"this",
"paper",
"we",
"specialize",
"the",
"projective",
"unifocal,",
"bifo-cal,",
"and",
"trifocal",
"tensors",
"to",
"the",
"affine",
"case,",
"and",
"show",
"how",
"the",
"tensors",
"obtained",
"relate",
"to",
"the",
"registered",
"tensors",
"encounter... | In this paper we specialize the projective unifocal, bifo-cal, and trifocal tensors to the affine case, and show how the tensors obtained relate to the registered tensors encountered in previous work. This enables us to obtain an affine specialization of known projective relations connecting points and lines across two... | [
{
"end": 83,
"id": "T1",
"label": "Method",
"start": 32,
"text": "projective unifocal, bifo-cal, and trifocal tensors"
},
{
"end": 102,
"id": "T2",
"label": "OtherScientificTerm",
"start": 91,
"text": "affine case"
},
{
"end": 128,
"id": "T3",
"label": "Ge... | [
{
"head": "projective unifocal, bifo-cal, and trifocal tensors",
"head_span": [
32,
83
],
"relation": "USED-FOR",
"tail": "affine case",
"tail_span": [
91,
102
]
},
{
"head": "trifocal tensor",
"head_span": [
446,
461
],
"relation":... | [
[
"projective unifocal, bifo-cal, and trifocal tensors",
"tensors"
],
[
"tensors",
"trifocal tensor"
],
[
"estimation",
"estimation of the tensors"
]
] |
CVPR_2001_110_abs | [
[
"Representing",
"images",
"with",
"layers",
"has",
"many",
"important",
"applications",
",",
"such",
"as",
"video",
"compression,",
"motion",
"analysis,",
"and",
"3D",
"scene",
"analysis.",
"This",
"paper",
"presents",
"an... | [
"Representing",
"images",
"with",
"layers",
"has",
"many",
"important",
"applications",
",",
"such",
"as",
"video",
"compression,",
"motion",
"analysis,",
"and",
"3D",
"scene",
"analysis.",
"This",
"paper",
"presents",
"an",
"approach",
"to",
"reliably",
"extracti... | Representing images with layers has many important applications , such as video compression, motion analysis, and 3D scene analysis. This paper presents an approach to reliably extracting layers from images by taking advantages of the fact that homographies induced by planar patches in the scene form a low dimensional ... | [
{
"end": 31,
"id": "T1",
"label": "Method",
"start": 0,
"text": "Representing images with layers"
},
{
"end": 63,
"id": "T2",
"label": "Generic",
"start": 51,
"text": "applications"
},
{
"end": 91,
"id": "T3",
"label": "Task",
"start": 74,
"text": ... | [
{
"head": "layers",
"head_span": [
188,
194
],
"relation": "PART-OF",
"tail": "images",
"tail_span": [
200,
206
]
},
{
"head": "Layers",
"head_span": [
337,
343
],
"relation": "PART-OF",
"tail": "images",
"tail_span": [
... | [] |
CVPR_2001_111_abs | [
[
"In",
"this",
"paper,",
"we",
"propose",
"a",
"novel",
"method,",
"called",
"local",
"non-negative",
"matrix",
"factorization",
"(LNMF),",
"for",
"learning",
"spatially",
"localized,",
"parts-based",
"subspace",
"representation",
... | [
"In",
"this",
"paper,",
"we",
"propose",
"a",
"novel",
"method,",
"called",
"local",
"non-negative",
"matrix",
"factorization",
"(LNMF),",
"for",
"learning",
"spatially",
"localized,",
"parts-based",
"subspace",
"representation",
"of",
"visual",
"patterns.",
"An",
"... | In this paper, we propose a novel method, called local non-negative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual patterns. An objective function is defined to impose lo-calization constraint, in addition to the non-negativity constraint in the standard NMF... | [
{
"end": 40,
"id": "T1",
"label": "Generic",
"start": 34,
"text": "method"
},
{
"end": 95,
"id": "T2",
"label": "Method",
"start": 49,
"text": "local non-negative matrix factorization (LNMF)"
},
{
"end": 185,
"id": "T3",
"label": "Task",
"start": 110,
... | [
{
"head": "method",
"head_span": [
34,
40
],
"relation": "USED-FOR",
"tail": "spatially localized, parts-based subspace representation of visual patterns",
"tail_span": [
110,
185
]
},
{
"head": "LNMF",
"head_span": [
584,
588
],
"r... | [
[
"method",
"LNMF",
"LNMF",
"local non-negative matrix factorization (LNMF)"
]
] |
CVPR_2003_10_abs | [
[
"A",
"\"",
"graphics",
"for",
"vision",
"\"",
"approach",
"is",
"proposed",
"to",
"address",
"the",
"problem",
"of",
"reconstruction",
"from",
"a",
"large",
"and",
"imperfect",
"data",
"set:",
"reconstruction",
"on",
... | [
"A",
"\"",
"graphics",
"for",
"vision",
"\"",
"approach",
"is",
"proposed",
"to",
"address",
"the",
"problem",
"of",
"reconstruction",
"from",
"a",
"large",
"and",
"imperfect",
"data",
"set:",
"reconstruction",
"on",
"demand",
"by",
"tensor",
"voting,",
"or",
... | A " graphics for vision " approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV. ROD-TV simultaneously delivers good efficiency and robust-ness, by adapting to a continuum of primitive connectivity, view dependence, and le... | [
{
"end": 34,
"id": "T1",
"label": "Method",
"start": 2,
"text": "\" graphics for vision \" approach"
},
{
"end": 87,
"id": "T2",
"label": "Task",
"start": 73,
"text": "reconstruction"
},
{
"end": 123,
"id": "T3",
"label": "Material",
"start": 95,
"... | [
{
"head": "tensor voting",
"head_span": [
153,
166
],
"relation": "USED-FOR",
"tail": "reconstruction",
"tail_span": [
125,
139
]
},
{
"head": "ROD-TV",
"head_span": [
171,
177
],
"relation": "USED-FOR",
"tail": "reconstruction"... | [
[
"ROD-TV",
"ROD-TV",
"ROD-TV",
"ROD-TV"
],
[
"\" graphics for vision \" approach",
"approach"
],
[
"reconstruction",
"reconstruction"
],
[
"tensor voting",
"It"
]
] |
CVPR_2003_11_abs | [
[
"The",
"features",
"based",
"on",
"Markov",
"random",
"field",
"(MRF)",
"models",
"are",
"usually",
"sensitive",
"to",
"the",
"rotation",
"of",
"image",
"textures.",
"This",
"paper",
"develops",
"an",
"anisotropic",
"c... | [
"The",
"features",
"based",
"on",
"Markov",
"random",
"field",
"(MRF)",
"models",
"are",
"usually",
"sensitive",
"to",
"the",
"rotation",
"of",
"image",
"textures.",
"This",
"paper",
"develops",
"an",
"anisotropic",
"circular",
"Gaussian",
"MRF",
"(ACGMRF)",
"mo... | The features based on Markov random field (MRF) models are usually sensitive to the rotation of image textures. This paper develops an anisotropic circular Gaussian MRF (ACGMRF) model for modelling rotated image textures and retrieving rotation-invariant texture features. To overcome the singularity problem of the leas... | [
{
"end": 12,
"id": "T1",
"label": "OtherScientificTerm",
"start": 4,
"text": "features"
},
{
"end": 54,
"id": "T2",
"label": "Method",
"start": 22,
"text": "Markov random field (MRF) models"
},
{
"end": 110,
"id": "T3",
"label": "OtherScientificTerm",
... | [
{
"head": "anisotropic circular Gaussian MRF (ACGMRF) model",
"head_span": [
135,
183
],
"relation": "USED-FOR",
"tail": "modelling rotated image textures",
"tail_span": [
188,
220
]
},
{
"head": "anisotropic circular Gaussian MRF (ACGMRF) model",
"hea... | [
[
"ACGMRF model",
"ACGMRF model",
"anisotropic circular Gaussian MRF (ACGMRF) model"
],
[
"parameters of the ACGMRF model",
"parameters of the ACGMRF model"
]
] |
CVPR_2003_18_abs | [
[
"In",
"this",
"paper,",
"a",
"novel",
"method",
"to",
"learn",
"the",
"intrinsic",
"object",
"structure",
"for",
"robust",
"visual",
"tracking",
"is",
"proposed.",
"The",
"basic",
"assumption",
"is",
"that",
"the",
... | [
"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",
"... | 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... | [
{
"end": 29,
"id": "T1",
"label": "Method",
"start": 23,
"text": "method"
},
{
"end": 69,
"id": "T2",
"label": "OtherScientificTerm",
"start": 43,
"text": "intrinsic object structure"
},
{
"end": 96,
"id": "T3",
"label": "Task",
"start": 74,
"text"... | [
{
"head": "intrinsic object structure",
"head_span": [
43,
69
],
"relation": "USED-FOR",
"tail": "robust visual tracking",
"tail_span": [
74,
96
]
},
{
"head": "method",
"head_span": [
23,
29
],
"relation": "USED-FOR",
"tail": "... | [
[
"intrinsic representation",
"intrinsic object structure",
"intrinsic object representation",
"object intrinsic representation"
],
[
"particle-filter style tracker",
"tracker"
],
[
"dynamical model",
"dynamical model"
],
[
"method",
"method"
]
] |
CVPR_2003_21_abs | [
[
"This",
"paper",
"investigates",
"critical",
"configurations",
"for",
"projective",
"reconstruction",
"from",
"multiple",
"images",
"taken",
"by",
"a",
"camera",
"moving",
"in",
"a",
"straight",
"line.",
"Projective",
"reconst... | [
"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",
"determin... | 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... | [
{
"end": 77,
"id": "T1",
"label": "Task",
"start": 52,
"text": "projective reconstruction"
},
{
"end": 98,
"id": "T2",
"label": "Material",
"start": 92,
"text": "images"
},
{
"end": 169,
"id": "T3",
"label": "Task",
"start": 144,
"text": "Projectiv... | [
{
"head": "images",
"head_span": [
92,
98
],
"relation": "USED-FOR",
"tail": "projective reconstruction",
"tail_span": [
52,
77
]
},
{
"head": "3D geometrical configuration",
"head_span": [
203,
231
],
"relation": "FEATURE-OF",
... | [
[
"projective reconstruction",
"Projective reconstruction"
]
] |
CVPR_2003_30_abs | [
[
"This",
"paper",
"presents",
"a",
"novel",
"representation",
"for",
"three-dimensional",
"objects",
"in",
"terms",
"of",
"affine-invariant",
"image",
"patches",
"and",
"their",
"spatial",
"relationships.",
"Multi-view",
"constrain... | [
"This",
"paper",
"presents",
"a",
"novel",
"representation",
"for",
"three-dimensional",
"objects",
"in",
"terms",
"of",
"affine-invariant",
"image",
"patches",
"and",
"their",
"spatial",
"relationships.",
"Multi-view",
"constraints",
"associated",
"with",
"groups",
"... | This paper presents a novel representation for three-dimensional objects in terms of affine-invariant image patches and their spatial relationships. Multi-view constraints associated with groups of patches are combined with a normalized representation of their appearance to guide matching and reconstruction, allowing t... | [
{
"end": 42,
"id": "T1",
"label": "Generic",
"start": 28,
"text": "representation"
},
{
"end": 72,
"id": "T2",
"label": "OtherScientificTerm",
"start": 47,
"text": "three-dimensional objects"
},
{
"end": 115,
"id": "T3",
"label": "OtherScientificTerm",
... | [
{
"head": "matching",
"head_span": [
281,
289
],
"relation": "CONJUNCTION",
"tail": "reconstruction",
"tail_span": [
294,
308
]
},
{
"head": "normalized representation",
"head_span": [
226,
251
],
"relation": "USED-FOR",
"tail":... | [
[
"representation",
"approach"
]
] |
CVPR_2004_10_abs | [
[
"Image",
"composition",
"(or",
"mosaicing)",
"has",
"attracted",
"a",
"growing",
"attention",
"in",
"recent",
"years",
"as",
"one",
"of",
"the",
"main",
"elements",
"in",
"video",
"analysis",
"and",
"representation.",
... | [
"Image",
"composition",
"(or",
"mosaicing)",
"has",
"attracted",
"a",
"growing",
"attention",
"in",
"recent",
"years",
"as",
"one",
"of",
"the",
"main",
"elements",
"in",
"video",
"analysis",
"and",
"representation.",
"In",
"this",
"paper",
"we",
"deal",
"with... | Image composition (or mosaicing) has attracted a growing attention in recent years as one of the main elements in video analysis and representation. In this paper we deal with the problem of global alignment and super-resolution. We also propose to evaluate the quality of the resulting mosaic by measuring the amount of... | [
{
"end": 32,
"id": "T1",
"label": "Task",
"start": 0,
"text": "Image composition (or mosaicing)"
},
{
"end": 147,
"id": "T2",
"label": "Task",
"start": 114,
"text": "video analysis and representation"
},
{
"end": 207,
"id": "T3",
"label": "Task",
"star... | [
{
"head": "global alignment",
"head_span": [
191,
207
],
"relation": "CONJUNCTION",
"tail": "super-resolution",
"tail_span": [
212,
228
]
},
{
"head": "amount of blurring",
"head_span": [
311,
329
],
"relation": "EVALUATE-FOR",
... | [
[
"approach",
"graph-based technique"
]
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.