id
stringlengths
8
8
title
stringlengths
18
138
abstract
stringlengths
177
1.96k
entities
list
relation
list
P97-1072
Towards resolution of bridging descriptions
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles from the Penn Treebank Corpus and our experiments with WordNet to identify relations between bridging descriptions and their antecedents.
[ { "id": "P97-1072.1", "char_start": 65, "char_end": 105 }, { "id": "P97-1072.2", "char_start": 152, "char_end": 180 }, { "id": "P97-1072.3", "char_start": 190, "char_end": 210 }, { "id": "P97-1072.4", "char_start": 236, "char_end": 243 }, { "id": "...
[ { "label": 4, "arg1": "P97-1072.2", "arg2": "P97-1072.3", "reverse": false } ]
P99-1058
A semantically-derived subset of English for hardware verification
To verify hardware designs by model checking, circuit specifications are commonly expressed in the temporal logic CTL. Automatic conversion of English to CTL requires the definition of an appropriately restricted subset of English. We show how the limited semantic expressibility of CTL can be exploited to derive a hie...
[ { "id": "P99-1058.1", "char_start": 11, "char_end": 27 }, { "id": "P99-1058.2", "char_start": 31, "char_end": 45 }, { "id": "P99-1058.3", "char_start": 47, "char_end": 69 }, { "id": "P99-1058.4", "char_start": 100, "char_end": 118 }, { "id": "P99-1...
[ { "label": 1, "arg1": "P99-1058.1", "arg2": "P99-1058.2", "reverse": true }, { "label": 3, "arg1": "P99-1058.3", "arg2": "P99-1058.4", "reverse": true }, { "label": 4, "arg1": "P99-1058.6", "arg2": "P99-1058.7", "reverse": false }, { "label": 3, "a...
P05-1039
What To Do When Lexicalization Fails: Parsing German With Suffix Analysis And Smoothing
In this paper, we present an unlexicalized parser for German which employs smoothing and suffix analysis to achieve a labelled bracket F-score of 76.2, higher than previously reported results on the NEGRA corpus. In addition to the high accuracy of the model, the use of smoothing in an unlexicalized parser allows us t...
[ { "id": "P05-1039.1", "char_start": 30, "char_end": 50 }, { "id": "P05-1039.2", "char_start": 55, "char_end": 61 }, { "id": "P05-1039.3", "char_start": 76, "char_end": 85 }, { "id": "P05-1039.4", "char_start": 90, "char_end": 105 }, { "id": "P05-10...
[ { "label": 1, "arg1": "P05-1039.1", "arg2": "P05-1039.2", "reverse": false }, { "label": 2, "arg1": "P05-1039.4", "arg2": "P05-1039.5", "reverse": false }, { "label": 1, "arg1": "P05-1039.8", "arg2": "P05-1039.9", "reverse": false } ]
P05-1058
Alignment Model Adaptation For Domain-Specific Word Alignment
This paper proposes an alignment adaptation approach to improve domain-specific (in-domain) word alignment. The basic idea of alignment adaptation is to use out-of-domain corpus to improve in-domain word alignment results. In this paper, we first train two statistical word alignment models with the large-scale out-of-...
[ { "id": "P05-1058.1", "char_start": 24, "char_end": 53 }, { "id": "P05-1058.2", "char_start": 65, "char_end": 107 }, { "id": "P05-1058.3", "char_start": 127, "char_end": 147 }, { "id": "P05-1058.4", "char_start": 158, "char_end": 178 }, { "id": "P0...
[ { "label": 1, "arg1": "P05-1058.1", "arg2": "P05-1058.2", "reverse": false }, { "label": 1, "arg1": "P05-1058.4", "arg2": "P05-1058.5", "reverse": false }, { "label": 6, "arg1": "P05-1058.7", "arg2": "P05-1058.8", "reverse": false }, { "label": 2, ...
P05-3001
An Information-State Approach To Collaborative Reference
We describe a dialogue system that works with its interlocutor to identify objects. Our contributions include a concise, modular architecture with reversible processes of understanding and generation, an information-state model of reference, and flexible links between semantics and collaborative problem solving.
[ { "id": "P05-3001.1", "char_start": 15, "char_end": 30 }, { "id": "P05-3001.2", "char_start": 122, "char_end": 142 }, { "id": "P05-3001.3", "char_start": 172, "char_end": 185 }, { "id": "P05-3001.4", "char_start": 190, "char_end": 200 }, { "id": "P...
[ { "label": 4, "arg1": "P05-3001.2", "arg2": "P05-3001.3", "reverse": true } ]
E83-1021
AN APPROACH TO NATURAL LANGUAGE IN THE SI-NETS PARADIGM
This article deals with the interpretation of conceptual operations underlying the communicative use of natural language (NL) within the Structured Inheritance Network (SI-Nets) paradigm. The operations are reduced to functions of a formal language, thus changing the level of abstraction of the operations to be perfor...
[ { "id": "E83-1021.1", "char_start": 29, "char_end": 43 }, { "id": "E83-1021.2", "char_start": 47, "char_end": 68 }, { "id": "E83-1021.3", "char_start": 105, "char_end": 126 }, { "id": "E83-1021.4", "char_start": 138, "char_end": 187 }, { "id": "E83...
[ { "label": 3, "arg1": "E83-1021.1", "arg2": "E83-1021.2", "reverse": false }, { "label": 4, "arg1": "E83-1021.5", "arg2": "E83-1021.6", "reverse": false }, { "label": 3, "arg1": "E83-1021.9", "arg2": "E83-1021.10", "reverse": false }, { "label": 3, ...
E87-1043
Iteration, Habituality And Verb Form Semantics
The verb forms are often claimed to convey two kinds of information : 1. whether the event described in a sentence is present, past or future (= deictic information) 2. whether the event described in a sentence is presented as completed, going on, just starting or being finished (= aspectual information). It will be d...
[ { "id": "E87-1043.1", "char_start": 5, "char_end": 15 }, { "id": "E87-1043.2", "char_start": 57, "char_end": 68 }, { "id": "E87-1043.3", "char_start": 86, "char_end": 91 }, { "id": "E87-1043.4", "char_start": 107, "char_end": 115 }, { "id": "E87-10...
[ { "label": 3, "arg1": "E87-1043.1", "arg2": "E87-1043.2", "reverse": true }, { "label": 4, "arg1": "E87-1043.3", "arg2": "E87-1043.4", "reverse": false }, { "label": 4, "arg1": "E87-1043.9", "arg2": "E87-1043.10", "reverse": false }, { "label": 3, ...
E91-1050
A Language For The Statement Of Binary Relations Over Feature Structures
Unification is often the appropriate method for expressing relations between representations in the form of feature structures; however, there are circumstances in which a different approach is desirable. A declarative formalism is presented which permits direct mappings of one feature structure into another, and illu...
[ { "id": "E91-1050.1", "char_start": 1, "char_end": 12 }, { "id": "E91-1050.2", "char_start": 60, "char_end": 69 }, { "id": "E91-1050.3", "char_start": 78, "char_end": 93 }, { "id": "E91-1050.4", "char_start": 109, "char_end": 127 }, { "id": "E91-10...
[ { "label": 3, "arg1": "E91-1050.2", "arg2": "E91-1050.3", "reverse": false }, { "label": 1, "arg1": "E91-1050.5", "arg2": "E91-1050.6", "reverse": false } ]
E93-1025
A Discourse Copying Algorithm for Ellipsis and Anaphora Resolution
We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suffer from problems inherent in identity-of-relations analyses. Furthermore, in contrast to the approach of Dalrymple et al. [1991], the treat...
[ { "id": "E93-1025.1", "char_start": 25, "char_end": 44 }, { "id": "E93-1025.2", "char_start": 75, "char_end": 102 }, { "id": "E93-1025.3", "char_start": 210, "char_end": 240 }, { "id": "E93-1025.4", "char_start": 376, "char_end": 384 }, { "id": "E9...
[ { "label": 3, "arg1": "E93-1025.1", "arg2": "E93-1025.2", "reverse": true }, { "label": 6, "arg1": "E93-1025.4", "arg2": "E93-1025.5", "reverse": false }, { "label": 3, "arg1": "E93-1025.7", "arg2": "E93-1025.8", "reverse": false } ]
E99-1023
Representing Text Chunks
Dividing sentences in chunks of words is a useful preprocessing step for parsing, information extraction and information retrieval. (Ramshaw and Marcus, 1995) have introduced a "convenient" data representation for chunking by converting it to a tagging task. In this paper we will examine seven different data represent...
[ { "id": "E99-1023.1", "char_start": 10, "char_end": 19 }, { "id": "E99-1023.2", "char_start": 23, "char_end": 38 }, { "id": "E99-1023.3", "char_start": 74, "char_end": 81 }, { "id": "E99-1023.4", "char_start": 83, "char_end": 105 }, { "id": "E99-10...
[ { "label": 4, "arg1": "E99-1023.1", "arg2": "E99-1023.2", "reverse": true }, { "label": 1, "arg1": "E99-1023.6", "arg2": "E99-1023.7", "reverse": false }, { "label": 3, "arg1": "E99-1023.9", "arg2": "E99-1023.10", "reverse": false }, { "label": 2, ...
E95-1021
Tagging French - Comparing A Statistical And A Constraint-Based Method
In this paper we compare two competing approaches to part-of-speech tagging, statistical and constraint-based disambiguation, using French as our test language. We imposed a time limit on our experiment: the amount of time spent on the design of our constraint system was about the same as the time we used to train and...
[ { "id": "E95-1021.1", "char_start": 54, "char_end": 76 }, { "id": "E95-1021.2", "char_start": 78, "char_end": 125 }, { "id": "E95-1021.3", "char_start": 133, "char_end": 139 }, { "id": "E95-1021.4", "char_start": 147, "char_end": 160 }, { "id": "E9...
[ { "label": 1, "arg1": "E95-1021.1", "arg2": "E95-1021.2", "reverse": true }, { "label": 1, "arg1": "E95-1021.3", "arg2": "E95-1021.4", "reverse": false }, { "label": 6, "arg1": "E95-1021.5", "arg2": "E95-1021.6", "reverse": false }, { "label": 6, "...
E99-1015
An Annotation Scheme For Discourse-Level Argumentation In Research Articles
In order to build robust automatic abstracting systems, there is a need for better training resources than are currently available. In this paper, we introduce an annotation scheme for scientific articles which can be used to build such a resource in a consistent way. The seven categories of the scheme are based on rh...
[ { "id": "E99-1015.1", "char_start": 26, "char_end": 55 }, { "id": "E99-1015.2", "char_start": 84, "char_end": 102 }, { "id": "E99-1015.3", "char_start": 164, "char_end": 181 }, { "id": "E99-1015.4", "char_start": 240, "char_end": 248 }, { "id": "E9...
[ { "label": 1, "arg1": "E99-1015.1", "arg2": "E99-1015.2", "reverse": true }, { "label": 1, "arg1": "E99-1015.3", "arg2": "E99-1015.4", "reverse": false } ]
H91-1067
Automatic Acquisition Of Subcategorization Frames From Tagged Text
This paper describes an implemented program that takes a tagged text corpus and generates a partial list of the subcategorization frames in which each verb occurs. The completeness of the output list increases monotonically with the total occurrences of each verb in the training corpus. False positive rates are one to...
[ { "id": "H91-1067.1", "char_start": 58, "char_end": 76 }, { "id": "H91-1067.2", "char_start": 113, "char_end": 137 }, { "id": "H91-1067.3", "char_start": 152, "char_end": 156 }, { "id": "H91-1067.4", "char_start": 240, "char_end": 251 }, { "id": "H...
[ { "label": 3, "arg1": "H91-1067.2", "arg2": "H91-1067.3", "reverse": false }, { "label": 4, "arg1": "H91-1067.5", "arg2": "H91-1067.6", "reverse": false } ]
A97-1021
Large-Scale Acquisition of LCS-Based Lexicons for Foreign Language Tutoring
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 - takes, as in...
[ { "id": "A97-1021.1", "char_start": 43, "char_end": 55 }, { "id": "A97-1021.2", "char_start": 59, "char_end": 109 }, { "id": "A97-1021.3", "char_start": 114, "char_end": 119 }, { "id": "A97-1021.4", "char_start": 132, "char_end": 141 }, { "id": "A9...
[ { "label": 3, "arg1": "A97-1021.2", "arg2": "A97-1021.3", "reverse": false }, { "label": 1, "arg1": "A97-1021.9", "arg2": "A97-1021.10", "reverse": false }, { "label": 1, "arg1": "A97-1021.12", "arg2": "A97-1021.13", "reverse": false }, { "label": 1, ...
A97-1050
Semi-Automatic Acquisition Of Domain-Specific Translation Lexicons
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.
[ { "id": "A97-1050.1", "char_start": 34, "char_end": 87 }, { "id": "A97-1050.2", "char_start": 121, "char_end": 127 }, { "id": "A97-1050.3", "char_start": 147, "char_end": 167 }, { "id": "A97-1050.4", "char_start": 179, "char_end": 188 }, { "id": "A...
[ { "label": 1, "arg1": "A97-1050.1", "arg2": "A97-1050.3", "reverse": false }, { "label": 1, "arg1": "A97-1050.4", "arg2": "A97-1050.6", "reverse": false } ]
J87-1003
SIMULTANEOUS-DISTRIBUTIVE COORDINATION AND CONTEXT-FREENESS
English is shown to be trans-context-free on the basis of coordinations of the respectively type that involve strictly syntactic cross-serial agreement. The agreement in question involves number in nouns and reflexive pronouns and is syntactic rather than semantic in nature because grammatical number in English, like ...
[ { "id": "J87-1003.1", "char_start": 1, "char_end": 8 }, { "id": "J87-1003.2", "char_start": 59, "char_end": 72 }, { "id": "J87-1003.3", "char_start": 111, "char_end": 152 }, { "id": "J87-1003.4", "char_start": 158, "char_end": 167 }, { "id": "J87-1...
[ { "label": 3, "arg1": "J87-1003.2", "arg2": "J87-1003.3", "reverse": false }, { "label": 3, "arg1": "J87-1003.5", "arg2": "J87-1003.6", "reverse": false }, { "label": 4, "arg1": "J87-1003.8", "arg2": "J87-1003.9", "reverse": false }, { "label": 4, ...
I05-5004
A Class-oriented Approach to Building a Paraphrase Corpus
Towards deep analysis of compositional classes of paraphrases, we have examined a class-oriented framework for collecting paraphrase examples, in which sentential paraphrases are collected for each paraphrase class separately by means of automatic candidate generation and manual judgement. Our preliminary experiments ...
[ { "id": "I05-5004.1", "char_start": 26, "char_end": 62 }, { "id": "I05-5004.2", "char_start": 83, "char_end": 107 }, { "id": "I05-5004.3", "char_start": 123, "char_end": 142 }, { "id": "I05-5004.4", "char_start": 153, "char_end": 175 }, { "id": "I0...
[ { "label": 1, "arg1": "I05-5004.2", "arg2": "I05-5004.3", "reverse": false }, { "label": 4, "arg1": "I05-5004.4", "arg2": "I05-5004.5", "reverse": false } ]
P81-1033
A Construction-Specific Approach to Focused Interaction in Flexible Parsing
A flexible parser can deal with input that deviates from its grammar, in addition to input that conforms to it. Ideally, such a parser will correct the deviant input: sometimes, it will be unable to correct it at all; at other times, correction will be possible, but only to within a range of ambiguous possibilities. T...
[ { "id": "P81-1033.1", "char_start": 3, "char_end": 18 }, { "id": "P81-1033.2", "char_start": 62, "char_end": 69 }, { "id": "P81-1033.3", "char_start": 129, "char_end": 135 }, { "id": "P81-1033.4", "char_start": 235, "char_end": 245 }, { "id": "P81-...
[ { "label": 4, "arg1": "P81-1033.1", "arg2": "P81-1033.2", "reverse": true }, { "label": 1, "arg1": "P81-1033.8", "arg2": "P81-1033.9", "reverse": false }, { "label": 1, "arg1": "P81-1033.10", "arg2": "P81-1033.11", "reverse": false }, { "label": 3, ...
P85-1019
Semantic Caseframe Parsing and Syntactic Generality
We have implemented a restricted domain parser called Plume. Building on previous work at Carnegie-Mellon University e.g. [4, 5, 8], Plume's approach to parsing is based on semantic caseframe instantiation. This has the advantages of efficiency on grammatical input, and robustness in the face of ungrammatical input. W...
[ { "id": "P85-1019.1", "char_start": 23, "char_end": 47 }, { "id": "P85-1019.2", "char_start": 55, "char_end": 60 }, { "id": "P85-1019.3", "char_start": 134, "char_end": 161 }, { "id": "P85-1019.4", "char_start": 174, "char_end": 206 }, { "id": "P85...
[ { "label": 1, "arg1": "P85-1019.3", "arg2": "P85-1019.4", "reverse": true }, { "label": 2, "arg1": "P85-1019.9", "arg2": "P85-1019.14", "reverse": false } ]
P91-1025
Resolving Translation Mismatches With Information Flow
Languages differ in the concepts and real-world entities for which they have words and grammatical constructs. Therefore translation must sometimes be a matter of approximating the meaning of a source language text rather than finding an exact counterpart in the target language. We propose a translation framework base...
[ { "id": "P91-1025.1", "char_start": 1, "char_end": 10 }, { "id": "P91-1025.2", "char_start": 25, "char_end": 33 }, { "id": "P91-1025.3", "char_start": 38, "char_end": 57 }, { "id": "P91-1025.4", "char_start": 78, "char_end": 83 }, { "id": "P91-1025...
[ { "label": 4, "arg1": "P91-1025.1", "arg2": "P91-1025.4", "reverse": true }, { "label": 3, "arg1": "P91-1025.7", "arg2": "P91-1025.8", "reverse": false }, { "label": 1, "arg1": "P91-1025.10", "arg2": "P91-1025.11", "reverse": true }, { "label": 3, ...
P95-1034
Two-Level, Many-Paths Generation
Large-scale natural language generation requires the integration of vast amounts of knowledge: lexical, grammatical, and conceptual. A robust generator must be able to operate well even when pieces of knowledge are missing. It must also be robust against incomplete or inaccurate inputs. To attack these problems, we ha...
[ { "id": "P95-1034.1", "char_start": 1, "char_end": 40 }, { "id": "P95-1034.2", "char_start": 85, "char_end": 94 }, { "id": "P95-1034.3", "char_start": 136, "char_end": 152 }, { "id": "P95-1034.4", "char_start": 202, "char_end": 211 }, { "id": "P95-...
[ { "label": 1, "arg1": "P95-1034.1", "arg2": "P95-1034.2", "reverse": true }, { "label": 1, "arg1": "P95-1034.3", "arg2": "P95-1034.4", "reverse": true }, { "label": 1, "arg1": "P95-1034.6", "arg2": "P95-1034.8", "reverse": true }, { "label": 3, "ar...
P97-1017
Machine Transliteration
It is challenging to translate names and technical terms across languages with different alphabets and sound inventories. These items are commonly transliterated, i.e., replaced with approximate phonetic equivalents. For example, computer in English comes out as ~ i/l:::'=--~-- (konpyuutaa) in Japanese. Translating su...
[ { "id": "P97-1017.1", "char_start": 32, "char_end": 37 }, { "id": "P97-1017.2", "char_start": 42, "char_end": 57 }, { "id": "P97-1017.3", "char_start": 65, "char_end": 74 }, { "id": "P97-1017.4", "char_start": 90, "char_end": 99 }, { "id": "P97-101...
[ { "label": 3, "arg1": "P97-1017.3", "arg2": "P97-1017.4", "reverse": false }, { "label": 6, "arg1": "P97-1017.7", "arg2": "P97-1017.8", "reverse": false }, { "label": 1, "arg1": "P97-1017.13", "arg2": "P97-1017.14", "reverse": true }, { "label": 1, ...
P97-1058
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. These requirements may be reconciled by using the more complex grammar t...
[ { "id": "P97-1058.1", "char_start": 29, "char_end": 43 }, { "id": "P97-1058.2", "char_start": 48, "char_end": 66 }, { "id": "P97-1058.3", "char_start": 71, "char_end": 94 }, { "id": "P97-1058.4", "char_start": 111, "char_end": 134 }, { "id": "P97-1...
[ { "label": 1, "arg1": "P97-1058.5", "arg2": "P97-1058.6", "reverse": true }, { "label": 1, "arg1": "P97-1058.8", "arg2": "P97-1058.9", "reverse": false } ]
P99-1036
A Part of Speech Estimation Method for Japanese Unknown Words using a Statistical Model of Morphology and Context
We present a statistical model of Japanese unknown words consisting of a set of length and spelling models classified by the character types that constitute a word. The point is quite simple: different character sets should be treated differently and the changes between character types are very important because Japan...
[ { "id": "P99-1036.1", "char_start": 14, "char_end": 31 }, { "id": "P99-1036.2", "char_start": 35, "char_end": 57 }, { "id": "P99-1036.3", "char_start": 81, "char_end": 107 }, { "id": "P99-1036.4", "char_start": 126, "char_end": 141 }, { "id": "P99-...
[ { "label": 3, "arg1": "P99-1036.1", "arg2": "P99-1036.2", "reverse": false }, { "label": 4, "arg1": "P99-1036.4", "arg2": "P99-1036.5", "reverse": false }, { "label": 4, "arg1": "P99-1036.8", "arg2": "P99-1036.9", "reverse": true } ]
P99-1080
A Pylonic Decision-Tree Language Model with Optimal Question Selection
This paper discusses a decision-tree approach to the problem of assigning probabilities to words following a given text. In contrast with previous decision-tree language model attempts, an algorithm for selecting nearly optimal questions is considered. The model is to be tested on a standard task, The Wall Street Jour...
[ { "id": "P99-1080.1", "char_start": 24, "char_end": 46 }, { "id": "P99-1080.2", "char_start": 75, "char_end": 88 }, { "id": "P99-1080.3", "char_start": 92, "char_end": 97 }, { "id": "P99-1080.4", "char_start": 116, "char_end": 120 }, { "id": "P99-1...
[ { "label": 1, "arg1": "P99-1080.1", "arg2": "P99-1080.2", "reverse": false }, { "label": 4, "arg1": "P99-1080.3", "arg2": "P99-1080.4", "reverse": false } ]
E93-1066
Two-Level Description Of Turkish Morphology
This poster paper describes a full scale two-level morphological description (Karttunen, 1983; Koskenniemi, 1983) of Turkish word structures. The description has been implemented using the PC-KIMMO environment (Antworth, 1990) and is based on a root word lexicon of about 23,000 roots words. Almost all the special case...
[ { "id": "E93-1066.1", "char_start": 31, "char_end": 77 }, { "id": "E93-1066.2", "char_start": 118, "char_end": 141 }, { "id": "E93-1066.3", "char_start": 190, "char_end": 210 }, { "id": "E93-1066.4", "char_start": 246, "char_end": 263 }, { "id": "E...
[ { "label": 3, "arg1": "E93-1066.1", "arg2": "E93-1066.2", "reverse": false }, { "label": 4, "arg1": "E93-1066.4", "arg2": "E93-1066.5", "reverse": true }, { "label": 3, "arg1": "E93-1066.7", "arg2": "E93-1066.8", "reverse": false }, { "label": 3, "...
X96-1041
TUIT : A Toolkit For Constructing Multilingual TIPSTER User Interfaces
The TIPSTER Architecture has been designed to enable a variety of different text applications to use a set of common text processing modules. Since user interfaces work best when customized for particular applications , it is appropriator that no particular user interface styles or conventions are described in the TIP...
[ { "id": "X96-1041.1", "char_start": 5, "char_end": 25 }, { "id": "X96-1041.2", "char_start": 77, "char_end": 94 }, { "id": "X96-1041.3", "char_start": 111, "char_end": 141 }, { "id": "X96-1041.4", "char_start": 149, "char_end": 164 }, { "id": "X96-...
[ { "label": 1, "arg1": "X96-1041.2", "arg2": "X96-1041.3", "reverse": true }, { "label": 5, "arg1": "X96-1041.6", "arg2": "X96-1041.7", "reverse": true }, { "label": 1, "arg1": "X96-1041.9", "arg2": "X96-1041.10", "reverse": true }, { "label": 1, "a...
P02-1008
Phonological Comprehension And The Compilation Of Optimality Theory
This paper ties up some loose ends in finite-state Optimality Theory. First, it discusses how to perform comprehension under Optimality Theory grammars consisting of finite-state constraints. Comprehension has not been much studied in OT; we show that unlike production, it does not always yield a regular set, making f...
[ { "id": "P02-1008.1", "char_start": 39, "char_end": 69 }, { "id": "P02-1008.2", "char_start": 106, "char_end": 119 }, { "id": "P02-1008.3", "char_start": 126, "char_end": 152 }, { "id": "P02-1008.4", "char_start": 167, "char_end": 191 }, { "id": "P...
[]
P98-2176
Learning Correlations between Linguistic Indicators and Semantic Constraints : Reuse of Context-Dependent Descriptions of Entities
This paper presents the results of a study on the semantic constraints imposed on lexical choice by certain contextual indicators. We show how such indicators are computed and how correlations between them and the choice of a noun phrase description of a named entity can be automatically established using supervised l...
[ { "id": "P98-2176.1", "char_start": 51, "char_end": 71 }, { "id": "P98-2176.2", "char_start": 83, "char_end": 97 }, { "id": "P98-2176.3", "char_start": 109, "char_end": 130 }, { "id": "P98-2176.4", "char_start": 149, "char_end": 159 }, { "id": "P98...
[]
H94-1024
Evaluation In The ARPA Machine Translation Program : 1993 Methodology
In the second year of evaluations of the ARPA HLT Machine Translation (MT) Initiative, methodologies developed and tested in 1992 were applied to the 1993 MT test runs. The current methodology optimizes the inherently subjective judgments on translation accuracy and quality by channeling the judgments of non-translato...
[ { "id": "H94-1024.1", "char_start": 23, "char_end": 34 }, { "id": "H94-1024.2", "char_start": 42, "char_end": 86 }, { "id": "H94-1024.3", "char_start": 151, "char_end": 168 }, { "id": "H94-1024.4", "char_start": 219, "char_end": 239 }, { "id": "H94...
[]
C02-1071
Integrating Shallow Linguistic Processing Into A Unification-Based Spanish Grammar
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 analysis impr...
[ { "id": "C02-1071.1", "char_start": 37, "char_end": 52 }, { "id": "C02-1071.2", "char_start": 70, "char_end": 88 }, { "id": "C02-1071.3", "char_start": 107, "char_end": 117 }, { "id": "C02-1071.4", "char_start": 137, "char_end": 170 }, { "id": "C02...
[ { "label": 1, "arg1": "C02-1071.1", "arg2": "C02-1071.2", "reverse": true }, { "label": 4, "arg1": "C02-1071.3", "arg2": "C02-1071.4", "reverse": true }, { "label": 3, "arg1": "C02-1071.7", "arg2": "C02-1071.8", "reverse": false }, { "label": 2, "a...
P06-2067
Parsing And Subcategorization Data
In this paper, we compare the performance of a state-of-the-art statistical parser (Bikel, 2004) in parsing written and spoken language and in generating sub-categorization cues from written and spoken language. Although Bikel's parser achieves a higher accuracy for parsing written language, it achieves a higher accur...
[ { "id": "P06-2067.1", "char_start": 65, "char_end": 83 }, { "id": "P06-2067.2", "char_start": 109, "char_end": 136 }, { "id": "P06-2067.3", "char_start": 155, "char_end": 178 }, { "id": "P06-2067.4", "char_start": 184, "char_end": 211 }, { "id": "P...
[ { "label": 1, "arg1": "P06-2067.1", "arg2": "P06-2067.2", "reverse": false }, { "label": 2, "arg1": "P06-2067.5", "arg2": "P06-2067.6", "reverse": false }, { "label": 1, "arg1": "P06-2067.11", "arg2": "P06-2067.12", "reverse": false }, { "label": 1, ...
C94-1088
Character-Based Collocation For Mandarin Chinese
This paper describes a characters-based Chinese collocation system and discusses the advantages of it over a traditional word-based system. Since wordbreaks are not conventionally marked in Chinese text corpora, a character-based collocation system has the dual advantages of avoiding pre-processing distortion and dire...
[ { "id": "C94-1088.1", "char_start": 24, "char_end": 67 }, { "id": "C94-1088.2", "char_start": 122, "char_end": 139 }, { "id": "C94-1088.3", "char_start": 147, "char_end": 157 }, { "id": "C94-1088.4", "char_start": 191, "char_end": 211 }, { "id": "C...
[ { "label": 6, "arg1": "C94-1088.1", "arg2": "C94-1088.2", "reverse": false }, { "label": 4, "arg1": "C94-1088.3", "arg2": "C94-1088.4", "reverse": false }, { "label": 1, "arg1": "C94-1088.8", "arg2": "C94-1088.9", "reverse": true } ]
C04-1024
Efficient Parsing Of Highly Ambiguous Context-Free Grammars With Bit Vectors
An efficient bit-vector-based CKY-style parser for context-free parsing is presented. The parser computes a compact parse forest representation of the complete set of possible analyses for large treebank grammars and long input sentences. The parser uses bit-vector operations to parallelise the basic parsing operation...
[ { "id": "C04-1024.1", "char_start": 14, "char_end": 47 }, { "id": "C04-1024.2", "char_start": 52, "char_end": 72 }, { "id": "C04-1024.3", "char_start": 91, "char_end": 97 }, { "id": "C04-1024.4", "char_start": 117, "char_end": 144 }, { "id": "C04-1...
[ { "label": 1, "arg1": "C04-1024.1", "arg2": "C04-1024.2", "reverse": false }, { "label": 3, "arg1": "C04-1024.4", "arg2": "C04-1024.5", "reverse": false }, { "label": 1, "arg1": "C04-1024.7", "arg2": "C04-1024.8", "reverse": true } ]
N04-1008
Automatic Question Answering : Beyond The Factoid
In this paper we describe and evaluate a Question Answering system that goes beyond answering factoid questions. We focus on FAQ-like questions and answers , and build our system around a noisy-channel architecture which exploits both a language model for answers and a transformation model for answer/question terms, t...
[ { "id": "N04-1008.1", "char_start": 42, "char_end": 67 }, { "id": "N04-1008.2", "char_start": 126, "char_end": 156 }, { "id": "N04-1008.3", "char_start": 189, "char_end": 215 }, { "id": "N04-1008.4", "char_start": 238, "char_end": 252 }, { "id": "N...
[ { "label": 1, "arg1": "N04-1008.4", "arg2": "N04-1008.5", "reverse": false }, { "label": 1, "arg1": "N04-1008.6", "arg2": "N04-1008.7", "reverse": false }, { "label": 4, "arg1": "N04-1008.8", "arg2": "N04-1008.9", "reverse": true } ]
P05-1046
Unsupervised Learning Of Field Segmentation Models For Information Extraction
The applicability of many current information extraction techniques is severely limited by the need for supervised training data. We demonstrate that for certain field structured extraction tasks, such as classified advertisements and bibliographic citations, small amounts of prior knowledge can be used to learn effe...
[ { "id": "P05-1046.1", "char_start": 35, "char_end": 68 }, { "id": "P05-1046.2", "char_start": 105, "char_end": 129 }, { "id": "P05-1046.3", "char_start": 164, "char_end": 197 }, { "id": "P05-1046.4", "char_start": 279, "char_end": 294 }, { "id": "P...
[ { "label": 1, "arg1": "P05-1046.1", "arg2": "P05-1046.2", "reverse": true }, { "label": 1, "arg1": "P05-1046.3", "arg2": "P05-1046.4", "reverse": true }, { "label": 3, "arg1": "P05-1046.6", "arg2": "P05-1046.7", "reverse": false }, { "label": 2, "a...
P05-1073
Joint Learning Improves Semantic Role Labeling
Despite much recent progress on accurate semantic role labeling, previous work has largely used independent classifiers, possibly combined with separate label sequence models via Viterbi decoding. This stands in stark contrast to the linguistic observation that a core argument frame is a joint structure, with strong d...
[ { "id": "P05-1073.1", "char_start": 42, "char_end": 64 }, { "id": "P05-1073.2", "char_start": 97, "char_end": 120 }, { "id": "P05-1073.3", "char_start": 154, "char_end": 175 }, { "id": "P05-1073.4", "char_start": 180, "char_end": 196 }, { "id": "P0...
[ { "label": 1, "arg1": "P05-1073.1", "arg2": "P05-1073.2", "reverse": true }, { "label": 3, "arg1": "P05-1073.6", "arg2": "P05-1073.7", "reverse": false }, { "label": 3, "arg1": "P05-1073.8", "arg2": "P05-1073.9", "reverse": false }, { "label": 4, "...
P05-3030
Organizing English Reading Materials For Vocabulary Learning
We propose a method of organizing reading materials for vocabulary learning. It enables us to select a concise set of reading texts (from a target corpus) that contains all the target vocabulary to be learned. We used a specialized vocabulary for an English certification test as the target vocabulary and used English ...
[ { "id": "P05-3030.1", "char_start": 57, "char_end": 76 }, { "id": "P05-3030.2", "char_start": 127, "char_end": 132 }, { "id": "P05-3030.3", "char_start": 141, "char_end": 154 }, { "id": "P05-3030.4", "char_start": 178, "char_end": 195 }, { "id": "P...
[ { "label": 4, "arg1": "P05-3030.2", "arg2": "P05-3030.3", "reverse": false }, { "label": 1, "arg1": "P05-3030.5", "arg2": "P05-3030.6", "reverse": false }, { "label": 1, "arg1": "P05-3030.7", "arg2": "P05-3030.8", "reverse": false } ]
E83-1029
NATURAL LANGUAGE INPUT FOR SCENE GENERATION
In this paper a system which understands and conceptualizes scenes descriptions in natural language is presented. Specifically, the following components of the system are described: the syntactic analyzer, based on a Procedural Systemic Grammar, the semantic analyzer relying on the Conceptual Dependency Theory, and th...
[ { "id": "E83-1029.1", "char_start": 61, "char_end": 100 }, { "id": "E83-1029.2", "char_start": 187, "char_end": 205 }, { "id": "E83-1029.3", "char_start": 218, "char_end": 245 }, { "id": "E83-1029.4", "char_start": 251, "char_end": 268 }, { "id": "...
[ { "label": 1, "arg1": "E83-1029.2", "arg2": "E83-1029.3", "reverse": true }, { "label": 1, "arg1": "E83-1029.4", "arg2": "E83-1029.5", "reverse": true } ]
E89-1006
TENSES AS ANAPHORA
A proposal to deal with French tenses in the framework of Discourse Representation Theory is presented, as it has been implemented for a fragment at the IMS. It is based on the theory of tenses of H. Kamp and Ch. Rohrer. Instead of using operators to express the meaning of the tenses the Reichenbachian point of view i...
[ { "id": "E89-1006.1", "char_start": 25, "char_end": 38 }, { "id": "E89-1006.2", "char_start": 59, "char_end": 90 }, { "id": "E89-1006.3", "char_start": 154, "char_end": 157 }, { "id": "E89-1006.4", "char_start": 178, "char_end": 194 }, { "id": "E89...
[ { "label": 3, "arg1": "E89-1006.1", "arg2": "E89-1006.2", "reverse": true }, { "label": 3, "arg1": "E89-1006.6", "arg2": "E89-1006.7", "reverse": false }, { "label": 3, "arg1": "E89-1006.9", "arg2": "E89-1006.10", "reverse": false }, { "label": 4, ...
E93-1004
Talking About Trees
In this paper we introduce a modal language LTfor imposing constraints on trees, and an extension LT (LF) for imposing constraints on trees decorated with feature structures. The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper illustrat...
[ { "id": "E93-1004.1", "char_start": 30, "char_end": 47 }, { "id": "E93-1004.2", "char_start": 60, "char_end": 71 }, { "id": "E93-1004.3", "char_start": 75, "char_end": 80 }, { "id": "E93-1004.4", "char_start": 99, "char_end": 106 }, { "id": "E93-10...
[ { "label": 3, "arg1": "E93-1004.7", "arg2": "E93-1004.8", "reverse": false }, { "label": 6, "arg1": "E93-1004.9", "arg2": "E93-1004.10", "reverse": false } ]
E99-1029
Parsing with an Extended Domain of Locality
One of the claimed benefits of Tree Adjoining Grammars is that they have an extended domain of locality (EDOL). We consider how this can be exploited to limit the need for feature structure unification during parsing. We compare two wide-coverage lexicalized grammars of English, LEXSYS and XTAG, finding that the two g...
[ { "id": "E99-1029.1", "char_start": 32, "char_end": 55 }, { "id": "E99-1029.2", "char_start": 77, "char_end": 111 }, { "id": "E99-1029.3", "char_start": 173, "char_end": 202 }, { "id": "E99-1029.4", "char_start": 210, "char_end": 217 }, { "id": "E9...
[ { "label": 3, "arg1": "E99-1029.1", "arg2": "E99-1029.2", "reverse": false }, { "label": 1, "arg1": "E99-1029.3", "arg2": "E99-1029.4", "reverse": false }, { "label": 6, "arg1": "E99-1029.6", "arg2": "E99-1029.7", "reverse": false }, { "label": 1, ...
E95-1033
ParseTalk About Sentence- And Text-Level Anaphora
We provide a unified account of sentence-level and text-level anaphora within the framework of a dependency-based grammar model. Criteria for anaphora resolution within sentence boundaries rephrase major concepts from GB's binding theory, while those for text-level anaphora incorporate an adapted version of a Grosz-Si...
[ { "id": "E95-1033.1", "char_start": 33, "char_end": 71 }, { "id": "E95-1033.2", "char_start": 98, "char_end": 128 }, { "id": "E95-1033.3", "char_start": 143, "char_end": 162 }, { "id": "E95-1033.4", "char_start": 170, "char_end": 189 }, { "id": "E9...
[ { "label": 3, "arg1": "E95-1033.1", "arg2": "E95-1033.2", "reverse": true }, { "label": 3, "arg1": "E95-1033.6", "arg2": "E95-1033.7", "reverse": true } ]
H89-1027
The MIT Summit Speech Recognition System : A Progress Report
Recently, we initiated a project to develop a phonetically-based spoken language understanding system called SUMMIT. In contrast to many of the past efforts that make use of heuristic rules whose development requires intense knowledge engineering, our approach attempts to express the speech knowledge within a formal f...
[ { "id": "H89-1027.1", "char_start": 47, "char_end": 102 }, { "id": "H89-1027.2", "char_start": 110, "char_end": 116 }, { "id": "H89-1027.3", "char_start": 175, "char_end": 190 }, { "id": "H89-1027.4", "char_start": 226, "char_end": 247 }, { "id": "...
[ { "label": 1, "arg1": "H89-1027.3", "arg2": "H89-1027.4", "reverse": true }, { "label": 1, "arg1": "H89-1027.7", "arg2": "H89-1027.8", "reverse": true } ]
H91-1077
A Proposal For Lexical Disambiguation
A method of sense resolution is proposed that is based on WordNet, an on-line lexical database that incorporates semantic relations (synonymy, antonymy, hyponymy, meronymy, causal and troponymic entailment) as labeled pointers between word senses. With WordNet, it is easy to retrieve sets of semantically related words...
[ { "id": "H91-1077.1", "char_start": 13, "char_end": 29 }, { "id": "H91-1077.2", "char_start": 59, "char_end": 66 }, { "id": "H91-1077.3", "char_start": 79, "char_end": 95 }, { "id": "H91-1077.4", "char_start": 114, "char_end": 132 }, { "id": "H91-1...
[ { "label": 1, "arg1": "H91-1077.1", "arg2": "H91-1077.2", "reverse": true }, { "label": 4, "arg1": "H91-1077.3", "arg2": "H91-1077.4", "reverse": true }, { "label": 4, "arg1": "H91-1077.12", "arg2": "H91-1077.13", "reverse": true }, { "label": 4, "...
A97-1027
Dutch Sublanguage Semantic Tagging Combined With Mark-Up Technology
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 Processo...
[ { "id": "A97-1027.1", "char_start": 40, "char_end": 63 }, { "id": "A97-1027.2", "char_start": 79, "char_end": 141 }, { "id": "A97-1027.3", "char_start": 215, "char_end": 243 }, { "id": "A97-1027.4", "char_start": 251, "char_end": 322 }, { "id": "A9...
[ { "label": 4, "arg1": "A97-1027.1", "arg2": "A97-1027.2", "reverse": false }, { "label": 4, "arg1": "A97-1027.3", "arg2": "A97-1027.4", "reverse": false }, { "label": 4, "arg1": "A97-1027.6", "arg2": "A97-1027.7", "reverse": false } ]
A97-1052
Automatic Extraction Of Subcategorization From Corpora
We describe a novel technique and implemented system for constructing a subcategorization dictionary from textual corpora. Each dictionary entry encodes the relative frequency of occurrence of a comprehensive set of subcategorization classes for English. An initial experiment, on a sample of 14 verbs which exhibit mul...
[ { "id": "A97-1052.1", "char_start": 73, "char_end": 101 }, { "id": "A97-1052.2", "char_start": 107, "char_end": 122 }, { "id": "A97-1052.3", "char_start": 129, "char_end": 145 }, { "id": "A97-1052.4", "char_start": 158, "char_end": 190 }, { "id": "...
[ { "label": 1, "arg1": "A97-1052.1", "arg2": "A97-1052.2", "reverse": true }, { "label": 3, "arg1": "A97-1052.4", "arg2": "A97-1052.5", "reverse": false }, { "label": 3, "arg1": "A97-1052.7", "arg2": "A97-1052.8", "reverse": true }, { "label": 2, "a...
J87-3001
PROCESSING DICTIONARY DEFINITIONS WITH PHRASAL PATTERN HIERARCHIES
This paper shows how dictionary word sense definitions can be analysed by applying a hierarchy of phrasal patterns. An experimental system embodying this mechanism has been implemented for processing definitions from the Longman Dictionary of Contemporary English. A property of this dictionary, exploited by the system...
[ { "id": "J87-3001.1", "char_start": 22, "char_end": 55 }, { "id": "J87-3001.2", "char_start": 99, "char_end": 115 }, { "id": "J87-3001.3", "char_start": 201, "char_end": 212 }, { "id": "J87-3001.4", "char_start": 222, "char_end": 264 }, { "id": "J8...
[ { "label": 1, "arg1": "J87-3001.1", "arg2": "J87-3001.2", "reverse": true }, { "label": 4, "arg1": "J87-3001.3", "arg2": "J87-3001.4", "reverse": false }, { "label": 1, "arg1": "J87-3001.6", "arg2": "J87-3001.7", "reverse": false }, { "label": 3, "...
I05-5009
Evaluating Contextual Dependency of Paraphrases using a Latent Variable Model
This paper presents an evaluation method employing a latent variable model for paraphrases with their contexts. We assume that the context of a sentence is indicated by a latent variable of the model as a topic and that the likelihood of each variable can be inferred. A paraphrase is evaluated for whether its sentence...
[ { "id": "I05-5009.1", "char_start": 24, "char_end": 41 }, { "id": "I05-5009.2", "char_start": 54, "char_end": 75 }, { "id": "I05-5009.3", "char_start": 80, "char_end": 91 }, { "id": "I05-5009.4", "char_start": 103, "char_end": 111 }, { "id": "I05-5...
[ { "label": 1, "arg1": "I05-5009.1", "arg2": "I05-5009.2", "reverse": true }, { "label": 3, "arg1": "I05-5009.3", "arg2": "I05-5009.4", "reverse": true }, { "label": 3, "arg1": "I05-5009.5", "arg2": "I05-5009.6", "reverse": false }, { "label": 4, "a...
P83-1003
Crossed Serial Dependencies : A low-power parseable extension to GPSG
An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies, as found i...
[ { "id": "P83-1003.1", "char_start": 21, "char_end": 47 }, { "id": "P83-1003.2", "char_start": 70, "char_end": 83 }, { "id": "P83-1003.3", "char_start": 118, "char_end": 133 }, { "id": "P83-1003.4", "char_start": 148, "char_end": 167 }, { "id": "P83...
[ { "label": 4, "arg1": "P83-1003.2", "arg2": "P83-1003.3", "reverse": true }, { "label": 1, "arg1": "P83-1003.5", "arg2": "P83-1003.6", "reverse": false }, { "label": 1, "arg1": "P83-1003.10", "arg2": "P83-1003.11", "reverse": false } ]