Sculpt-AI/GIMBench-sci-erc · Datasets at Hugging Face

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 ] } ]	[]

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 ] } ]

[]