text stringlengths 0 316k | year stringclasses 50
values | No stringclasses 911
values |
|---|---|---|
Semantic Interpretation Using KL-ONE 1 Norman K. Sondheimer USC/Information Sciences Institute Marina del Rey, California 90292 USA Ralph M. Weischedel Dept. of Computer & Information Sciences University of Delaware Newark, Delaware 19716 USA Robert J. Bobrow Bolt Beranek and Newman, Inc. ... | 1984 | 24 |
TWO THEORIES FOR COMPUTING THE LOGICAL FORM OF MASS EXPRESSIONS Francis Jeffry Pelletier Lenhart K. Schubert Dept. Computing Science University of Alberta Edmonton, Alberta T6G 2El Canada ABSTRACT Applying the rules of translation is even simpler. In essence, all that ... | 1984 | 25 |
SYNTACTIC AND SEMANTIC PARSABILITY Geoffrey K. Pullum Syntax Research Center, Cowell College, UCSC, Santa Cruz, CA 95064 and Center for the Study of Language and Information, Stanford, CA 94305 ABSTRACT This paper surveys some issues that arise in the study of the syntax and seman... | 1984 | 26 |
The Semantics of Grammar Formalisms Seen as Computer Languages Fernando C. N. Pereira and Stuart M. Shieber Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract The design, implementation, and use of grammar for-... | 1984 | 27 |
THE RESOLUTION OF QUANTIFICATIONAL AMBIGUITY IN THE TENDUM SYSTEM Harry Bunt Computational Linguistics Research Unit Dept. of Language and Literature, Tilburg University P.O.Box 90153, 5000 LE Tilburg The Netherlands ABSTRACT A method is described for handling the ambiguity and vagueness that is... | 1984 | 28 |
Preventing False Inferences 1 Aravind Joshi and Bonnie Webher Department of Computer and Information Science Moore School/D2 University of Pennsylvania Philadelphia PA 19104 Ralph M. Weischedel 2 Department of Computer & Information Sciences University of Delaware Newark DE 19716 ABSTRACT ... | 1984 | 29 |
TRANSFORMING ENGLISH INTERFACES TO OTHER NATURAL LANGUAGES: AN EXPERIMENT WITH PORTUGUESE GABRIEL PEREIRA LOPES (1) Departamento de Matem~tica • Instituto Superior de Agronomia Tapada da Ajuda - 1399 Lisboa Codex, Portugal ABSTRACT Nowadays it is common the construction of English understanding ... | 1984 | 3 |
• O B L E M LOCALIZATION STRATEGIES FOR PRAGMATI~S ~ IN NATURAL-LANGUAGE FRONT ENDS• Lance A. Remshaw & Ralph ~L Welschedel Department of Ccaputer and Information Sciences University of Delaware Newark, Delaware 19716 USA ABSTRACT Problem localization Is the identification of ... | 1984 | 30 |
A CONNECTIONIST MODEL OF SOME ASPECTS OF ANAPHOR RESOLUTION Ronan G. Reilly Educational Research Centre St Patrick's College, Drumcondra Dublin 9, Ireland ABSTRACT This paper describes some recent developments in language processing involving computational models which more clo... | 1984 | 31 |
CONCURRENT PARSING IN PROGRAMMABLE LOGIC ARRAY (PLA-) NETS PROBLEMS AND PROPOSALS Helmut Schnelle RUHR-Universit~t Bochum Sp~achwissenschaftliches Institut D-4630 Bochum 1 West-Germany ABSTRACT This contribution attempts a conceptual and practical introduction into the principles of wir... | 1984 | 32 |
A Case Analysis Method Cooperating with ATNG and Its Application to Machine Translation Hitoshi IIDA, Kentaro OGURA and Hirosato NOMURA Musashino Electrical Communication Laboratory, N.T.T. Musashino-shi, Tokyo, 180, Japan Abstract This paper present a new method for parsing English sentences. T... | 1984 | 33 |
A PROPER TREATMEMT OF SYNTAX AND SEMANTICS IN MACHINE TRANSLATION ¥oshihiko Nitta, Atsushi Okajima, Hiroyuki Kaji, Youichi Hidano, Koichiro Ishihara Systems Development Laboratory, Hitachi, Ltd. 1099 Ohzenji Asao-ku, Kawasaki-shi, 215 JAPAN ABSTRACT A proper treatment of syntax and semantics in mac... | 1984 | 34 |
A CONSIDERATION ON THE CONCEPTS STRUCTURE AND LANGUAGE IN RELATION TO SELECTIONS OF TRANSLATION EQUIVALENTS OF VERBS IN MACHINE TRANSLATION SYSTEMS Sho Yoshida Department of Electronics, Kyushu University 36, Fukuoka 812, Japan ABSTRACT To give appropriate translation equivalents for target words i... | 1984 | 35 |
DETECTING PATTERNS IN A LEXICAL DATA BASE Nicoletta Calzolari Dipartimento di Linguistica - Universita' di Pisa Istituto di Linguistica Computazionale del CNR Via della Faggiola 32 50100 Pisa - Italy ABSTRACT In a well-structured Lexica] Data Base, a number of relations among lexica]... | 1984 | 36 |
~ISTIC PROSL~ IN ~JLTILINfiUAL HOI~(-DLOGICAL ~J~O~:~OSITION G.Thurmair Siemens AG ZT ZTI Otto-Hahn-Ring 6 Munich 83 West-Germany ABSTRACT An algorithm for the morphological decomposition of words into morphemes is presented. The application area is information retriev... | 1984 | 37 |
A GENERAL COMPUTATIONAL MODEL FOR WORD-FORM RECOGNITION AND PRODUCTION Kimmo Koskenniemi Department of General Linguistics Univeristy of Helsinki Hallituskatu 11-13, Helsinki 10, Finland ABSTRACT A language independent model for recognition and production of word forms is presented. This "two... | 1984 | 38 |
PANEL NATURAL LANGUAGE AND DATABASES, AGAIN Karen Sparck Jones Computer Laboratory, University of Cambridge Corn Exchange Street, Cambridge CB2 3QG, England INTRODUCTION Natural Language and Databases has been a common panel topic for some years, partly because it has been an active area ... | 1984 | 39 |
UN OUTIL MULTIDIMENSIONNEL DE L'ANALYSE DU DISCOURS J. CHAUCHE Laboratoire de Traitement de l'Information I.U.T. LE HAVRE Place Robert Schuman - 76610 LE HAVRE FRANCE & C.E.L.T.A. 23, Boulevard Albert let - 54000 NANCY FRANCE RESUME : Le traitement automatique du discours suppose un traitemen... | 1984 | 4 |
THERE STILL IS GOLD IN THE DATABASE MINE Madeleine Bates BBN Laboratories 10 Moulton Street Cambridge, MA 02238 Let me state clearly at the outset that I disagree with the premise that the problem of interfacing to database systems has outlived its usefu... | 1984 | 40 |
Is There Natural Language after Data Bases? Jaime G. Carbonell Computer Science Department Carnegie-Mellon University Pittsburgh, PA 15213 1. Why Not Data Base Query? The undisputed favorite application for natural language interfaces has been data base query. Why? The reasons range from the ... | 1984 | 41 |
Panel on Natural Language and Databases Daniel P. Flickinger Computer Research Center Hewlett-Packard Company 1501 Page Mill Road Palo Alto, California 94304 USA While I disagree with the proposition that database query has outlived its usefulness as a test environment for natural language pr... | 1984 | 42 |
Natural Language for Expert Systems: Comparisons with Database Systems Kathleen R. McKeown Department of Computer Science Columbia University New York, N.Y. 10027 1 Introduction Do natural language database systems still ,~lovide a valuable environment for further work on n~,tu... | 1984 | 43 |
REPRESENTING KNOWLEDGE ABOUT KNOWLEDGE AND MUTUAL KNOWLEDGE Sald Soulhi Equipe de Comprehension du Raisonnement Naturel LSI - UPS llg route de Narbonne 31062 Toulouse - FRANCE ABSTRACT In order to represent speech acts, in a multi-agent context, we choose a knowledge representation based o... | 1984 | 44 |
UNDERSTANDING PRAGMATICALLY ILL-FORMED INPUT FL Sandra Carberry Department of Computer Science University of Delaware Newark, Delaware 19711 USA ABSTRACT An utterance may be syntactically and semant- Ically well-formed yet violate the pragmatic rules of the world model. This paper presents ... | 1984 | 45 |
Referring as Requesting Philip R. Cohen Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University 1. Introduction 1 Searle [14] has arg,ed forcefully that referring is a speech act; that people refer, uot just expressions. This p... | 1984 | 46 |
Entity-Oriented Parsing Philip J. Hayes Computer Science Department, Carnegie.Mellon Llniversity Pi~tsbur~ih, PA 152_13, USA Abstract f An entity-oriented approach to restricted-domain parsing is proposed, In this approach, the definitions of the structure and surface representation of domain en... | 1984 | 47 |
Combining Functionality and Ob]ec~Orientedness for Natural Language Processing Toyoakl Nishida I and Shuji Doshita Department of Information Science, Kyoto University Sakyo-ku, Kyoto 606, JAPAN Abstract This paper proposes a method for organizing linguistic knowledge i... | 1984 | 48 |
USE OF H~ru'RISTIC KN~L~EDGE IN CHINF-.SELANGUAGEANALYSIS Yiming Yang, Toyoaki Nishida and Shuji Doshita Department of Information Science, Kyoto University, Sakyo-ku, Kyoto 606, JAPAN ABSTRACT This paper describes an analysis method which uses heuristic knowledge to find local... | 1984 | 49 |
A STOCHASTIC APPROACH TO SENTENCE PARSING Tetsunosuke FuJisaki Science Institute, IBM Japan, Ltd. No. 36 Kowa Building 5-19 Sanbancho,Chiyoda-ku Tokyo 102, Japan ABSTRACT A description will be given of a procedure to asslgn the most likely probabilitles to each of the rules of a given context... | 1984 | 5 |
THE DESIGN OF THE KERNEL ARCHITECTURE FOR THE EUROTRA* SOFTWARE R.L. Johnson**, U.M.I.S.T., P.O. Box 88, Manchester M60 IQD, U.K. S. Krauwer, Rijksuniversiteit, Trans 14, 3512 JK Utrecht, Holland M.A. RUsher, ISSCO, University of Geneva, 1211 Geneve 4, Switzerland G.B. Varile, Commission of the European Con... | 1984 | 50 |
MACHINE TRANSLATION : WHAT TYPE OF POST-EDITING ON WHAT TYPE OF DOCUMENTS FOR WHAT TYPE OF USERS Anne-Marie LAURIAN Centre National de la Recherche Scientifique Universitd de la Sorbonne Nouvelle - Paris III 19 rue des 8ernardins, 75005 Paris (France) ABSTRACT Various typologies of technic... | 1984 | 51 |
Simplifying Deterministic Parsing Alan W. Carter z Department of Computer Science University of British Columbia Vancouver, B.C. V6T IW5 Michael J. Frelllng 2 Department of Computer Science Oregon State University Corvallis, OR 07331 ABSTRACT This paper presents a model for deterministic p... | 1984 | 52 |
DEALING WITH CONJUNCTIONS IN A MACHINE TRANSLATION ENVIRONMENT Xiumlng HUANG Institute of Linguistics Chinese Academy of Social Sciences BeiJing, China* ABSTRACT The paper presents an algorithm, written in PROLOG, for processing English sentences which contain either Gapping, Right Node Ra... | 1984 | 53 |
ON PARSING PREFERENCES Lenhart K. Schubert Department of Computing Science University of Alberta, Edmonton Abstract. It is argued that syntactic preference principles such as Right Association and Minimal Attachment are unsatisfactory as usually formulated. Among ... | 1984 | 54 |
A COMFUTATIONAL THEORY OF THE FUNCTION OF CLUE WORDS IN ARGUMENT UNDERSTANDING Robin Cohen Department of Computer Science University of Toronto 'lDronto, CANADA MSS IA4 A~TNACT This paper examines the use of clue words in argument dialogues. These are special words ... | 1984 | 55 |
CONTROL STRUCTURES AND THEORIES OF INTERACTION IN SPEECII UNDEP~.WI'ANDING SYSTEMS E.J. Briscoe and B.K. Boguraev University of Cambridge, Computer Laboratory Corn Exchange Street, Cambridge CB2 3QG, England ABSTRACT lr: this paper, we approach the problem of organisation and control ip. automatic ... | 1984 | 56 |
Analysts Grammar or Japanese tn the Nu-ProJect - A Procedural Approach to Analysts Grammar - Jun-tcht TSUJII. Jun-tcht NAKANURA and Nakoto NAGAO Department of Electrical Engineering Kyoto University Kyoto. JAPAN Abstract Analysts grammar of Japanese tn the Mu-proJect ts presented, It ... | 1984 | 57 |
LEXICON-GRAMMAR AND THE SYNTACTIC ANALYSIS OF FRENCH Maurice Gross Laboretoire d'Automatique Documentsire et Linguistique University of Paris 7 2 place Jussieu 75251 Paris CEDEX 05 France ABSTRACT A lexicon-grammar is constituted ot the elementary sentences of a language. Instead of con... | 1984 | 58 |
Building a Large Knowledge Base for a Natural Language System Jerry R. Hobbs Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract A sophisticated natural language system requires a large knowledge base. A methodo... | 1984 | 59 |
IIOLiNI)EI) CONH'XT PARSING AND FASY I.I'AI+.NAIIII.ITY Robert C. Ilcrwick Room 820. MH" Artificial Intelligence I ~lb Cambridge. MA 02139 AIISTRACI" Natural langt~ages are often assumed to be constrained so that they are either easily learnable or parsdble, but few studies have inve... | 1984 | 6 |
LINGUISTICALLY MOTIVATED DESCRIPTIVE TERM SELECTION K. Sparck Jones and J.I. Tait* Computer Laboratory, University of Cambridge Corn Exchange Street, Cambridge CB2 3QG, U.K. ABSTRACT A linguistically motivated approach to indexing, that is the provision of descriptive terms for texts of any kind, ... | 1984 | 60 |
INFERENCING ON LINGUISTICALLY BASED ZZ~IANTIC STRUCTUR~F Eva Ilaji~ov~, Milena Hn~tkov~ Department of Applied Mathematics Faculty of Mathematics and Physics Charles University ~lalostransk4 n. 25 118 O0 Praha I, Czechoslovakia ABSTRACT The paper characterizes natural lang- uage inferencing in... | 1984 | 61 |
SEMANTIC RELEVANCE AND ASPECT DEPENDENCY IN A GIVEN SUBJECT DOMAIN Contents-drlven algorithmic processing of fuzzy wordmeanings to form dynamic stereotype representations Burghard B. Rieger Arbeitsgruppe fur mathematisch-empirische Systemforschung (MESY) German Department, Technical University of Aachen,... | 1984 | 62 |
A Plan Recognition Model for Clarification Subdialogues Diane J. Litman and James F. Allen Department of Computer Science University of Rochester, Rochester, NY 14627 Abstract One of the promising approaches to analyzing task- oriented dialogues has involved modeling the plans of the speakers in... | 1984 | 63 |
A COMPUTATIONAL THEORY OF DISPOSITIONS Lotfi A. Zadeh Computer Science Division University of California, Berkeley, California 94720, U.S.A. ABSTRACT Informally, a disposition is a proposition which is prepon- derantly, but no necessarily always, true. For example, birds can fly is a disposition... | 1984 | 64 |
Using Focus to Generate Complex and Simple Sentences Marcia A. Derr Kathleen R. McKeown AT&T Bell Laboratories Murray Hill, NJ 07974 USA and Department of Computer Science Columbia University Department of Computer Science Columbia University New York, NY 10027 USA Abstract One probl... | 1984 | 65 |
A RATIONAL RECONSTRUCTION OF THE PROTEUS SENTENCE PLANNER Graeme Ritchie Department of Artificial Intelligence University of Edinburgh, Hope Park Square Edinburgh EH8 9NW ABSTRACT A revised and more structured version of Davey's discourse generation program has been implemented, which constru... | 1984 | 66 |
SOFTWARE TOOLS FOR THE ENVIRONMENT OF A COMPUTER AIDED TRANSLATION SYSTEM I Daniel BACHUT - Nelson VERASTEGUI IFCI GETA INPG, 46, av. F~lix-Viallet Universit~ de Grenoble 3803] Grenoble C~dex 38402 Saint-Martin-d'H~res FRANCE FRANCE ABSTRACT In this paper we will present three systems, ... | 1984 | 67 |
DESIGN OF A MACHINE TRANSLATION SYST~4 FOR A SUBIASK~A(~ Beat Bu~, Susan Warwick, Patrick Shann Dalle Molle Institute for Semantic and Cognitive Studies University of Geneva Switzerland ABSTRACT This paper describes the design of a prototype machine translation system for a sublanguage of job... | 1984 | 68 |
Grammar Writing System (GRADE) of Mu-Machtne Translation Project and its Characteristics Jun-tcht NAKAMURA. Jun-tcht TSUJII. Makoto NAGAO Department of Electrical Engineering Kyoto University Sakyo. Kyoto. Japan ABSTRACT A powerful grammar writing system has been developed. Thts grammar ... | 1984 | 69 |
THE REPRESENTATION OF CONSTITUENT STRUCTURES FOR FINITE-STATE PARSING D. Terence Langendoen Yedldyah Langsam Departments of English and Computer & Information Science Brooklyn College of the City University of New York Brooklyn, New York 11210 U.S.A. ABSTBACT A mixed prefix-postfix notation for rep... | 1984 | 7 |
A DISCOVERY PROCEDURE FOR CERTAIN PHONOLOGICAL RULES Mark Johnson Linguistics, UCSD. ABSTRACT Acquisition of phonological systems can be insightfully studied in terms of discovery procedures. This paper describes a discovery procedure, implemented in Lisp, capable of deter- mining a ... | 1984 | 70 |
WHAT NOT TO SAY Jan Fornell Department of Linguistics & Phonetics Lund University Helgonabacken 12, Lund, Sweden ABSTRACT A problem with most text production and language generation systems is that they tend to become rather verbose. This may be due to negleetion... | 1984 | 71 |
WHEN IS THE NEXT ALPAC REPORT DUE ? Margaret KING Dalle MolIe Institute for Semantic and Cognitive Studies University of Geneva Switzerland ~.~chine translation has a scme%~at checquered history. There were already proposals for autcmatic translation systems in the 30's, but it was not until aft... | 1984 | 72 |
LR Pa rse rs For Natural Languages, Masaru Tomita Computer Science Department Carnegie-Mellon University Pittsburgh, PA 15213 Abstract MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is do... | 1984 | 73 |
LFG ~ystsm in Prolog Hide~ Ya~u'~awa The Second Laboratory Institute for New Generation Computer Technology (ICOT) To~/o, 108, Japan ABSTRACT In order to design and maintain a latE? scale grammar, the formal system for representing syntactic knowledEe should be provided. Lexlca... | 1984 | 74 |
The Design of a Computer Language for Linguistic Information Stuart M. Shieber Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract A considerable body of accumulated knowledge about the design of languages for comm... | 1984 | 75 |
Discourse Structu res for Text Generation William C. Mann USC/Intorrnation Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292-6695 A bst ract Text generation programs need to be designed around a theory of text organization. This paper introduces Rhetorical Structure Theory, a theory... | 1984 | 76 |
Semantic Rule Based Text Generation Michael L. Mauldin Department of Computer Science Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 USA ABSTRACT This paper presents a semantically oriented, rule based method for single sentence text generation and discusses its implementation in the ... | 1984 | 77 |
Controlling Lexical Substitution in Computer Text Generation 1 Robert Granville MIT Laboratory for Computer Science 545 Technology Square Cambridge, Massachusetts 02139 Abstract Th=s report describes Paul, a computer text generation system desig~ed LO create cohesive text through the use o| lexlcal... | 1984 | 78 |
UNDERSTANDING OF JAPANESE IN AN INTERACTIVE PROGRAMMING SYSTEM Kenji Sugiyama I, Masayuki Kameda, Kouji Akiyama, Akifumi Makinouehi Software Laboratory Fujitsu Laboratories Ltd. 1015 Kamikodanaka, Nakahara-ku, Kawasaki 211, JAPAN ABSTRACT KIPS is an automatic programming system which gener... | 1984 | 79 |
Features and Values Lauri Karttunen University of Texas at Austin Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract The paper discusses the linguistic aspects of a new gen- eral purpose facility for computing ... | 1984 | 8 |
~%D-WAY FINITE ~ % AND D~a-I~NDENCY GRAMMAR: A PARSING METHOD ~-OR INFLECTIONAL FREE WORD ORDER LAN(~I%GES I Esa Nelimarkka, Harri J~ppinen and Aarno Lehtola Helsinki University of Technology Helsinki, Finland ARSTRACT This paper presents a parser of an inflectional fre... | 1984 | 80 |
INTERRUPTABLE TRANSITION NETWORKS Sergei Nirenburg Colgate University Chagit Attiya Hebrew University of Jerusalem ABSTRACT A specialized transition network mechanism, the interruptable transition network (ITN) is used to perform the last of three stages in a ... | 1984 | 81 |
AUTOMATIC CONSTRUCTION OF DISCOURSE REPRESENTATION STRUCTURES Franz Guenthner Universit~it Tiibingen Wilhelmstr. 50 D-7400 Tdbingen, FRG Hubert Lehmann IBM Deutschland GmbH Heidelberg Scientific Center Tiergartenstr. 15 D-6900 Heidelberg, FRG Abstract Kamp's Discourse Represent... | 1984 | 82 |
TEXTUAL EXPERTISE IN WORD EXPERTS: AN APPROACH TO TEXT PARSING BASED ON TOPIC/COMMENT MONITORING * Udo Hahn Universitaet Konstanz Informationswissenschaft ProJekt TOPIC Postfach 5560 D-7750 Konstanz i, West Germany ABSTRACT In this paper prototype versions of two word ... | 1984 | 83 |
SOME LINGUISTIC ASPECTS FOR AUTOMATIC TEXT UNDERSTANDING Yutaka Kusanagi Institute of Literature and Linguistics University of Tsukuba Sakura-mura, Ibarakl 305 JAPAN ABSTRACT This paper proposes a system of map- ping classes of syntactic structures as instruments ... | 1984 | 84 |
A SY}~ACTIC APPROACH TO DISCOURSE SEMANTICS Livia Polanyi and Remko Scha English Department University of Amsterdam Amsterdam The Netherlands ABSTRACT A correct structural analysis of a discourse is a prerequisite for understanding it. This paper sketches the outline of a discourse grammar wh... | 1984 | 85 |
DEALING WITH INCOMPLETENESS OF LINGUISTIC KNOWLEDGE IN LANGUAGE TRANSLATION TRANSFER AND GENERATION STAGE OF MU MACHINE TRANSLATION PROJECT Makoto Nagao, Toyoaki Nishida and Jun-ichi Tsujii Department of Electrical Engineering Kyoto University Sakyo-ku, Kyoto 606, JAPAN I. INTRODUCTION Lingui... | 1984 | 86 |
LEXICAL SEMANTICS IN HUMAN-COMPUTER COMMUNICATION Jarrett Rosenberg Xerox Office Systems Division 3333 Coyote Hill Road PaiD Alto, CA 94304 USA ABSTRACT Most linguistic studies of human-computer communication have focused on the issues of syntax and discourse structure. However, a... | 1984 | 87 |
A Response to the Need for Summary Responses J.K. Kalita, M.J. Colbourn + and G.I. McCalla Department of Computational Science University of Saskatchewan Saskatoon, Saskatchewan, STN 0W0 CANADA Abstract In this paper we argue that natural language inter- faces to databases should be able t... | 1984 | 88 |
Coping with Extragrarnmaticality Jalme G. Carbonell and Philip J. Hayes Computer Science Department, Carnegie-Mellon University Pittsburgh, PA 15213. USA Abstract 1 Practical natural language interfaces must exhibit robust bei~aviour in the presence of extragrammaticat user input. This paper classi... | 1984 | 89 |
APPLICATIONS OF A LEXICOGRAPHICAL DATA BASE FOR GERMAN Wolfgang Teubert Institut f~r deutsche Sprache Friedrich-Karl-Str. 12 6800 Mannheim i, West Germany ABSTRACT The Institut fHr deutsche Sprache recently has begun setting up a LExicographical DAta Base for ... | 1984 | 9 |
Correcting Object-Related Misconceptions: How Should The System Respond? t Kathleen F. McCoy Department of Computer & Inft~rmation Science University of Pennsylvania Philadelphia, PA 19104 Abstract Tills paper describes a computational method for correcting users' miseonceptioas concerning the o... | 1984 | 90 |
AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA ABSTRACT The algorithm takes as only input a llst of words, preferably but not necessarily in phonemic transcri... | 1984 | 91 |
From HOPE en I'ESPERANCE On the Role of Computational Neurolinguistics in Cross-Language Studies I Helen M. Gigley Department of Computer Science University of New Hampshire Durham, NH 03824 ABSTRACT Computational neurolinguistics (CN) is an approach to computational linguistics which in- ... | 1984 | 92 |
PANEL SESSION MACHINE-READABLE DICTIONABr~.S Donald E. Walker Natural-Language and Knowledge-Ruouree Systems SRI International Menlo Park, California 04025, USA and Artificial Intelligence and Information Science Research Bell Communicatlons Research 445 South Street Morrlstown, New ... | 1984 | 93 |
LEXICAL KNOWLEDGE BASES Robert A. Ameler Natural-Lsngu.ge and Knowledge-Resource Systems SRI International Menlo Park, California 94025, USA A lexical knowledge base is a repository of computational information about concepts intended to be generally useful in many application areas including... | 1984 | 94 |
MACHINE-READABLE DICTIONARIES, LEXICAL DATA BASES AND THE LEXICAL SYSTEM Nicoletts Calsolsri Dipartimento dl Lingu|stica, Universita dl Plsa, Pisa, ITALY Istituto di Linguistics Cornputssionsle del CNR, Piss, ITALY I should like to raise some issues concerning the conversion from ... | 1984 | 95 |
THE DICTIONARY SERVER Martin Kay Intelligent Systems Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Road Pain Alto, California 94304~ USA The term "machine-readable dictionary" can clearly be taken in two ways. In its stronger and better established interpretati... | 1984 | 96 |
HOW TO MISREAD A DICTIONARY George A. Miller Department of Psychology Princeton University Princeton, NJ 08544 A dictionary is an extremely valuable reference book, but its familiarity tends to blind adults to the high level of intelligence required to read it. This aspect becomes apparent... | 1984 | 97 |
MACHINE-READABLE COMPONENTS IN A VARIETY OF INFORMATION-SYSTEM APPLICATIONS Howard R. Webber Reference Publishing Division Houghton-Mifflln Company 2 Park Street Boston. MA 02108 Components of the machine-readable dictionary can be applied in a number of information systems. The most... | 1984 | 98 |
TRANSFER IN A MULTILINGUAL MT SYSTEM Steven Krauwer & Louis des Tombe Institute for General Linguistics Utrecht State University Trans 14, 3512 JK Utrecht, The Netherlands ABSTRACT In the context of transferbased MT systems, the nature of the intermediate represenations, and particularly thei... | 1984 | 99 |
SEHANTICS OF TEHPORAL QUERIES AND TEHPORAL DATA Carole O. Hafner College of Computer Science Northeastern University Boston, MA 02115 Abstract This paper analyzes the requirements for adding a temporal reasoning component to a natural language database query system, and proposes a computational ... | 1985 | 1 |
THE COMPUTATIONAL DIFFICULTY OF ID/LP PARSING G. Edward Barton, Jr. M.I.T. Artificial Intelligence Laboratory 545 Technology Square Caanbridge, MA 02139 ABSTRACT .\lodern linguistic theory attributes surface complexity to interacting snbsystems of constraints. ["or instance, the ID LP gr,'... | 1985 | 10 |
SOME COMPUTATIONAL PROPERTISS OF TREE ADJOINING GRAMM.~.S* K. Vijay-Shank~" and Aravind K. Jouhi Department of Computer and Information ~eience Room 288 Moore School/D2 University of Pennsylvania Philadelphia~ PA 191Ct ABSTRACT Tree Adjoining Grammar (TAG) is u formali... | 1985 | 11 |
TAG's as a Grammatical Formalism for Ceneration David D. McDonald and James D. Pus~ejovsky Departmmt of Compute~ and Information Scienc~ Un/vemty of Mam,dzm~tm at Amherst I. ~mnct Tree Adj~g Grammars, or "TAG's', (Josh/, Levy & Takahash/ 1975; Josh/ 1983; Kroch & Josh/ 1965) we~ deve... | 1985 | 12 |
MODULAR LOGIC GRAMMARS Michael C. McCord IBM Thomas J. Watson Research Center P. O. Box 218 Yorktown Heights, NY 10598 ABSTRACT This report describes a logic grammar formalism, Modular Logic Grammars, exhibiting a high degree of modularity between syntax and semantics. There ... | 1985 | 13 |
New Approaches to Parsing Conjunctions Using Prolog Sand,way Fong Robert C. Berwick Artificial hitelligence Laboratory M.I.T. 545 Technology Square C,'umbridge MA 02t39, U.S.A. Abstract Conjunctions are particularly difficult to parse in tra- ditional, phra.se-based gramniars. This paper show... | 1985 | 14 |
Parsing with Discontinuous Constituents Mark Johnson Center for the Study of Language and Information and Department of LinKuktics, StLnford University. Abstract By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous consti- t... | 1985 | 15 |
Structure Sharing with Binary Trees Lauri Karttunen SRI International, CSLI Stanford Martin Kay Xerox PARC, CSU Stanford Many current interfaces for natural language represent syntactic and semantic information in the form of directed graphs where attributes correspond to vectors ... | 1985 | 16 |
A Structure-Sharing Representation for Unification-Based Grammar Formalisms Fernando C. N. Pereira Artificial Intelligence Center, SRI International and Center for the Study of Language and Information Stanford University Abstract This paper describes a structure-sharing ... | 1985 | 17 |
Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms Stuart M. Shieber Artificial Intelligence Center SRI International and Center for the Study of Language and Information Stanford University Abstract 1 Introduction Grammar formalisms based on the encodin... | 1985 | 18 |
Semantic Caseframe Parsing and Syntactic Generality Philip J. Hayes. Peggy M. Andersen. and Scott Safier Carnegie Group Incorporated Commerce Court at Station Square Pittsburgi'~. PA 15219 USA Abstract We nave implemented a restricted .:lommn parser called Plume "M Buildi... | 1985 | 19 |
TEMPORAL I]~'RRI~C~S IN HEDICAL TEXTS Klaus K. Obermeier BatteIle's Columbus Laboratories 505 K~ng Avenue CoLumbus, Oh£o 43201-2693, USA ABSTRACT The objectives of this paper are twofold, whereby the computer program is meant to be a particular implementation of a g... | 1985 | 2 |
MOVEMENT IN ACTIVE PRODUCTION NETWORKS Mark A. Jones Alan S. Driacoll AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT We describe how movement is handled in a class of computational devices called active production networks (APNs). The APN model is a parallel, activation-basod f... | 1985 | 20 |
PARSING HEAD-DRIVEN PHRASE STRUCTURE GRAMMAR Derek Proudlan and Carl Pollard Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA. 94303, USA Abstract The Head-driven Phrase Structure Grammar project (HPSG) is an English language database query system under development at H... | 1985 | 21 |
A Computational Semantics for Natural Language Lewis G. Creary and Carl J. Pollard Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304, USA Abstract In the new Head-driven Phrase Structure Grammar (HPSG) language processing system that is currently under development at Hew... | 1985 | 22 |
ANALYSIS OF OONOUNCTIONS IN A ~JLE-~ PAKSER leonardo L~smo and Pietro Torasso Dipartimento di Informatica - Universita' di Torino Via Valperga Caluso 37 - 10125 Torino (ITALY) ABSTRACT The aim of the present paper is to show how a rule-based parser for the Italian language has been extended to a... | 1985 | 23 |
A PRAGMATIC~BASED APPROACH TO UNDERSTANDING INTERS~NTENTIAL ~LIPSI~ Sandra Car berry Department of Computer and Information Science University of Delaware Nevark, Delaware 19715, U3A ABSTRACT IntersententAal eAlipti caA utterances occur frequently in information-seeking dielogues. This ... | 1985 | 24 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.