id stringlengths 8 8 | title stringlengths 18 138 | abstract stringlengths 177 1.96k | entities list | relations list |
|---|---|---|---|---|
C82-1054 | AN IMPROVED LEFT-CORNER PARSING ALGORITHM |
This paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars . It is argued that the resulting algorithm is both efficient and flexible and is, therefore, a good choice for the parser used in a natural language interface . | [
{
"id": "C82-1054.1",
"char_start": 56,
"char_end": 85
},
{
"id": "C82-1054.2",
"char_start": 90,
"char_end": 111
},
{
"id": "C82-1054.3",
"char_start": 228,
"char_end": 234
},
{
"id": "C82-1054.4",
"char_start": 245,
"char_end": 271
}
] | [
{
"label": 1,
"arg1": "C82-1054.1",
"arg2": "C82-1054.2",
"reverse": false
},
{
"label": 1,
"arg1": "C82-1054.3",
"arg2": "C82-1054.4",
"reverse": false
}
] |
J82-3002 | An Efficient Easily Adaptable System for Interpreting Natural Language Queries |
This paper gives an overall account of a prototype natural language question answering system , called Chat-80 . Chat-80 has been designed to be both efficient and easily adaptable to a variety of applications. The system is implemented entirely in Prolog , a programming language based on logic . With the aid of a l... | [
{
"id": "J82-3002.1",
"char_start": 54,
"char_end": 96
},
{
"id": "J82-3002.2",
"char_start": 106,
"char_end": 113
},
{
"id": "J82-3002.3",
"char_start": 116,
"char_end": 123
},
{
"id": "J82-3002.4",
"char_start": 252,
"char_end": 258
},
{
"id": "J... | [
{
"label": 1,
"arg1": "J82-3002.5",
"arg2": "J82-3002.6",
"reverse": true
},
{
"label": 1,
"arg1": "J82-3002.9",
"arg2": "J82-3002.10",
"reverse": false
},
{
"label": 4,
"arg1": "J82-3002.11",
"arg2": "J82-3002.12",
"reverse": true
},
{
"label": 1,
... |
P82-1035 | Scruffy Text Understanding: Design and Implementation of 'Tolerant' Understanders |
Most large text-understanding systems have been designed under the assumption that the input text will be in reasonably neat form, e.g., newspaper stories and other edited texts . However, a great deal of natural language texts e.g., memos , rough drafts , conversation transcripts etc., have features that differ sig... | [
{
"id": "P82-1035.1",
"char_start": 14,
"char_end": 40
},
{
"id": "P82-1035.2",
"char_start": 96,
"char_end": 100
},
{
"id": "P82-1035.3",
"char_start": 140,
"char_end": 157
},
{
"id": "P82-1035.4",
"char_start": 168,
"char_end": 180
},
{
"id": "P8... | [
{
"label": 6,
"arg1": "P82-1035.8",
"arg2": "P82-1035.9",
"reverse": false
},
{
"label": 1,
"arg1": "P82-1035.14",
"arg2": "P82-1035.15",
"reverse": true
},
{
"label": 3,
"arg1": "P82-1035.18",
"arg2": "P82-1035.19",
"reverse": true
},
{
"label": 3,
... |
P84-1020 | LIMITED DOMAIN SYSTEMS FOR LANGUAGE TEACHING |
This abstract describes a natural language system which deals usefully with ungrammatical input and describes some actual and potential applications of it in computer aided second language learning . However, this is not the only area in which the principles of the system might be used, and the aim in building it wa... | [
{
"id": "P84-1020.1",
"char_start": 29,
"char_end": 52
},
{
"id": "P84-1020.2",
"char_start": 79,
"char_end": 98
},
{
"id": "P84-1020.3",
"char_start": 161,
"char_end": 200
}
] | [
{
"label": 1,
"arg1": "P84-1020.1",
"arg2": "P84-1020.2",
"reverse": false
}
] |
P84-1034 | A PROPER TREATMEMT OF SYNTAX AND SEMANTICS IN MACHINE TRANSLATION |
A proper treatment of syntax and semantics in machine translation is introduced and discussed from the empirical viewpoint. For English-Japanese machine translation , the syntax directed approach is effective where the Heuristic Parsing Model (HPM) and the Syntactic Role System play important roles. For Japanese-Eng... | [
{
"id": "P84-1034.1",
"char_start": 25,
"char_end": 31
},
{
"id": "P84-1034.2",
"char_start": 36,
"char_end": 45
},
{
"id": "P84-1034.3",
"char_start": 49,
"char_end": 68
},
{
"id": "P84-1034.4",
"char_start": 131,
"char_end": 167
},
{
"id": "P84-1... | [
{
"label": 1,
"arg1": "P84-1034.4",
"arg2": "P84-1034.5",
"reverse": true
},
{
"label": 1,
"arg1": "P84-1034.8",
"arg2": "P84-1034.9",
"reverse": false
},
{
"label": 6,
"arg1": "P84-1034.13",
"arg2": "P84-1034.14",
"reverse": false
}
] |
P84-1047 | Entity-Oriented Parsing |
An entity-oriented approach to restricted-domain parsing is proposed. In this approach, the definitions of the structure and surface representation of domain entities are grouped together. Like semantic grammar , this allows easy exploitation of limited domain semantics . In addition, it facilitates fragmentary reco... | [
{
"id": "P84-1047.1",
"char_start": 6,
"char_end": 59
},
{
"id": "P84-1047.2",
"char_start": 114,
"char_end": 123
},
{
"id": "P84-1047.3",
"char_start": 128,
"char_end": 150
},
{
"id": "P84-1047.4",
"char_start": 154,
"char_end": 169
},
{
"id": "P8... | [
{
"label": 3,
"arg1": "P84-1047.3",
"arg2": "P84-1047.4",
"reverse": false
},
{
"label": 1,
"arg1": "P84-1047.8",
"arg2": "P84-1047.9",
"reverse": false
},
{
"label": 1,
"arg1": "P84-1047.12",
"arg2": "P84-1047.13",
"reverse": false
},
{
"label": 1,
... |
P84-1064 | A COMPUTATIONAL THEORY OF DISPOSITIONS |
Informally, a disposition is a proposition which is preponderantly, but not necessarily always, true. For example, birds can fly is a disposition , as are the propositions Swedes are blond and Spaniards are dark. An idea which underlies the theory described in this paper is that a disposition may be viewed as a prop... | [
{
"id": "P84-1064.1",
"char_start": 17,
"char_end": 28
},
{
"id": "P84-1064.2",
"char_start": 34,
"char_end": 45
},
{
"id": "P84-1064.3",
"char_start": 137,
"char_end": 148
},
{
"id": "P84-1064.4",
"char_start": 162,
"char_end": 174
},
{
"id": "P84... | [
{
"label": 4,
"arg1": "P84-1064.6",
"arg2": "P84-1064.7",
"reverse": true
},
{
"label": 4,
"arg1": "P84-1064.8",
"arg2": "P84-1064.9",
"reverse": false
},
{
"label": 3,
"arg1": "P84-1064.15",
"arg2": "P84-1064.16",
"reverse": false
},
{
"label": 3,
... |
P84-1078 | Controlling Lexical Substitution in Computer Text Generation |
This report describes Paul , a computer text generation system designed to create cohesive text through the use of lexical substitutions . Specifically, this system is designed to deterministically choose between pronominalization , superordinate substitution , and definite noun phrase reiteration . The system ident... | [
{
"id": "P84-1078.1",
"char_start": 25,
"char_end": 29
},
{
"id": "P84-1078.2",
"char_start": 34,
"char_end": 65
},
{
"id": "P84-1078.3",
"char_start": 85,
"char_end": 98
},
{
"id": "P84-1078.4",
"char_start": 118,
"char_end": 139
},
{
"id": "P84-1... | [
{
"label": 1,
"arg1": "P84-1078.2",
"arg2": "P84-1078.4",
"reverse": true
},
{
"label": 6,
"arg1": "P84-1078.5",
"arg2": "P84-1078.6",
"reverse": false
},
{
"label": 3,
"arg1": "P84-1078.8",
"arg2": "P84-1078.9",
"reverse": false
},
{
"label": 3,
"... |
C86-1081 | A LOGICAL FORMALISM FOR THE REPRESENTATION OF DETERMINERS |
Determiners play an important role in conveying the meaning of an utterance , but they have often been disregarded, perhaps because it seemed more important to devise methods to grasp the global meaning of a sentence , even if not in a precise way. Another problem with determiners is their inherent ambiguity . In t... | [
{
"id": "C86-1081.1",
"char_start": 3,
"char_end": 14
},
{
"id": "C86-1081.2",
"char_start": 55,
"char_end": 62
},
{
"id": "C86-1081.3",
"char_start": 69,
"char_end": 78
},
{
"id": "C86-1081.4",
"char_start": 191,
"char_end": 206
},
{
"id": "C86-10... | [
{
"label": 3,
"arg1": "C86-1081.2",
"arg2": "C86-1081.3",
"reverse": false
},
{
"label": 3,
"arg1": "C86-1081.4",
"arg2": "C86-1081.5",
"reverse": false
},
{
"label": 3,
"arg1": "C86-1081.6",
"arg2": "C86-1081.7",
"reverse": true
},
{
"label": 3,
"... |
C86-1132 | SYNTHESIZING WEATHER FORECASTS FROM FORMATFED DATA |
This paper describes a system ( RAREAS ) which synthesizes marine weather forecasts directly from formatted weather data . Such synthesis appears feasible in certain natural sublanguages with stereotyped text structure . RAREAS draws on several kinds of linguistic and non-linguistic knowledge and mirrors a forecaste... | [
{
"id": "C86-1132.1",
"char_start": 35,
"char_end": 41
},
{
"id": "C86-1132.2",
"char_start": 101,
"char_end": 123
},
{
"id": "C86-1132.3",
"char_start": 131,
"char_end": 140
},
{
"id": "C86-1132.4",
"char_start": 169,
"char_end": 189
},
{
"id": "C... | [
{
"label": 1,
"arg1": "C86-1132.1",
"arg2": "C86-1132.2",
"reverse": false
},
{
"label": 3,
"arg1": "C86-1132.4",
"arg2": "C86-1132.5",
"reverse": true
},
{
"label": 1,
"arg1": "C86-1132.6",
"arg2": "C86-1132.7",
"reverse": true
}
] |
J86-1002 | THE CORRECTION OF ILL-FORMED INPUT USING HISTORY-BASED EXPECTATION WITH APPLICATIONS TO SPEECH UNDERSTANDING |
A method for error correction of ill-formed input is described that acquires dialogue patterns in typical usage and uses these patterns to predict new inputs. Error correction is done by strongly biasing parsing toward expected meanings unless clear evidence from the input shows the current sentence is not expected.... | [
{
"id": "J86-1002.1",
"char_start": 16,
"char_end": 32
},
{
"id": "J86-1002.2",
"char_start": 36,
"char_end": 52
},
{
"id": "J86-1002.3",
"char_start": 80,
"char_end": 97
},
{
"id": "J86-1002.4",
"char_start": 130,
"char_end": 138
},
{
"id": "J86-1... | [
{
"label": 1,
"arg1": "J86-1002.1",
"arg2": "J86-1002.2",
"reverse": false
},
{
"label": 4,
"arg1": "J86-1002.9",
"arg2": "J86-1002.11",
"reverse": false
}
] |
J86-3001 | Attention, Intentions, And The Structure Of Discourse |
In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse . In this theory, discourse structure is composed of three separate but interrelated components: the structure of the sequence of utterances (called the linguistic structure ), a structure of pu... | [
{
"id": "J86-3001.1",
"char_start": 34,
"char_end": 63
},
{
"id": "J86-3001.2",
"char_start": 90,
"char_end": 97
},
{
"id": "J86-3001.3",
"char_start": 102,
"char_end": 112
},
{
"id": "J86-3001.4",
"char_start": 116,
"char_end": 125
},
{
"id": "J86... | [
{
"label": 2,
"arg1": "J86-3001.3",
"arg2": "J86-3001.4",
"reverse": false
},
{
"label": 3,
"arg1": "J86-3001.6",
"arg2": "J86-3001.7",
"reverse": true
},
{
"label": 3,
"arg1": "J86-3001.8",
"arg2": "J86-3001.9",
"reverse": true
},
{
"label": 3,
"a... |
J86-4002 | REFERENCE IDENTIFICATION AND REFERENCE IDENTIFICATION FAILURES |
The goal of this work is the enrichment of human-machine interactions in a natural language environment . Because a speaker and listener cannot be assured to have the same beliefs , contexts , perceptions , backgrounds , or goals , at each point in a conversation , difficulties and mistakes arise when a listener int... | [
{
"id": "J86-4002.1",
"char_start": 46,
"char_end": 72
},
{
"id": "J86-4002.2",
"char_start": 78,
"char_end": 106
},
{
"id": "J86-4002.3",
"char_start": 119,
"char_end": 126
},
{
"id": "J86-4002.4",
"char_start": 131,
"char_end": 139
},
{
"id": "J8... | [
{
"label": 3,
"arg1": "J86-4002.1",
"arg2": "J86-4002.2",
"reverse": true
},
{
"label": 6,
"arg1": "J86-4002.3",
"arg2": "J86-4002.4",
"reverse": false
}
] |
P86-1011 | The Relationship Between Tree Adjoining Grammars And Head Grammars |
We examine the relationship between the two grammatical formalisms : Tree Adjoining Grammars and Head Grammars . We briefly investigate the weak equivalence of the two formalisms . We then turn to a discussion comparing the linguistic expressiveness of the two formalisms . | [
{
"id": "P86-1011.1",
"char_start": 47,
"char_end": 69
},
{
"id": "P86-1011.2",
"char_start": 72,
"char_end": 95
},
{
"id": "P86-1011.3",
"char_start": 100,
"char_end": 113
},
{
"id": "P86-1011.4",
"char_start": 148,
"char_end": 159
},
{
"id": "P86... | [
{
"label": 6,
"arg1": "P86-1011.2",
"arg2": "P86-1011.3",
"reverse": false
},
{
"label": 3,
"arg1": "P86-1011.4",
"arg2": "P86-1011.5",
"reverse": false
},
{
"label": 3,
"arg1": "P86-1011.6",
"arg2": "P86-1011.7",
"reverse": false
}
] |
P86-1038 | A LOGICAL SEMANTICS FOR FEATURE STRUCTURES |
Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects . Although computational algorithms for unification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description of feature ... | [
{
"id": "P86-1038.1",
"char_start": 3,
"char_end": 39
},
{
"id": "P86-1038.2",
"char_start": 74,
"char_end": 82
},
{
"id": "P86-1038.3",
"char_start": 95,
"char_end": 113
},
{
"id": "P86-1038.4",
"char_start": 125,
"char_end": 187
},
{
"id": "P86-1... | [
{
"label": 3,
"arg1": "P86-1038.2",
"arg2": "P86-1038.3",
"reverse": false
},
{
"label": 3,
"arg1": "P86-1038.7",
"arg2": "P86-1038.8",
"reverse": false
},
{
"label": 4,
"arg1": "P86-1038.11",
"arg2": "P86-1038.12",
"reverse": false
},
{
"label": 3,
... |
A88-1001 | The Multimedia Articulation of Answers in a Natural Language Database Query System |
This paper describes a domain independent strategy for the multimedia articulation of answers elicited by a natural language interface to database query applications . Multimedia answers include videodisc images and heuristically-produced complete sentences in text or text-to-speech form . Deictic reference and feed... | [
{
"id": "A88-1001.1",
"char_start": 62,
"char_end": 96
},
{
"id": "A88-1001.2",
"char_start": 111,
"char_end": 137
},
{
"id": "A88-1001.3",
"char_start": 141,
"char_end": 168
},
{
"id": "A88-1001.4",
"char_start": 171,
"char_end": 189
},
{
"id": "A... | [
{
"label": 6,
"arg1": "A88-1001.7",
"arg2": "A88-1001.8",
"reverse": false
},
{
"label": 3,
"arg1": "A88-1001.10",
"arg2": "A88-1001.11",
"reverse": false
}
] |
A88-1003 | An Architecture for Anaphora Resolution |
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 a blackb... | [
{
"id": "A88-1003.1",
"char_start": 34,
"char_end": 71
},
{
"id": "A88-1003.2",
"char_start": 75,
"char_end": 79
},
{
"id": "A88-1003.3",
"char_start": 93,
"char_end": 121
},
{
"id": "A88-1003.4",
"char_start": 227,
"char_end": 246
},
{
"id": "A88-... | [
{
"label": 4,
"arg1": "A88-1003.1",
"arg2": "A88-1003.2",
"reverse": false
},
{
"label": 4,
"arg1": "A88-1003.5",
"arg2": "A88-1003.6",
"reverse": true
}
] |
C88-1007 | Machine Translation Using Isomorphic UCGs |
This paper discusses the application of Unification Categorial Grammar (UCG) to the framework of Isomorphic Grammars for Machine Translation pioneered by Landsbergen. The Isomorphic Grammars approach to MT involves developing the grammars of the Source and Target languages in parallel, in order to ensure that SL and... | [
{
"id": "C88-1007.1",
"char_start": 43,
"char_end": 79
},
{
"id": "C88-1007.2",
"char_start": 100,
"char_end": 119
},
{
"id": "C88-1007.3",
"char_start": 124,
"char_end": 143
},
{
"id": "C88-1007.4",
"char_start": 174,
"char_end": 208
},
{
"id": "C... | [
{
"label": 1,
"arg1": "C88-1007.1",
"arg2": "C88-1007.3",
"reverse": false
},
{
"label": 3,
"arg1": "C88-1007.5",
"arg2": "C88-1007.6",
"reverse": false
},
{
"label": 6,
"arg1": "C88-1007.7",
"arg2": "C88-1007.8",
"reverse": false
},
{
"label": 6,
... |
C88-1044 | On the Generation and Interpretation of Demonstrative Expressions |
This paper presents necessary and sufficient conditions for the use of demonstrative expressions in English and discusses implications for current discourse processing algorithms . We examine a broad range of texts to show how the distribution of demonstrative forms and functions is genre dependent . This research i... | [
{
"id": "C88-1044.1",
"char_start": 74,
"char_end": 99
},
{
"id": "C88-1044.2",
"char_start": 103,
"char_end": 110
},
{
"id": "C88-1044.3",
"char_start": 150,
"char_end": 181
},
{
"id": "C88-1044.4",
"char_start": 212,
"char_end": 217
},
{
"id": "C... | [
{
"label": 4,
"arg1": "C88-1044.1",
"arg2": "C88-1044.2",
"reverse": false
},
{
"label": 4,
"arg1": "C88-1044.4",
"arg2": "C88-1044.5",
"reverse": true
}
] |
C88-1066 | Parsing with Category Coocurrence Restrictions |
This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes two parsing algorithms that interpret it. CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalism... | [
{
"id": "C88-1066.1",
"char_start": 42,
"char_end": 83
},
{
"id": "C88-1066.2",
"char_start": 102,
"char_end": 120
},
{
"id": "C88-1066.3",
"char_start": 140,
"char_end": 144
},
{
"id": "C88-1066.4",
"char_start": 149,
"char_end": 167
},
{
"id": "C... | [
{
"label": 3,
"arg1": "C88-1066.4",
"arg2": "C88-1066.5",
"reverse": false
},
{
"label": 3,
"arg1": "C88-1066.10",
"arg2": "C88-1066.11",
"reverse": true
},
{
"label": 6,
"arg1": "C88-1066.12",
"arg2": "C88-1066.13",
"reverse": false
},
{
"label": 3,
... |
C88-2086 | Solving Some Persistent Presupposition Problems |
Soames 1979 provides some counterexamples to the theory of natural language presuppositions that is presented in Gazdar 1979. Soames 1982 provides a theory which explains these counterexamples. Mercer 1987 rejects the solution found in Soames 1982 leaving these counterexamples unexplained. By reappraising these insi... | [
{
"id": "C88-2086.1",
"char_start": 52,
"char_end": 94
},
{
"id": "C88-2086.2",
"char_start": 348,
"char_end": 403
},
{
"id": "C88-2086.3",
"char_start": 490,
"char_end": 513
},
{
"id": "C88-2086.4",
"char_start": 523,
"char_end": 532
}
] | [
{
"label": 3,
"arg1": "C88-2086.3",
"arg2": "C88-2086.4",
"reverse": false
}
] |
C88-2130 | Directing the Generation of Living Space Descriptions |
We have developed a computational model of the process of describing the layout of an apartment or house, a much-studied discourse task first characterized linguistically by Linde (1974). The model is embodied in a program, APT , that can reproduce segments of actual tape-recorded descriptions, using organizational ... | [
{
"id": "C88-2130.1",
"char_start": 23,
"char_end": 42
},
{
"id": "C88-2130.2",
"char_start": 124,
"char_end": 138
},
{
"id": "C88-2130.3",
"char_start": 195,
"char_end": 200
},
{
"id": "C88-2130.4",
"char_start": 227,
"char_end": 230
},
{
"id": "C... | [
{
"label": 1,
"arg1": "C88-2130.1",
"arg2": "C88-2130.2",
"reverse": false
},
{
"label": 4,
"arg1": "C88-2130.3",
"arg2": "C88-2130.4",
"reverse": false
}
] |
C88-2132 | Island Parsing and Bidirectional Charts |
Chart parsing is directional in the sense that it works from the starting point (usually the beginning of the sentence) extending its activity usually in a rightward manner. We shall introduce the concept of a chart that works outward from islands and makes sense of as much of the sentence as it is actually possible... | [
{
"id": "C88-2132.1",
"char_start": 3,
"char_end": 16
},
{
"id": "C88-2132.2",
"char_start": 20,
"char_end": 31
},
{
"id": "C88-2132.3",
"char_start": 213,
"char_end": 218
},
{
"id": "C88-2132.4",
"char_start": 243,
"char_end": 250
},
{
"id": "C88-... | [
{
"label": 4,
"arg1": "C88-2132.7",
"arg2": "C88-2132.8",
"reverse": false
}
] |
C88-2160 | Interactive Translation : a new approach |
A new approach for Interactive Machine Translation where the author interacts during the creation or the modification of the document is proposed. The explanation of an ambiguity or an error for the purposes of correction does not use any concepts of the underlying linguistic theory : it is a reformulation of the er... | [
{
"id": "C88-2160.1",
"char_start": 22,
"char_end": 53
},
{
"id": "C88-2160.2",
"char_start": 64,
"char_end": 70
},
{
"id": "C88-2160.3",
"char_start": 128,
"char_end": 136
},
{
"id": "C88-2160.4",
"char_start": 172,
"char_end": 181
},
{
"id": "C88... | [
{
"label": 2,
"arg1": "C88-2160.9",
"arg2": "C88-2160.10",
"reverse": true
},
{
"label": 3,
"arg1": "C88-2160.11",
"arg2": "C88-2160.12",
"reverse": false
}
] |
C88-2162 | NETL: A System for Representing and Using Real-World Knowledge |
Computer programs so far have not fared well in modeling language acquisition . For one thing, learning methodology applicable in general domains does not readily lend itself in the linguistic domain . For another, linguistic representation used by language processing systems is not geared to learning . We introduce... | [
{
"id": "C88-2162.1",
"char_start": 51,
"char_end": 80
},
{
"id": "C88-2162.2",
"char_start": 98,
"char_end": 118
},
{
"id": "C88-2162.3",
"char_start": 133,
"char_end": 148
},
{
"id": "C88-2162.4",
"char_start": 185,
"char_end": 202
},
{
"id": "C8... | [
{
"label": 6,
"arg1": "C88-2162.3",
"arg2": "C88-2162.4",
"reverse": false
},
{
"label": 1,
"arg1": "C88-2162.5",
"arg2": "C88-2162.6",
"reverse": false
},
{
"label": 1,
"arg1": "C88-2162.9",
"arg2": "C88-2162.10",
"reverse": false
},
{
"label": 4,
... |
C88-2166 | COMPLEX: A Computational Lexicon for Natural Language Systems |
Although every natural language system needs a computational lexicon , each system puts different amounts and types of information into its lexicon according to its individual needs. However, some of the information needed across systems is shared or identical information. This paper presents our experience in plann... | [
{
"id": "C88-2166.1",
"char_start": 18,
"char_end": 41
},
{
"id": "C88-2166.2",
"char_start": 50,
"char_end": 71
},
{
"id": "C88-2166.3",
"char_start": 143,
"char_end": 150
},
{
"id": "C88-2166.4",
"char_start": 337,
"char_end": 344
},
{
"id": "C88... | [
{
"label": 1,
"arg1": "C88-2166.1",
"arg2": "C88-2166.2",
"reverse": true
},
{
"label": 4,
"arg1": "C88-2166.5",
"arg2": "C88-2166.6",
"reverse": true
},
{
"label": 1,
"arg1": "C88-2166.8",
"arg2": "C88-2166.9",
"reverse": false
}
] |
J88-3002 | MODELING THE USER IN NATURAL LANGUAGE SYSTEMS |
For intelligent interactive systems to communicate with humans in a natural manner, they must have knowledge about the system users . This paper explores the role of user modeling in such systems . It begins with a characterization of what a user model is and how it can be used. The types of information that a user ... | [
{
"id": "J88-3002.1",
"char_start": 7,
"char_end": 38
},
{
"id": "J88-3002.2",
"char_start": 59,
"char_end": 65
},
{
"id": "J88-3002.3",
"char_start": 122,
"char_end": 134
},
{
"id": "J88-3002.4",
"char_start": 169,
"char_end": 182
},
{
"id": "J88-... | [
{
"label": 2,
"arg1": "J88-3002.4",
"arg2": "J88-3002.5",
"reverse": false
},
{
"label": 3,
"arg1": "J88-3002.7",
"arg2": "J88-3002.8",
"reverse": false
},
{
"label": 4,
"arg1": "J88-3002.10",
"arg2": "J88-3002.11",
"reverse": false
}
] |
C90-1013 | Generation for Dialogue Translation Using Typed Feature Structure Unification |
This article introduces a bidirectional grammar generation system called feature structure-directed generation , developed for a dialogue translation system . The system utilizes typed feature structures to control the top-down derivation in a declarative way. This generation system also uses disjunctive feature str... | [
{
"id": "C90-1013.1",
"char_start": 29,
"char_end": 68
},
{
"id": "C90-1013.2",
"char_start": 76,
"char_end": 113
},
{
"id": "C90-1013.3",
"char_start": 132,
"char_end": 159
},
{
"id": "C90-1013.4",
"char_start": 182,
"char_end": 206
},
{
"id": "C9... | [
{
"label": 1,
"arg1": "C90-1013.2",
"arg2": "C90-1013.3",
"reverse": false
},
{
"label": 1,
"arg1": "C90-1013.4",
"arg2": "C90-1013.5",
"reverse": false
},
{
"label": 1,
"arg1": "C90-1013.6",
"arg2": "C90-1013.7",
"reverse": true
},
{
"label": 1,
"... |
C90-2032 | Sentence disambiguation by document preference sets oriented |
This paper proposes document oriented preference sets(DoPS) for the disambiguation of the dependency structure of sentences . The DoPS system extracts preference knowledge from a target document or other documents automatically. Sentence ambiguities can be resolved by using domain targeted preference knowledge witho... | [
{
"id": "C90-2032.1",
"char_start": 23,
"char_end": 62
},
{
"id": "C90-2032.2",
"char_start": 93,
"char_end": 113
},
{
"id": "C90-2032.3",
"char_start": 117,
"char_end": 126
},
{
"id": "C90-2032.4",
"char_start": 133,
"char_end": 144
},
{
"id": "C9... | [
{
"label": 3,
"arg1": "C90-2032.2",
"arg2": "C90-2032.3",
"reverse": false
},
{
"label": 1,
"arg1": "C90-2032.4",
"arg2": "C90-2032.5",
"reverse": false
},
{
"label": 3,
"arg1": "C90-2032.11",
"arg2": "C90-2032.12",
"reverse": false
}
] |
C90-3014 | A phonological knowledge base system using unification-based formalism: a case study of Korean phonology |
This paper describes the framework of a Korean phonological knowledge base system using the unification-based grammar formalism : Korean Phonology Structure Grammar (KPSG) . The approach of KPSG provides an explicit development model for constructing a computational phonological system : speech recognition and synth... | [
{
"id": "C90-3014.1",
"char_start": 43,
"char_end": 84
},
{
"id": "C90-3014.2",
"char_start": 95,
"char_end": 130
},
{
"id": "C90-3014.3",
"char_start": 133,
"char_end": 174
},
{
"id": "C90-3014.4",
"char_start": 193,
"char_end": 197
},
{
"id": "C9... | [
{
"label": 1,
"arg1": "C90-3014.1",
"arg2": "C90-3014.2",
"reverse": true
},
{
"label": 1,
"arg1": "C90-3014.4",
"arg2": "C90-3014.5",
"reverse": false
}
] |
C90-3045 | Synchronous Tree-Adjoining Grammars |
The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax , for instance, to the task of semantic interpretation or automatic translation of natural language . We present a variant of TAGs , called synchronous TAGs , which characteriz... | [
{
"id": "C90-3045.1",
"char_start": 28,
"char_end": 57
},
{
"id": "C90-3045.2",
"char_start": 101,
"char_end": 105
},
{
"id": "C90-3045.3",
"char_start": 137,
"char_end": 143
},
{
"id": "C90-3045.4",
"char_start": 175,
"char_end": 198
},
{
"id": "C... | [
{
"label": 6,
"arg1": "C90-3045.3",
"arg2": "C90-3045.4",
"reverse": false
},
{
"label": 3,
"arg1": "C90-3045.10",
"arg2": "C90-3045.11",
"reverse": true
},
{
"label": 3,
"arg1": "C90-3045.12",
"arg2": "C90-3045.13",
"reverse": false
},
{
"label": 1,
... |
C90-3046 | Japanese Sentence Analysis as Argumentation |
This paper proposes that sentence analysis should be treated as defeasible reasoning , and presents such a treatment for Japanese sentence analyses using an argumentation system by Konolige, which is a formalization of defeasible reasoning , that includes arguments and defeat rules that capture defeasibility . | [
{
"id": "C90-3046.1",
"char_start": 28,
"char_end": 45
},
{
"id": "C90-3046.2",
"char_start": 67,
"char_end": 87
},
{
"id": "C90-3046.3",
"char_start": 124,
"char_end": 150
},
{
"id": "C90-3046.4",
"char_start": 160,
"char_end": 180
},
{
"id": "C90... | [
{
"label": 3,
"arg1": "C90-3046.1",
"arg2": "C90-3046.2",
"reverse": false
},
{
"label": 1,
"arg1": "C90-3046.3",
"arg2": "C90-3046.4",
"reverse": true
},
{
"label": 3,
"arg1": "C90-3046.5",
"arg2": "C90-3046.6",
"reverse": false
},
{
"label": 3,
"... |
C90-3072 | Spelling-checking for Highly Inflective Languages |
Spelling-checkers have become an integral part of most text processing software . From different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead of words . This approach is sufficient for languages with little inflection such as English , but fails fo... | [
{
"id": "C90-3072.1",
"char_start": 3,
"char_end": 20
},
{
"id": "C90-3072.2",
"char_start": 58,
"char_end": 82
},
{
"id": "C90-3072.3",
"char_start": 179,
"char_end": 205
},
{
"id": "C90-3072.4",
"char_start": 217,
"char_end": 222
},
{
"id": "C90-... | [
{
"label": 4,
"arg1": "C90-3072.1",
"arg2": "C90-3072.2",
"reverse": false
},
{
"label": 6,
"arg1": "C90-3072.3",
"arg2": "C90-3072.4",
"reverse": false
},
{
"label": 3,
"arg1": "C90-3072.5",
"arg2": "C90-3072.6",
"reverse": false
},
{
"label": 3,
... |
H90-1016 | Toward a Real-Time Spoken Language System Using Commercial Hardware |
We describe the methods and hardware that we are using to produce a real-time demonstration of an integrated Spoken Language System . We describe algorithms that greatly reduce the computation needed to compute the N-Best sentence hypotheses . To avoid grammar coverage problems we use a fully-connected first-order s... | [
{
"id": "H90-1016.1",
"char_start": 101,
"char_end": 134
},
{
"id": "H90-1016.2",
"char_start": 218,
"char_end": 244
},
{
"id": "H90-1016.3",
"char_start": 256,
"char_end": 281
},
{
"id": "H90-1016.4",
"char_start": 291,
"char_end": 344
},
{
"id": ... | [
{
"label": 1,
"arg1": "H90-1016.3",
"arg2": "H90-1016.4",
"reverse": true
},
{
"label": 3,
"arg1": "H90-1016.6",
"arg2": "H90-1016.7",
"reverse": true
},
{
"label": 4,
"arg1": "H90-1016.11",
"arg2": "H90-1016.12",
"reverse": false
}
] |
H90-1060 | A New Paradigm for Speaker-Independent Training and Speaker Adaptation |
This paper reports on two contributions to large vocabulary continuous speech recognition . First, we present a new paradigm for speaker-independent (SI) training of hidden Markov models (HMM) , which uses a large amount of speech from a few speakers instead of the traditional practice of using a little speech from ... | [
{
"id": "H90-1060.1",
"char_start": 46,
"char_end": 92
},
{
"id": "H90-1060.2",
"char_start": 132,
"char_end": 165
},
{
"id": "H90-1060.3",
"char_start": 169,
"char_end": 195
},
{
"id": "H90-1060.4",
"char_start": 227,
"char_end": 233
},
{
"id": "H... | [
{
"label": 1,
"arg1": "H90-1060.2",
"arg2": "H90-1060.4",
"reverse": true
},
{
"label": 6,
"arg1": "H90-1060.9",
"arg2": "H90-1060.11",
"reverse": false
},
{
"label": 2,
"arg1": "H90-1060.14",
"arg2": "H90-1060.16",
"reverse": false
},
{
"label": 4,
... |
J90-3002 | AN EDITOR FOR THE EXPLANATORY AND COMBINATORY DICTIONARY OF CONTEMPORARY FRENCH (DECFC) |
This paper presents a specialized editor for a highly structured dictionary . The basic goal in building that editor was to provide an adequate tool to help lexicologists produce a valid and coherent dictionary on the basis of a linguistic theory . If we want valuable lexicons and grammars to achieve complex natural... | [
{
"id": "J90-3002.1",
"char_start": 37,
"char_end": 43
},
{
"id": "J90-3002.2",
"char_start": 68,
"char_end": 78
},
{
"id": "J90-3002.3",
"char_start": 113,
"char_end": 119
},
{
"id": "J90-3002.4",
"char_start": 160,
"char_end": 173
},
{
"id": "J90... | [
{
"label": 1,
"arg1": "J90-3002.1",
"arg2": "J90-3002.2",
"reverse": false
},
{
"label": 1,
"arg1": "J90-3002.3",
"arg2": "J90-3002.4",
"reverse": false
},
{
"label": 1,
"arg1": "J90-3002.5",
"arg2": "J90-3002.6",
"reverse": true
},
{
"label": 1,
"... |
P90-1014 | Free Indexation: Combinatorial Analysis and A Compositional Algorithm |
The principle known as free indexation plays an important role in the determination of the referential properties of noun phrases in the principle-and-parameters language framework . First, by investigating the combinatorics of free indexation , we show that the problem of enumerating all possible indexings requires... | [
{
"id": "P90-1014.1",
"char_start": 26,
"char_end": 41
},
{
"id": "P90-1014.2",
"char_start": 94,
"char_end": 132
},
{
"id": "P90-1014.3",
"char_start": 140,
"char_end": 183
},
{
"id": "P90-1014.4",
"char_start": 231,
"char_end": 246
},
{
"id": "P9... | [
{
"label": 2,
"arg1": "P90-1014.1",
"arg2": "P90-1014.2",
"reverse": false
}
] |
A92-1026 | Robust Processing of Real-World Natural-Language Texts |
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 analysis can b... | [
{
"id": "A92-1026.1",
"char_start": 33,
"char_end": 60
},
{
"id": "A92-1026.2",
"char_start": 194,
"char_end": 201
},
{
"id": "A92-1026.3",
"char_start": 222,
"char_end": 238
},
{
"id": "A92-1026.4",
"char_start": 282,
"char_end": 314
},
{
"id": "A... | [
{
"label": 1,
"arg1": "A92-1026.5",
"arg2": "A92-1026.6",
"reverse": true
},
{
"label": 1,
"arg1": "A92-1026.9",
"arg2": "A92-1026.10",
"reverse": true
}
] |
A92-1027 | An Efficient Chart-based Algorithm for Partial-Parsing of 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 efficiency through... | [
{
"id": "A92-1027.1",
"char_start": 41,
"char_end": 77
},
{
"id": "A92-1027.2",
"char_start": 81,
"char_end": 97
},
{
"id": "A92-1027.3",
"char_start": 170,
"char_end": 188
},
{
"id": "A92-1027.4",
"char_start": 207,
"char_end": 212
},
{
"id": "A92... | [
{
"label": 1,
"arg1": "A92-1027.1",
"arg2": "A92-1027.2",
"reverse": false
},
{
"label": 4,
"arg1": "A92-1027.3",
"arg2": "A92-1027.4",
"reverse": true
},
{
"label": 6,
"arg1": "A92-1027.11",
"arg2": "A92-1027.12",
"reverse": false
},
{
"label": 1,
... |
C92-1052 | Temporal Structure of Discourse |
In this paper discourse segments are defined and a method for discourse segmentation primarily based on abduction of temporal relations between segments is proposed. This method is precise and computationally feasible and is supported by previous work in the area of temporal anaphora resolution . | [
{
"id": "C92-1052.1",
"char_start": 17,
"char_end": 35
},
{
"id": "C92-1052.2",
"char_start": 65,
"char_end": 87
},
{
"id": "C92-1052.3",
"char_start": 107,
"char_end": 116
},
{
"id": "C92-1052.4",
"char_start": 120,
"char_end": 138
},
{
"id": "C92... | [
{
"label": 1,
"arg1": "C92-1052.2",
"arg2": "C92-1052.3",
"reverse": true
},
{
"label": 3,
"arg1": "C92-1052.4",
"arg2": "C92-1052.5",
"reverse": false
}
] |
C92-1055 | Syntactic Ambiguity Resolution Using A Discrimination and Robustness Oriented Adaptive Learning Algorithm |
In this paper, a discrimination and robustness oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution . Owing to the problem of insufficient training data and approximation error introduced by the language model , traditional statistical approaches , which resolve am... | [
{
"id": "C92-1055.1",
"char_start": 59,
"char_end": 86
},
{
"id": "C92-1055.2",
"char_start": 124,
"char_end": 154
},
{
"id": "C92-1055.3",
"char_start": 181,
"char_end": 207
},
{
"id": "C92-1055.4",
"char_start": 212,
"char_end": 231
},
{
"id": "C... | [
{
"label": 1,
"arg1": "C92-1055.1",
"arg2": "C92-1055.2",
"reverse": false
},
{
"label": 2,
"arg1": "C92-1055.4",
"arg2": "C92-1055.5",
"reverse": true
},
{
"label": 1,
"arg1": "C92-1055.6",
"arg2": "C92-1055.8",
"reverse": true
},
{
"label": 2,
"a... |
C92-2068 | Quasi-Destructive Graph Unification with Structure-Sharing |
Graph unification remains the most expensive part of unification-based grammar parsing . We focus on one speed-up element in the design of unification algorithms : avoidance of copying of unmodified subgraphs . We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) o... | [
{
"id": "C92-2068.1",
"char_start": 3,
"char_end": 20
},
{
"id": "C92-2068.2",
"char_start": 56,
"char_end": 89
},
{
"id": "C92-2068.3",
"char_start": 142,
"char_end": 164
},
{
"id": "C92-2068.4",
"char_start": 180,
"char_end": 187
},
{
"id": "C92-... | [
{
"label": 4,
"arg1": "C92-2068.1",
"arg2": "C92-2068.2",
"reverse": false
},
{
"label": 3,
"arg1": "C92-2068.7",
"arg2": "C92-2068.8",
"reverse": false
}
] |
C92-2115 | A Similarity-Driven Transfer System |
The transfer phase in machine translation (MT) systems has been considered to be more complicated than analysis and generation , since it is inherently a conglomeration of individual lexical rules . Currently some attempts are being made to use case-based reasoning in machine translation , that is, to make decisions... | [
{
"id": "C92-2115.1",
"char_start": 7,
"char_end": 21
},
{
"id": "C92-2115.2",
"char_start": 25,
"char_end": 57
},
{
"id": "C92-2115.3",
"char_start": 106,
"char_end": 114
},
{
"id": "C92-2115.4",
"char_start": 119,
"char_end": 129
},
{
"id": "C92-... | [
{
"label": 6,
"arg1": "C92-2115.1",
"arg2": "C92-2115.3",
"reverse": false
},
{
"label": 1,
"arg1": "C92-2115.6",
"arg2": "C92-2115.7",
"reverse": false
},
{
"label": 1,
"arg1": "C92-2115.11",
"arg2": "C92-2115.12",
"reverse": false
}
] |
C92-3165 | Interactive Speech Understanding |
This paper introduces a robust interactive method for speech understanding . The generalized LR parsing is enhanced in this approach. Parsing proceeds from left to right correcting minor errors. When a very noisy portion is detected, the parser skips that portion using a fake non-terminal symbol . The unidentified p... | [
{
"id": "C92-3165.1",
"char_start": 34,
"char_end": 77
},
{
"id": "C92-3165.2",
"char_start": 84,
"char_end": 106
},
{
"id": "C92-3165.3",
"char_start": 137,
"char_end": 144
},
{
"id": "C92-3165.4",
"char_start": 216,
"char_end": 223
},
{
"id": "C9... | [
{
"label": 1,
"arg1": "C92-3165.5",
"arg2": "C92-3165.7",
"reverse": true
},
{
"label": 3,
"arg1": "C92-3165.11",
"arg2": "C92-3165.12",
"reverse": false
},
{
"label": 4,
"arg1": "C92-3165.16",
"arg2": "C92-3165.17",
"reverse": false
}
] |
C92-4199 | Recognizing Unregistered Names for Mandarin Word Identification |
Word Identification has been an important and active issue in Chinese Natural Language Processing . In this paper, a new mechanism, based on the concept of sublanguage , is proposed for identifying unknown words , especially personal names , in Chinese newspapers . The proposed mechanism includes title-driven name r... | [
{
"id": "C92-4199.1",
"char_start": 3,
"char_end": 22
},
{
"id": "C92-4199.2",
"char_start": 65,
"char_end": 100
},
{
"id": "C92-4199.3",
"char_start": 159,
"char_end": 170
},
{
"id": "C92-4199.4",
"char_start": 201,
"char_end": 214
},
{
"id": "C92... | [
{
"label": 1,
"arg1": "C92-4199.3",
"arg2": "C92-4199.4",
"reverse": false
},
{
"label": 4,
"arg1": "C92-4199.5",
"arg2": "C92-4199.6",
"reverse": false
}
] |
C92-4207 | Reconstructing Spatial Image from Natural Language Texts |
This paper describes the understanding process of the spatial descriptions in Japanese . In order to understand the described world , the authors try to reconstruct the geometric model of the global scene from the scenic descriptions drawing a space. It is done by an experimental computer program SPRINT , which take... | [
{
"id": "C92-4207.1",
"char_start": 57,
"char_end": 77
},
{
"id": "C92-4207.2",
"char_start": 81,
"char_end": 89
},
{
"id": "C92-4207.3",
"char_start": 129,
"char_end": 134
},
{
"id": "C92-4207.4",
"char_start": 284,
"char_end": 300
},
{
"id": "C92... | [
{
"label": 4,
"arg1": "C92-4207.1",
"arg2": "C92-4207.2",
"reverse": false
},
{
"label": 3,
"arg1": "C92-4207.7",
"arg2": "C92-4207.8",
"reverse": false
},
{
"label": 4,
"arg1": "C92-4207.10",
"arg2": "C92-4207.11",
"reverse": false
},
{
"label": 3,
... |
H92-1003 | Multi-Site Data Collection for a Spoken Language Corpus: MADCOW |
This paper describes a recently collected spoken language corpus for the ATIS (Air Travel Information System) domain . This data collection effort has been co-ordinated by MADCOW (Multi-site ATIS Data COllection Working group) . We summarize the motivation for this effort, the goals, the implementation of a multi-si... | [
{
"id": "H92-1003.1",
"char_start": 45,
"char_end": 67
},
{
"id": "H92-1003.2",
"char_start": 76,
"char_end": 119
},
{
"id": "H92-1003.3",
"char_start": 175,
"char_end": 229
},
{
"id": "H92-1003.4",
"char_start": 312,
"char_end": 347
},
{
"id": "H9... | [
{
"label": 3,
"arg1": "H92-1003.1",
"arg2": "H92-1003.2",
"reverse": true
},
{
"label": 3,
"arg1": "H92-1003.7",
"arg2": "H92-1003.8",
"reverse": true
}
] |
H92-1010 | Spoken Language Processing in the Framework of Human-Machine Communication at LIMSI |
The paper provides an overview of the research conducted at LIMSI in the field of speech processing , but also in the related areas of Human-Machine Communication , including Natural Language Processing , Non Verbal and Multimodal Communication . Also presented are the commercial applications of some of the research... | [
{
"id": "H92-1010.1",
"char_start": 63,
"char_end": 68
},
{
"id": "H92-1010.2",
"char_start": 85,
"char_end": 102
},
{
"id": "H92-1010.3",
"char_start": 138,
"char_end": 165
},
{
"id": "H92-1010.4",
"char_start": 178,
"char_end": 205
},
{
"id": "H9... | [
{
"label": 6,
"arg1": "H92-1010.2",
"arg2": "H92-1010.3",
"reverse": false
}
] |
H92-1016 | The MIT ATIS System: February 1992 Progress Report |
This paper describes the status of the MIT ATIS system as of February 1992, focusing especially on the changes made to the SUMMIT recognizer . These include context-dependent phonetic modelling , the use of a bigram language model in conjunction with a probabilistic LR parser , and refinements made to the lexicon . ... | [
{
"id": "H92-1016.1",
"char_start": 42,
"char_end": 57
},
{
"id": "H92-1016.2",
"char_start": 126,
"char_end": 143
},
{
"id": "H92-1016.3",
"char_start": 160,
"char_end": 196
},
{
"id": "H92-1016.4",
"char_start": 212,
"char_end": 233
},
{
"id": "H... | [] |
H92-1017 | Recent Improvements and Benchmark Results for Paramax ATIS System |
This paper describes three relatively domain-independent capabilities recently added to the Paramax spoken language understanding system : non-monotonic reasoning , implicit reference resolution , and database query paraphrase . In addition, we discuss the results of the February 1992 ATIS benchmark tests . We descr... | [
{
"id": "H92-1017.1",
"char_start": 41,
"char_end": 72
},
{
"id": "H92-1017.2",
"char_start": 95,
"char_end": 139
},
{
"id": "H92-1017.3",
"char_start": 142,
"char_end": 165
},
{
"id": "H92-1017.4",
"char_start": 168,
"char_end": 197
},
{
"id": "H9... | [
{
"label": 3,
"arg1": "H92-1017.1",
"arg2": "H92-1017.2",
"reverse": false
},
{
"label": 2,
"arg1": "H92-1017.8",
"arg2": "H92-1017.10",
"reverse": false
}
] |
H92-1026 | Towards History-based Grammars: Using Richer Models for Probabilistic Parsing |
We describe a generative probabilistic model of natural language , which we call HBG , that takes advantage of detailed linguistic information to resolve ambiguity . HBG incorporates lexical, syntactic, semantic, and structural information from the parse tree into the disambiguation process in a novel way. We use a... | [
{
"id": "H92-1026.1",
"char_start": 17,
"char_end": 67
},
{
"id": "H92-1026.2",
"char_start": 84,
"char_end": 87
},
{
"id": "H92-1026.3",
"char_start": 123,
"char_end": 145
},
{
"id": "H92-1026.4",
"char_start": 157,
"char_end": 166
},
{
"id": "H92... | [
{
"label": 1,
"arg1": "H92-1026.3",
"arg2": "H92-1026.4",
"reverse": false
},
{
"label": 1,
"arg1": "H92-1026.5",
"arg2": "H92-1026.6",
"reverse": true
},
{
"label": 3,
"arg1": "H92-1026.13",
"arg2": "H92-1026.14",
"reverse": false
},
{
"label": 1,
... |
H92-1036 | MAP Estimation of Continuous Density HMM: Theory and Applications |
We discuss maximum a posteriori estimation of continuous density hidden Markov models (CDHMM) . The classical MLE reestimation algorithms , namely the forward-backward algorithm and the segmental k-means algorithm , are expanded and reestimation formulas are given for HMM with Gaussian mixture observation densities ... | [
{
"id": "H92-1036.1",
"char_start": 14,
"char_end": 45
},
{
"id": "H92-1036.2",
"char_start": 49,
"char_end": 96
},
{
"id": "H92-1036.3",
"char_start": 113,
"char_end": 140
},
{
"id": "H92-1036.4",
"char_start": 154,
"char_end": 180
},
{
"id": "H92... | [
{
"label": 1,
"arg1": "H92-1036.6",
"arg2": "H92-1036.7",
"reverse": false
},
{
"label": 1,
"arg1": "H92-1036.8",
"arg2": "H92-1036.9",
"reverse": false
}
] |
H92-1045 | One Sense Per Discourse |
It is well-known that there are polysemous words like sentence whose meaning or sense depends on the context of use. We have recently reported on two new word-sense disambiguation systems , one trained on bilingual material (the Canadian Hansards ) and the other trained on monolingual material ( Roget's Thesaurus an... | [
{
"id": "H92-1045.1",
"char_start": 35,
"char_end": 51
},
{
"id": "H92-1045.2",
"char_start": 57,
"char_end": 65
},
{
"id": "H92-1045.3",
"char_start": 72,
"char_end": 79
},
{
"id": "H92-1045.4",
"char_start": 83,
"char_end": 88
},
{
"id": "H92-104... | [
{
"label": 3,
"arg1": "H92-1045.2",
"arg2": "H92-1045.3",
"reverse": true
},
{
"label": 1,
"arg1": "H92-1045.5",
"arg2": "H92-1045.6",
"reverse": true
},
{
"label": 4,
"arg1": "H92-1045.13",
"arg2": "H92-1045.14",
"reverse": false
},
{
"label": 4,
... |
P06-1112 | Exploring Correlation Of Dependency Relation Paths For Answer Extraction
|
In this paper, we explore correlation of dependency relation paths to rank candidate answers in answer extraction. Using the correlation measure, we compare dependency relations of a candidate answer and mapped question phrases in sentence with the corresponding relations in question. Different from previous studies, ... | [
{
"id": "P06-1112.1",
"char_start": 42,
"char_end": 67
},
{
"id": "P06-1112.2",
"char_start": 97,
"char_end": 114
},
{
"id": "P06-1112.3",
"char_start": 126,
"char_end": 145
},
{
"id": "P06-1112.4",
"char_start": 158,
"char_end": 178
},
{
"id": "P0... | [
{
"label": 1,
"arg1": "P06-1112.1",
"arg2": "P06-1112.2",
"reverse": false
},
{
"label": 3,
"arg1": "P06-1112.4",
"arg2": "P06-1112.5",
"reverse": false
},
{
"label": 4,
"arg1": "P06-1112.9",
"arg2": "P06-1112.10",
"reverse": false
}
] |
C90-3063 | Automatic Processing Of Large Corpora For The Resolution Of Anaphora References
|
Manual acquisition of semantic constraints in broad domains is very expensive. This paper presents an automatic scheme for collecting statistics on cooccurrence patterns in a large corpus. To a large extent, these statistics reflect semantic constraints and thus are used to disambiguate anaphora references and syntact... | [
{
"id": "C90-3063.1",
"char_start": 1,
"char_end": 19
},
{
"id": "C90-3063.2",
"char_start": 23,
"char_end": 43
},
{
"id": "C90-3063.3",
"char_start": 149,
"char_end": 170
},
{
"id": "C90-3063.4",
"char_start": 182,
"char_end": 188
},
{
"id": "C90-... | [
{
"label": 4,
"arg1": "C90-3063.3",
"arg2": "C90-3063.4",
"reverse": false
},
{
"label": 1,
"arg1": "C90-3063.5",
"arg2": "C90-3063.6",
"reverse": false
},
{
"label": 3,
"arg1": "C90-3063.8",
"arg2": "C90-3063.9",
"reverse": false
},
{
"label": 4,
... |
C04-1011 | Kullback-Leibler Distance Between Probabilistic Context-Free Grammars And Probabilistic Finite Automata
|
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-entropy. We di... | [
{
"id": "C04-1011.1",
"char_start": 42,
"char_end": 67
},
{
"id": "C04-1011.2",
"char_start": 85,
"char_end": 101
},
{
"id": "C04-1011.3",
"char_start": 113,
"char_end": 147
},
{
"id": "C04-1011.4",
"char_start": 154,
"char_end": 184
},
{
"id": "C0... | [
{
"label": 6,
"arg1": "C04-1011.3",
"arg2": "C04-1011.4",
"reverse": false
},
{
"label": 4,
"arg1": "C04-1011.6",
"arg2": "C04-1011.7",
"reverse": true
},
{
"label": 1,
"arg1": "C04-1011.8",
"arg2": "C04-1011.10",
"reverse": true
}
] |
A94-1037 | Spelling Correction In Agglutinative Languages
|
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-programming based ... | [
{
"id": "A94-1037.1",
"char_start": 23,
"char_end": 42
},
{
"id": "A94-1037.2",
"char_start": 47,
"char_end": 56
},
{
"id": "A94-1037.3",
"char_start": 62,
"char_end": 69
},
{
"id": "A94-1037.4",
"char_start": 142,
"char_end": 165
},
{
"id": "A94-1... | [
{
"label": 1,
"arg1": "A94-1037.1",
"arg2": "A94-1037.2",
"reverse": false
},
{
"label": 1,
"arg1": "A94-1037.5",
"arg2": "A94-1037.6",
"reverse": false
},
{
"label": 1,
"arg1": "A94-1037.9",
"arg2": "A94-1037.10",
"reverse": false
}
] |
H94-1102 | Robust Continuous Speech Recognition Technology Program Summary
|
The major objective of this program is to develop and demonstrate robust, high performance continuous speech recognition (CSR) techniques focussed on application in Spoken Language Systems (SLS) which will enhance the effectiveness of military and civilian computer-based systems. A key complementary objective is to de... | [
{
"id": "H94-1102.1",
"char_start": 92,
"char_end": 138
},
{
"id": "H94-1102.2",
"char_start": 166,
"char_end": 195
},
{
"id": "H94-1102.3",
"char_start": 236,
"char_end": 280
},
{
"id": "H94-1102.4",
"char_start": 360,
"char_end": 404
},
{
"id": "... | [
{
"label": 1,
"arg1": "H94-1102.1",
"arg2": "H94-1102.2",
"reverse": false
},
{
"label": 1,
"arg1": "H94-1102.5",
"arg2": "H94-1102.6",
"reverse": false
},
{
"label": 1,
"arg1": "H94-1102.7",
"arg2": "H94-1102.8",
"reverse": false
},
{
"label": 1,
... |
P98-1118 | A Framework for Customizable Generation of Hypertext Presentations
|
In this paper, we present a framework, Presentor, for the development and customization of hypertext presentation generators. Presentor offers intuitive and powerful declarative languages specifying the presentation at different levels: macro-planning, micro-planning, realization, and formatting. Presentor is implemen... | [
{
"id": "P98-1118.1",
"char_start": 40,
"char_end": 49
},
{
"id": "P98-1118.2",
"char_start": 92,
"char_end": 125
},
{
"id": "P98-1118.3",
"char_start": 127,
"char_end": 136
},
{
"id": "P98-1118.4",
"char_start": 167,
"char_end": 188
},
{
"id": "P9... | [
{
"label": 4,
"arg1": "P98-1118.3",
"arg2": "P98-1118.4",
"reverse": true
}
] |
A92-1023 | A Practical Methodology For The Evaluation Of Spoken Language Systems
|
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 evaluatio... | [
{
"id": "A92-1023.1",
"char_start": 270,
"char_end": 293
},
{
"id": "A92-1023.2",
"char_start": 445,
"char_end": 477
},
{
"id": "A92-1023.3",
"char_start": 496,
"char_end": 521
},
{
"id": "A92-1023.4",
"char_start": 657,
"char_end": 700
},
{
"id": ... | [
{
"label": 5,
"arg1": "A92-1023.4",
"arg2": "A92-1023.5",
"reverse": false
},
{
"label": 5,
"arg1": "A92-1023.7",
"arg2": "A92-1023.8",
"reverse": true
},
{
"label": 1,
"arg1": "A92-1023.9",
"arg2": "A92-1023.10",
"reverse": false
}
] |
P06-1053 | Integrating Syntactic Priming Into An Incremental Probabilistic Parser, With An Application To Psycholinguistic Modeling
|
The psycholinguistic literature provides evidence for syntactic priming, i.e., the tendency to repeat structures. This paper describes a method for incorporating priming into an incremental probabilistic parser. Three models are compared, which involve priming of rules between sentences, within sentences, and within c... | [
{
"id": "P06-1053.1",
"char_start": 5,
"char_end": 32
},
{
"id": "P06-1053.2",
"char_start": 55,
"char_end": 72
},
{
"id": "P06-1053.3",
"char_start": 163,
"char_end": 170
},
{
"id": "P06-1053.4",
"char_start": 179,
"char_end": 211
},
{
"id": "P06-... | [
{
"label": 5,
"arg1": "P06-1053.1",
"arg2": "P06-1053.2",
"reverse": false
},
{
"label": 1,
"arg1": "P06-1053.3",
"arg2": "P06-1053.4",
"reverse": false
},
{
"label": 4,
"arg1": "P06-1053.10",
"arg2": "P06-1053.11",
"reverse": false
}
] |
P06-1012 |
Estimating Class Priors In Domain Adaptation For Word Sense Disambiguation
|
Instances of a word drawn from different domains may have different sense priors (the proportions of the different senses of a word). This in turn affects the accuracy of word sense disambiguation (WSD) systems trained and applied on different domains. This paper presents a method to estimate the sense priors of words... | [
{
"id": "P06-1012.1",
"char_start": 16,
"char_end": 20
},
{
"id": "P06-1012.2",
"char_start": 42,
"char_end": 49
},
{
"id": "P06-1012.3",
"char_start": 69,
"char_end": 81
},
{
"id": "P06-1012.4",
"char_start": 116,
"char_end": 122
},
{
"id": "P06-1... | [
{
"label": 3,
"arg1": "P06-1012.1",
"arg2": "P06-1012.3",
"reverse": true
},
{
"label": 3,
"arg1": "P06-1012.4",
"arg2": "P06-1012.5",
"reverse": false
},
{
"label": 1,
"arg1": "P06-1012.6",
"arg2": "P06-1012.7",
"reverse": false
},
{
"label": 3,
"... |
C86-1105 | An Attempt To Automatic Thesaurus Construction From An Ordinary Japanese Language Dictionary
|
How to obtain hierarchical relations(e.g. superordinate -hyponym relation, synonym relation) is one of the most important problems for thesaurus construction. A pilot system for extracting these relations automatically from an ordinary Japanese language dictionary (Shinmeikai Kokugojiten, published by Sansei-do, in ma... | [
{
"id": "C86-1105.1",
"char_start": 15,
"char_end": 37
},
{
"id": "C86-1105.2",
"char_start": 43,
"char_end": 74
},
{
"id": "C86-1105.3",
"char_start": 76,
"char_end": 92
},
{
"id": "C86-1105.4",
"char_start": 136,
"char_end": 158
},
{
"id": "C86-1... | [
{
"label": 4,
"arg1": "C86-1105.1",
"arg2": "C86-1105.4",
"reverse": false
},
{
"label": 4,
"arg1": "C86-1105.5",
"arg2": "C86-1105.6",
"reverse": false
},
{
"label": 4,
"arg1": "C86-1105.7",
"arg2": "C86-1105.8",
"reverse": false
}
] |
C86-1021 | The Transfer Phase Of Mu Machine Translation System
|
The interlingual approach to MT has been repeatedly advocated by researchers originally interested in natural language understanding who take machine translation to be one possible application. However, not only the ambiguity but also the vagueness which every natural language inevitably has leads this approach into e... | [
{
"id": "C86-1021.1",
"char_start": 5,
"char_end": 32
},
{
"id": "C86-1021.2",
"char_start": 103,
"char_end": 133
},
{
"id": "C86-1021.3",
"char_start": 143,
"char_end": 162
},
{
"id": "C86-1021.4",
"char_start": 217,
"char_end": 226
},
{
"id": "C8... | [
{
"label": 1,
"arg1": "C86-1021.2",
"arg2": "C86-1021.3",
"reverse": false
},
{
"label": 3,
"arg1": "C86-1021.4",
"arg2": "C86-1021.5",
"reverse": false
},
{
"label": 1,
"arg1": "C86-1021.7",
"arg2": "C86-1021.8",
"reverse": false
},
{
"label": 6,
... |
C04-1058 |
Why Nitpicking Works: Evidence For Occam's Razor In Error Correctors
|
Empirical experience and observations have shown us when powerful and highly tunable classifiers such as maximum entropy classifiers, boosting and SVMs are applied to language processing tasks, it is possible to achieve high accuracies, but eventually their performances all tend to plateau out at around the same point... | [
{
"id": "C04-1058.1",
"char_start": 86,
"char_end": 97
},
{
"id": "C04-1058.2",
"char_start": 106,
"char_end": 133
},
{
"id": "C04-1058.3",
"char_start": 135,
"char_end": 143
},
{
"id": "C04-1058.4",
"char_start": 148,
"char_end": 152
},
{
"id": "C... | [
{
"label": 1,
"arg1": "C04-1058.4",
"arg2": "C04-1058.5",
"reverse": false
},
{
"label": 1,
"arg1": "C04-1058.6",
"arg2": "C04-1058.7",
"reverse": false
}
] |
N06-1007 | Acquisition Of Verb Entailment From Text
|
The study addresses the problem of automatic acquisition of entailment relations between verbs. While this task has much in common with paraphrases acquisition which aims to discover semantic equivalence between verbs, the main challenge of entailment acquisition is to capture asymmetric, or directional, relations. Mo... | [
{
"id": "N06-1007.1",
"char_start": 36,
"char_end": 57
},
{
"id": "N06-1007.2",
"char_start": 61,
"char_end": 81
},
{
"id": "N06-1007.3",
"char_start": 90,
"char_end": 95
},
{
"id": "N06-1007.4",
"char_start": 137,
"char_end": 160
},
{
"id": "N06-1... | [
{
"label": 3,
"arg1": "N06-1007.2",
"arg2": "N06-1007.3",
"reverse": false
},
{
"label": 3,
"arg1": "N06-1007.5",
"arg2": "N06-1007.6",
"reverse": false
},
{
"label": 5,
"arg1": "N06-1007.7",
"arg2": "N06-1007.8",
"reverse": false
},
{
"label": 3,
... |
A00-2023 | Forest-Based Statistical Sentence Generation
|
This paper presents a new approach to statistical sentence generation in which alternative phrases are represented as packed sets of trees, or forests, and then ranked statistically to choose the best one. This representation offers advantages in compactness and in the ability to represent syntactic information. It al... | [
{
"id": "A00-2023.1",
"char_start": 39,
"char_end": 70
},
{
"id": "A00-2023.2",
"char_start": 92,
"char_end": 99
},
{
"id": "A00-2023.3",
"char_start": 134,
"char_end": 139
},
{
"id": "A00-2023.4",
"char_start": 144,
"char_end": 151
},
{
"id": "A00... | [
{
"label": 3,
"arg1": "A00-2023.2",
"arg2": "A00-2023.3",
"reverse": false
},
{
"label": 6,
"arg1": "A00-2023.8",
"arg2": "A00-2023.9",
"reverse": false
}
] |
X98-1022 | An NTU-Approach To Automatic Sentence Extraction For Summary Generation
|
Automatic summarization and information extraction are two important Internet services. MUC and SUMMAC play their appropriate roles in the next generation Internet. This paper focuses on the automatic summarization and proposes two different models to extract sentences for summary generation under two tasks initiated ... | [
{
"id": "X98-1022.1",
"char_start": 1,
"char_end": 24
},
{
"id": "X98-1022.2",
"char_start": 29,
"char_end": 51
},
{
"id": "X98-1022.3",
"char_start": 89,
"char_end": 92
},
{
"id": "X98-1022.4",
"char_start": 97,
"char_end": 103
},
{
"id": "X98-102... | [
{
"label": 1,
"arg1": "X98-1022.6",
"arg2": "X98-1022.7",
"reverse": false
},
{
"label": 1,
"arg1": "X98-1022.9",
"arg2": "X98-1022.10",
"reverse": true
},
{
"label": 1,
"arg1": "X98-1022.13",
"arg2": "X98-1022.18",
"reverse": false
}
] |
P98-2213 |
A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting
|
This paper describes methods for relating (threading) multiple newspaper articles, and for visualizing various characteristics of them by using a directed graph. A set of articles is represented by a set of word vectors, and the similarity between the vectors is then calculated. The graph is constructed from the simil... | [
{
"id": "P98-2213.1",
"char_start": 147,
"char_end": 161
},
{
"id": "P98-2213.2",
"char_start": 208,
"char_end": 220
},
{
"id": "P98-2213.3",
"char_start": 230,
"char_end": 240
},
{
"id": "P98-2213.4",
"char_start": 253,
"char_end": 260
},
{
"id": ... | [
{
"label": 3,
"arg1": "P98-2213.3",
"arg2": "P98-2213.4",
"reverse": false
},
{
"label": 3,
"arg1": "P98-2213.8",
"arg2": "P98-2213.9",
"reverse": false
},
{
"label": 3,
"arg1": "P98-2213.12",
"arg2": "P98-2213.13",
"reverse": false
},
{
"label": 3,
... |
P98-1113 |
A Flexible Example-Based Parser Based on the SSTC
|
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their representation structure, and on the knowledge that we can get from these examples the required information to parse a new input sentence. In our ap... | [
{
"id": "P98-1113.1",
"char_start": 42,
"char_end": 66
},
{
"id": "P98-1113.2",
"char_start": 87,
"char_end": 109
},
{
"id": "P98-1113.3",
"char_start": 172,
"char_end": 196
},
{
"id": "P98-1113.4",
"char_start": 295,
"char_end": 309
},
{
"id": "P9... | [
{
"label": 3,
"arg1": "P98-1113.6",
"arg2": "P98-1113.7",
"reverse": false
},
{
"label": 4,
"arg1": "P98-1113.9",
"arg2": "P98-1113.10",
"reverse": false
},
{
"label": 4,
"arg1": "P98-1113.11",
"arg2": "P98-1113.12",
"reverse": false
},
{
"label": 3,
... |
P02-1060 | Named Entity Recognition Using An HMM-Based Chunk Tagger
|
This paper proposes a Hidden Markov Model (HMM) and an HMM-based chunk tagger, from which a named entity (NE) recognition (NER) system is built to recognize and classify names, times and numerical quantities. Through the HMM, our system is able to apply and integrate four types of internal and external evidences : 1) ... | [
{
"id": "P02-1060.1",
"char_start": 23,
"char_end": 48
},
{
"id": "P02-1060.2",
"char_start": 56,
"char_end": 78
},
{
"id": "P02-1060.3",
"char_start": 93,
"char_end": 135
},
{
"id": "P02-1060.4",
"char_start": 171,
"char_end": 176
},
{
"id": "P02-... | [
{
"label": 1,
"arg1": "P02-1060.2",
"arg2": "P02-1060.3",
"reverse": false
},
{
"label": 3,
"arg1": "P02-1060.7",
"arg2": "P02-1060.8",
"reverse": true
},
{
"label": 2,
"arg1": "P02-1060.13",
"arg2": "P02-1060.15",
"reverse": false
}
] |
C96-2213 | Using A Hybrid System Of Corpus- And Knowledge-Based Techniques To Automate The Induction Of A Lexical Sublanguage Grammar
|
Porting a Natural Language Processing (NLP) system to a new domain remains one of the bottlenecks in syntactic parsing, because of the amount of effort required to fix gaps in the lexicon, and to attune the existing grammar to the idiosyncracies of the new sublanguage. This paper shows how the process of fitting a lex... | [
{
"id": "C96-2213.1",
"char_start": 11,
"char_end": 51
},
{
"id": "C96-2213.2",
"char_start": 57,
"char_end": 67
},
{
"id": "C96-2213.3",
"char_start": 102,
"char_end": 119
},
{
"id": "C96-2213.4",
"char_start": 181,
"char_end": 188
},
{
"id": "C96... | [
{
"label": 1,
"arg1": "C96-2213.1",
"arg2": "C96-2213.2",
"reverse": true
},
{
"label": 1,
"arg1": "C96-2213.5",
"arg2": "C96-2213.6",
"reverse": false
},
{
"label": 1,
"arg1": "C96-2213.7",
"arg2": "C96-2213.8",
"reverse": false
},
{
"label": 6,
"... |
C04-1102 | Detecting Transliterated Orthographic Variants Via Two Similarity Metrics
|
We propose a detection method for orthographic variants caused by transliteration in a large corpus. The method employs two similarities. One is string similarity based on edit distance. The other is contextual similarity by a vector space model. Experimental results show that the method performed a 0.889 F-measure in... | [
{
"id": "C04-1102.1",
"char_start": 14,
"char_end": 30
},
{
"id": "C04-1102.2",
"char_start": 67,
"char_end": 82
},
{
"id": "C04-1102.3",
"char_start": 94,
"char_end": 100
},
{
"id": "C04-1102.4",
"char_start": 125,
"char_end": 137
},
{
"id": "C04-... | [
{
"label": 4,
"arg1": "C04-1102.2",
"arg2": "C04-1102.3",
"reverse": false
},
{
"label": 1,
"arg1": "C04-1102.5",
"arg2": "C04-1102.6",
"reverse": true
},
{
"label": 1,
"arg1": "C04-1102.7",
"arg2": "C04-1102.8",
"reverse": true
}
] |
N06-1018 | Understanding Temporal Expressions In Emails
|
Recent years have seen increasing research on extracting and using temporal information in natural language applications. However most of the works found in the literature have focused on identifying and understanding temporal expressions in newswire texts. In this paper we report our work on anchoring temporal expres... | [
{
"id": "N06-1018.1",
"char_start": 92,
"char_end": 121
},
{
"id": "N06-1018.2",
"char_start": 219,
"char_end": 239
},
{
"id": "N06-1018.3",
"char_start": 243,
"char_end": 257
},
{
"id": "N06-1018.4",
"char_start": 305,
"char_end": 325
},
{
"id": "... | [
{
"label": 4,
"arg1": "N06-1018.2",
"arg2": "N06-1018.3",
"reverse": false
},
{
"label": 3,
"arg1": "N06-1018.4",
"arg2": "N06-1018.5",
"reverse": true
},
{
"label": 6,
"arg1": "N06-1018.9",
"arg2": "N06-1018.10",
"reverse": false
}
] |
H89-2066 | Research And Development For Spoken Language Systems
|
The goal of this research is to develop a spoken language system that will demonstrate the usefulness of voice input for interactive problem solving. The system will accept continuous speech, and will handle multiple speakers without explicit speaker enrollment. Combining speech recognition and natural language proces... | [
{
"id": "H89-2066.1",
"char_start": 43,
"char_end": 65
},
{
"id": "H89-2066.2",
"char_start": 106,
"char_end": 117
},
{
"id": "H89-2066.3",
"char_start": 122,
"char_end": 149
},
{
"id": "H89-2066.4",
"char_start": 174,
"char_end": 191
},
{
"id": "H... | [
{
"label": 1,
"arg1": "H89-2066.2",
"arg2": "H89-2066.3",
"reverse": false
},
{
"label": 1,
"arg1": "H89-2066.8",
"arg2": "H89-2066.9",
"reverse": false
},
{
"label": 1,
"arg1": "H89-2066.12",
"arg2": "H89-2066.13",
"reverse": false
},
{
"label": 1,
... |
J81-1002 | Computer Generation Of Multiparagraph English Text
|
This paper reports recent research into methods for creating natural language text. A new processing paradigm called Fragment-and-Compose has been created and an experimental system implemented in it. The knowledge to be expressed in text is first divided into small propositional units, which are then composed into ap... | [
{
"id": "J81-1002.1",
"char_start": 53,
"char_end": 83
},
{
"id": "J81-1002.2",
"char_start": 91,
"char_end": 110
},
{
"id": "J81-1002.3",
"char_start": 118,
"char_end": 138
},
{
"id": "J81-1002.4",
"char_start": 206,
"char_end": 215
},
{
"id": "J8... | [
{
"label": 4,
"arg1": "J81-1002.4",
"arg2": "J81-1002.5",
"reverse": false
},
{
"label": 1,
"arg1": "J81-1002.15",
"arg2": "J81-1002.16",
"reverse": false
}
] |
C90-1002 | Design Of A Hybrid Deterministic Parser
|
A deterministic parser is under development which represents a departure from traditional deterministic parsers in that it combines both symbolic and connectionist components. The connectionist component is trained either from patterns derived from the rules of a deterministic grammar. The development and evolution of... | [
{
"id": "C90-1002.1",
"char_start": 1,
"char_end": 23
},
{
"id": "C90-1002.2",
"char_start": 79,
"char_end": 112
},
{
"id": "C90-1002.3",
"char_start": 138,
"char_end": 175
},
{
"id": "C90-1002.4",
"char_start": 228,
"char_end": 236
},
{
"id": "C90... | [
{
"label": 6,
"arg1": "C90-1002.1",
"arg2": "C90-1002.2",
"reverse": false
},
{
"label": 4,
"arg1": "C90-1002.5",
"arg2": "C90-1002.6",
"reverse": false
},
{
"label": 6,
"arg1": "C90-1002.8",
"arg2": "C90-1002.9",
"reverse": false
},
{
"label": 1,
... |
P02-1059 | Supervised Ranking In Open-Domain Text Summarization
|
The paper proposes and empirically motivates an integration of supervised learning with unsupervised learning to deal with human biases in summarization. In particular, we explore the use of probabilistic decision tree within the clustering framework to account for the variation as well as regularity in human created ... | [
{
"id": "P02-1059.1",
"char_start": 64,
"char_end": 83
},
{
"id": "P02-1059.2",
"char_start": 89,
"char_end": 110
},
{
"id": "P02-1059.3",
"char_start": 140,
"char_end": 153
},
{
"id": "P02-1059.4",
"char_start": 192,
"char_end": 219
},
{
"id": "P0... | [
{
"label": 1,
"arg1": "P02-1059.1",
"arg2": "P02-1059.3",
"reverse": false
},
{
"label": 4,
"arg1": "P02-1059.6",
"arg2": "P02-1059.7",
"reverse": true
}
] |
P02-1002 | Sequential Conditional Generalized Iterative Scaling
|
We describe a speedup for training conditional maximum entropy models. The algorithm is a simple variation on Generalized Iterative Scaling, but converges roughly an order of magnitude faster, depending on the number of constraints, and the way speed is measured. Rather than attempting to train all model parameters si... | [
{
"id": "P02-1002.1",
"char_start": 36,
"char_end": 70
},
{
"id": "P02-1002.2",
"char_start": 111,
"char_end": 140
},
{
"id": "P02-1002.3",
"char_start": 491,
"char_end": 515
}
] | [] |
C00-2123 | Word Re-Ordering And DP-Based Search In Statistical Machine Translation
|
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 achieve an ... | [
{
"id": "C00-2123.1",
"char_start": 51,
"char_end": 87
},
{
"id": "C00-2123.2",
"char_start": 97,
"char_end": 121
},
{
"id": "C00-2123.3",
"char_start": 246,
"char_end": 261
},
{
"id": "C00-2123.4",
"char_start": 270,
"char_end": 296
},
{
"id": "C0... | [
{
"label": 1,
"arg1": "C00-2123.1",
"arg2": "C00-2123.2",
"reverse": true
},
{
"label": 3,
"arg1": "C00-2123.5",
"arg2": "C00-2123.6",
"reverse": true
}
] |
C96-1055 | Role Of Word Sense Disambiguation In Lexical Acquisition : Predicting Semantics From Syntactic Cues
|
This paper addresses the issue of word-sense ambiguity in extraction from machine-readable resources for the construction of large-scale knowledge sources. We describe two experiments: one which ignored word-sense distinctions, resulting in 6.3% accuracy for semantic classification of verbs based on (Levin, 1993); and... | [
{
"id": "C96-1055.1",
"char_start": 35,
"char_end": 55
},
{
"id": "C96-1055.2",
"char_start": 75,
"char_end": 101
},
{
"id": "C96-1055.3",
"char_start": 126,
"char_end": 155
},
{
"id": "C96-1055.4",
"char_start": 204,
"char_end": 227
},
{
"id": "C9... | [
{
"label": 4,
"arg1": "C96-1055.1",
"arg2": "C96-1055.2",
"reverse": false
},
{
"label": 6,
"arg1": "C96-1055.8",
"arg2": "C96-1055.9",
"reverse": false
},
{
"label": 1,
"arg1": "C96-1055.10",
"arg2": "C96-1055.11",
"reverse": true
},
{
"label": 6,
... |
M91-1029 | PRC Inc: Description Of The PAKTUS System Used For MUC-3
|
The PRC Adaptive Knowledge-based Text Understanding System (PAKTUS) has been under development as an Independent Research and Development project at PRC since 1984. The objective is a generic system of tools, including a core English lexicon, grammar, and concept representations, for building natural language processi... | [
{
"id": "M91-1029.1",
"char_start": 5,
"char_end": 68
},
{
"id": "M91-1029.2",
"char_start": 222,
"char_end": 242
},
{
"id": "M91-1029.3",
"char_start": 244,
"char_end": 251
},
{
"id": "M91-1029.4",
"char_start": 295,
"char_end": 336
},
{
"id": "M9... | [
{
"label": 1,
"arg1": "M91-1029.4",
"arg2": "M91-1029.5",
"reverse": false
},
{
"label": 1,
"arg1": "M91-1029.9",
"arg2": "M91-1029.10",
"reverse": false
}
] |
P98-1088 | Memorisation for Glue Language Deduction and Categorial Parsing
|
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the formulation and parsing of various categorial grammars. These applications call for efficient deduction methods. Although a number of deduction metho... | [
{
"id": "P98-1088.1",
"char_start": 32,
"char_end": 44
},
{
"id": "P98-1088.2",
"char_start": 83,
"char_end": 108
},
{
"id": "P98-1088.3",
"char_start": 117,
"char_end": 132
},
{
"id": "P98-1088.4",
"char_start": 145,
"char_end": 158
},
{
"id": "P9... | [
{
"label": 1,
"arg1": "P98-1088.1",
"arg2": "P98-1088.2",
"reverse": false
},
{
"label": 1,
"arg1": "P98-1088.3",
"arg2": "P98-1088.4",
"reverse": false
}
] |
E06-1045 | Data-Driven Generation Of Emphatic Facial Displays
|
We describe an implementation of data-driven selection of emphatic facial displays for an embodied conversational agent in a dialogue system. A corpus of sentences in the domain of the target dialogue system was recorded, and the facial displays used by the speaker were annotated. The data from those recordings was us... | [
{
"id": "E06-1045.1",
"char_start": 91,
"char_end": 120
},
{
"id": "E06-1045.2",
"char_start": 126,
"char_end": 141
},
{
"id": "E06-1045.3",
"char_start": 145,
"char_end": 164
},
{
"id": "E06-1045.4",
"char_start": 186,
"char_end": 208
},
{
"id": "... | [
{
"label": 4,
"arg1": "E06-1045.1",
"arg2": "E06-1045.2",
"reverse": false
}
] |
P04-1030 | Head-Driven Parsing For Word Lattices
|
We present the first application of the head-driven statistical parsing model of Collins (1999) as a simultaneous language model and parser for large-vocabulary speech recognition. The model is adapted to an online left to right chart-parser for word lattices, integrating acoustic, n-gram, and parser probabilities. Th... | [
{
"id": "P04-1030.1",
"char_start": 41,
"char_end": 78
},
{
"id": "P04-1030.2",
"char_start": 102,
"char_end": 129
},
{
"id": "P04-1030.3",
"char_start": 134,
"char_end": 140
},
{
"id": "P04-1030.4",
"char_start": 145,
"char_end": 180
},
{
"id": "P... | [
{
"label": 1,
"arg1": "P04-1030.3",
"arg2": "P04-1030.4",
"reverse": false
},
{
"label": 1,
"arg1": "P04-1030.7",
"arg2": "P04-1030.8",
"reverse": true
},
{
"label": 1,
"arg1": "P04-1030.13",
"arg2": "P04-1030.14",
"reverse": false
}
] |
P02-1023 | Improving Language Model Size Reduction Using Better Pruning Criteria
|
Reducing language model (LM) size is a critical issue when applying a LM to realistic applications which have memory constraints. In this paper, three measures are studied for the purpose of LM pruning. They are probability, rank, and entropy. We evaluated the performance of the three pruning criteria in a real applic... | [
{
"id": "P02-1023.1",
"char_start": 10,
"char_end": 34
},
{
"id": "P02-1023.2",
"char_start": 71,
"char_end": 73
},
{
"id": "P02-1023.3",
"char_start": 192,
"char_end": 202
},
{
"id": "P02-1023.4",
"char_start": 226,
"char_end": 230
},
{
"id": "P02... | [
{
"label": 6,
"arg1": "P02-1023.4",
"arg2": "P02-1023.5",
"reverse": false
},
{
"label": 1,
"arg1": "P02-1023.6",
"arg2": "P02-1023.7",
"reverse": false
}
] |
C00-1054 | Finite-State Multimodal Parsing And Understanding
|
Multimodal interfaces require effective parsing and understanding of utterances whose content is distributed across multiple input modes. Johnston 1998 presents an approach in which strategies for multimodal integration are stated declaratively using a unification-based grammar that is used by a multidimensional char... | [
{
"id": "C00-1054.1",
"char_start": 42,
"char_end": 49
},
{
"id": "C00-1054.2",
"char_start": 71,
"char_end": 81
},
{
"id": "C00-1054.3",
"char_start": 199,
"char_end": 221
},
{
"id": "C00-1054.4",
"char_start": 255,
"char_end": 280
},
{
"id": "C00... | [
{
"label": 1,
"arg1": "C00-1054.4",
"arg2": "C00-1054.5",
"reverse": false
},
{
"label": 1,
"arg1": "C00-1054.7",
"arg2": "C00-1054.8",
"reverse": true
}
] |
N06-1037 | Exploring Syntactic Features For Relation Extraction Using A Convolution Tree Kernel
|
This paper proposes to use a convolution kernel over parse trees to model syntactic structure information for relation extraction. Our study reveals that the syntactic structure features embedded in a parse tree are very effective for relation extraction and these features can be well captured by the convolution tree ... | [
{
"id": "N06-1037.1",
"char_start": 30,
"char_end": 48
},
{
"id": "N06-1037.2",
"char_start": 54,
"char_end": 65
},
{
"id": "N06-1037.3",
"char_start": 75,
"char_end": 106
},
{
"id": "N06-1037.4",
"char_start": 111,
"char_end": 130
},
{
"id": "N06-... | [
{
"label": 3,
"arg1": "N06-1037.1",
"arg2": "N06-1037.3",
"reverse": false
},
{
"label": 4,
"arg1": "N06-1037.5",
"arg2": "N06-1037.6",
"reverse": false
}
] |
H90-1011 | Performing Integrated Syntactic And Semantic Parsing Using Classification
|
This paper describes a particular approach to parsing that utilizes recent advances in unification-based parsing and in classification-based knowledge representation. As unification-based grammatical frameworks are extended to handle richer descriptions of linguistic information, they begin to share many of the proper... | [
{
"id": "H90-1011.1",
"char_start": 47,
"char_end": 54
},
{
"id": "H90-1011.2",
"char_start": 88,
"char_end": 113
},
{
"id": "H90-1011.3",
"char_start": 121,
"char_end": 166
},
{
"id": "H90-1011.4",
"char_start": 171,
"char_end": 211
},
{
"id": "H9... | [
{
"label": 1,
"arg1": "H90-1011.1",
"arg2": "H90-1011.2",
"reverse": true
},
{
"label": 6,
"arg1": "H90-1011.4",
"arg2": "H90-1011.6",
"reverse": false
},
{
"label": 1,
"arg1": "H90-1011.7",
"arg2": "H90-1011.8",
"reverse": false
},
{
"label": 1,
"... |
J97-1004 | Developing And Empirically Evaluating Robust Explanation Generators : The KNIGHT Experiments
|
"To explain complex phenomena, an explanation system must be able to select information from a formal representation of domain knowledge, organize the selected information into multisentential discourse plans, and realize the discourse plans in text. Although recent years have witnessed significant progress in the dev... | [
{
"id": "J97-1004.1",
"char_start": 35,
"char_end": 53
},
{
"id": "J97-1004.2",
"char_start": 121,
"char_end": 137
},
{
"id": "J97-1004.3",
"char_start": 178,
"char_end": 209
},
{
"id": "J97-1004.4",
"char_start": 227,
"char_end": 242
},
{
"id": "J... | [
{
"label": 1,
"arg1": "J97-1004.1",
"arg2": "J97-1004.2",
"reverse": true
},
{
"label": 1,
"arg1": "J97-1004.6",
"arg2": "J97-1004.7",
"reverse": true
},
{
"label": 1,
"arg1": "J97-1004.8",
"arg2": "J97-1004.10",
"reverse": true
}
] |
P04-2005 | Automatic Acquisition Of English Topic Signatures Based On A Second Language |
We present a novel approach for automatically acquiring English topic signatures. Given a particular concept, or word sense, a topic signature is a set of words that tend to co-occur with it. Topic signatures can be useful in a number of Natural Language Processing (NLP) applications, such as Word Sense Disambiguation... | [
{
"id": "P04-2005.1",
"char_start": 57,
"char_end": 81
},
{
"id": "P04-2005.2",
"char_start": 102,
"char_end": 109
},
{
"id": "P04-2005.3",
"char_start": 114,
"char_end": 124
},
{
"id": "P04-2005.4",
"char_start": 128,
"char_end": 143
},
{
"id": "P... | [
{
"label": 4,
"arg1": "P04-2005.4",
"arg2": "P04-2005.5",
"reverse": true
},
{
"label": 1,
"arg1": "P04-2005.6",
"arg2": "P04-2005.7",
"reverse": false
},
{
"label": 4,
"arg1": "P04-2005.10",
"arg2": "P04-2005.11",
"reverse": false
},
{
"label": 4,
... |
P04-2010 |
A Machine Learning Approach To German Pronoun Resolution |
This paper presents a novel ensemble learning approach to resolving German pronouns. Boosting, the method in question, combines the moderately accurate hypotheses of several classifiers to form a highly accurate one. Experiments show that this approach is superior to a single decision-tree classifier. Furthermore, we ... | [
{
"id": "P04-2010.1",
"char_start": 29,
"char_end": 55
},
{
"id": "P04-2010.2",
"char_start": 69,
"char_end": 84
},
{
"id": "P04-2010.3",
"char_start": 86,
"char_end": 94
},
{
"id": "P04-2010.4",
"char_start": 153,
"char_end": 163
},
{
"id": "P04-2... | [
{
"label": 1,
"arg1": "P04-2010.1",
"arg2": "P04-2010.2",
"reverse": false
},
{
"label": 1,
"arg1": "P04-2010.7",
"arg2": "P04-2010.9",
"reverse": false
},
{
"label": 6,
"arg1": "P04-2010.12",
"arg2": "P04-2010.13",
"reverse": false
}
] |
C04-1035 |
Classifying Ellipsis In Dialogue : A Machine Learning Approach |
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 annotate an input ... | [
{
"id": "C04-1035.1",
"char_start": 23,
"char_end": 48
},
{
"id": "C04-1035.2",
"char_start": 52,
"char_end": 77
},
{
"id": "C04-1035.3",
"char_start": 81,
"char_end": 89
},
{
"id": "C04-1035.4",
"char_start": 111,
"char_end": 131
},
{
"id": "C04-1... | [
{
"label": 1,
"arg1": "C04-1035.1",
"arg2": "C04-1035.2",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1035.4",
"arg2": "C04-1035.6",
"reverse": true
},
{
"label": 3,
"arg1": "C04-1035.8",
"arg2": "C04-1035.9",
"reverse": false
},
{
"label": 6,
"... |
C04-1036 | Feature Vector Quality And Distributional Similarity |
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 semantic criteri... | [
{
"id": "C04-1036.1",
"char_start": 27,
"char_end": 47
},
{
"id": "C04-1036.2",
"char_start": 52,
"char_end": 76
},
{
"id": "C04-1036.3",
"char_start": 98,
"char_end": 132
},
{
"id": "C04-1036.4",
"char_start": 153,
"char_end": 187
},
{
"id": "C04-... | [
{
"label": 1,
"arg1": "C04-1036.3",
"arg2": "C04-1036.4",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1036.6",
"arg2": "C04-1036.7",
"reverse": false
},
{
"label": 2,
"arg1": "C04-1036.10",
"arg2": "C04-1036.11",
"reverse": false
}
] |
C04-1068 |
Filtering Speaker-Specific Words From Electronic Discussions |
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 electroni... | [
{
"id": "C04-1068.1",
"char_start": 101,
"char_end": 123
},
{
"id": "C04-1068.2",
"char_start": 142,
"char_end": 164
},
{
"id": "C04-1068.3",
"char_start": 221,
"char_end": 230
},
{
"id": "C04-1068.4",
"char_start": 299,
"char_end": 307
},
{
"id": ... | [
{
"label": 3,
"arg1": "C04-1068.4",
"arg2": "C04-1068.5",
"reverse": false
},
{
"label": 1,
"arg1": "C04-1068.9",
"arg2": "C04-1068.10",
"reverse": false
},
{
"label": 2,
"arg1": "C04-1068.11",
"arg2": "C04-1068.12",
"reverse": true
}
] |
C04-1080 | Part- Of- Speech Tagging In Context |
We present a new HMM tagger that exploits context on both sides of a word to be tagged, and evaluate it in both the unsupervised and supervised case. Along the way, we present the first comprehensive comparison of unsupervised methods for part-of-speech tagging, noting that published results to date have not been comp... | [
{
"id": "C04-1080.1",
"char_start": 43,
"char_end": 50
},
{
"id": "C04-1080.2",
"char_start": 70,
"char_end": 74
},
{
"id": "C04-1080.3",
"char_start": 117,
"char_end": 149
},
{
"id": "C04-1080.4",
"char_start": 215,
"char_end": 262
},
{
"id": "C04... | [
{
"label": 3,
"arg1": "C04-1080.1",
"arg2": "C04-1080.2",
"reverse": false
},
{
"label": 2,
"arg1": "C04-1080.7",
"arg2": "C04-1080.9",
"reverse": false
},
{
"label": 2,
"arg1": "C04-1080.11",
"arg2": "C04-1080.12",
"reverse": false
}
] |
C04-1096 | Generation Of Relative Referring Expressions Based On Perceptual Grouping |
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 groups of objec... | [
{
"id": "C04-1096.1",
"char_start": 25,
"char_end": 46
},
{
"id": "C04-1096.2",
"char_start": 77,
"char_end": 84
},
{
"id": "C04-1096.3",
"char_start": 89,
"char_end": 105
},
{
"id": "C04-1096.4",
"char_start": 114,
"char_end": 121
},
{
"id": "C04-... | [
{
"label": 1,
"arg1": "C04-1096.1",
"arg2": "C04-1096.2",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1096.3",
"arg2": "C04-1096.4",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1096.6",
"arg2": "C04-1096.7",
"reverse": true
}
] |
C04-1103 |
Direct Orthographical Mapping For Machine Transliteration |
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 presented. Unde... | [
{
"id": "C04-1103.1",
"char_start": 1,
"char_end": 45
},
{
"id": "C04-1103.2",
"char_start": 78,
"char_end": 123
},
{
"id": "C04-1103.3",
"char_start": 162,
"char_end": 205
},
{
"id": "C04-1103.4",
"char_start": 234,
"char_end": 269
},
{
"id": "C04... | [
{
"label": 4,
"arg1": "C04-1103.1",
"arg2": "C04-1103.2",
"reverse": false
},
{
"label": 1,
"arg1": "C04-1103.3",
"arg2": "C04-1103.4",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1103.7",
"arg2": "C04-1103.8",
"reverse": false
},
{
"label": 1,
... |
C04-1112 |
A Lemma- Based Approach To A Maximum Entropy Word Sense Disambiguation System For Dutch |
In this paper, we present a corpus-based supervised word sense disambiguation (WSD) system for Dutch which combines statistical classification (maximum entropy) with linguistic information. Instead of building individual classifiers per ambiguous wordform, we introduce a lemma-based approach. The advantage of this nov... | [
{
"id": "C04-1112.1",
"char_start": 29,
"char_end": 91
},
{
"id": "C04-1112.2",
"char_start": 96,
"char_end": 101
},
{
"id": "C04-1112.3",
"char_start": 117,
"char_end": 143
},
{
"id": "C04-1112.4",
"char_start": 145,
"char_end": 160
},
{
"id": "C0... | [
{
"label": 1,
"arg1": "C04-1112.1",
"arg2": "C04-1112.2",
"reverse": false
},
{
"label": 6,
"arg1": "C04-1112.6",
"arg2": "C04-1112.8",
"reverse": false
},
{
"label": 3,
"arg1": "C04-1112.9",
"arg2": "C04-1112.10",
"reverse": false
},
{
"label": 1,
... |
C04-1116 | Term Aggregation : Mining Synonymous Expressions Using Personal Stylistic Variations |
We present a text mining method for finding synonymous expressions based on the distributional hypothesis in a set of coherent corpora. This paper proposes a new methodology to improve the accuracy of a term aggregation system using each author's text as a coherent corpus. Our approach is based on the idea that one pe... | [
{
"id": "C04-1116.1",
"char_start": 14,
"char_end": 32
},
{
"id": "C04-1116.2",
"char_start": 45,
"char_end": 67
},
{
"id": "C04-1116.3",
"char_start": 81,
"char_end": 106
},
{
"id": "C04-1116.4",
"char_start": 128,
"char_end": 135
},
{
"id": "C04-... | [
{
"label": 1,
"arg1": "C04-1116.1",
"arg2": "C04-1116.3",
"reverse": true
},
{
"label": 2,
"arg1": "C04-1116.5",
"arg2": "C04-1116.6",
"reverse": true
},
{
"label": 1,
"arg1": "C04-1116.7",
"arg2": "C04-1116.8",
"reverse": false
},
{
"label": 3,
"a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.