Tài liệu miễn phí Báo cáo khoa học
Download Tài liệu học tập miễn phí Báo cáo khoa học
Báo cáo khoa học: AN EXPERIMENT WITH HEURISTIC PARSING OF SWEDISH
carriers of semantic Information - were substituted for by a mere -, whereas other formatives were left in their original shape and place. These transformed texts were presented to subjects who w e r e a s k e d to fill in the gaps in such a w a y that the texts thus obtained were to be both syntactically correct and reasonably coherent. The result of the e x p e r i m e n t was r a t h e r astonishing.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: TOWARDS THE SEMANTICS OF SINTENCE AYVERBIALS
In the present paper we argue that the so-called sentence adverbials (typically, adverbs like probably, admittedly,...) should be generated, in the framework of Functional Generative Description, by means of a special deep case - Complementation of Attitude (CA) on grounds of their special behaviour in the topic-focus articulation (TFA) of a sentence. From the viewpoint of the translation of CA expressions (and also of the multiple occurrence thereof inside a sentence) into a calculus of intensional logic, it should be noted that the TFA properties of CA expressions are directly correlated to the scope properties thereof. Our approach, which...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: FALLIBLE RATIONALISM AND MACHINE TRANSLATION
Grammars embodying the CSDC are incorporated into an existing A~{ parser, and are tested successfully against a wide group of and conjunctive sentences, which are of three types, namely clausal coordination, phrasal coordination, and gapping. With phrasal coordination the structure with two NPs coordinated by and has been given most attention.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: THE GENERATION OF TERM DEFINITIONS FROM AN ON-LINE TECHNOLOGICA
A new type of machine dictionary is described, which uses terminological relations to build up a semantic network representing the terms of a particular subject field, through interaction with the user. These relations are then used to dynamically generate outline definitions of terms in on-line query mode. The definitions produced are precise, consistent and informative, and allow the user to situate a query term in the local conceptual ~vironment. The simple definitions based on terminological relations are supplemented by information contained in facets and modifiers, which allow the user to capture different views of the data. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: RELATING SYNTAX AND SEMANTICS: THE SYNTACTICO-SEMANTIC LEXICON OF THE SYSTEM VIE-LANG
This paper describes the structure and e v a l u a t i o n of the s y n t a c t i c o - s e m a n t i c lexicon (SSL) of the German Natural Language Understanding System VIE-LANG [3]. VIE-LANG uses an SI-Net [2] as internal r e p r e s e n t a t i o n . The SSL c o n t a i n s the rules according to which the mapping between net-structures and surface s t r u c t u r...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Fifth Conference of the European Chapter of the Association for Computational Linguistics
The preparation of the Fifth Conference of the European Chapter of the Association for Computational Linguistics was done, without doubt, under extraordinary circumstances. To characterize the situation one only has to remember that since the Manchester conference there have been four governments on the territory of the former GDR, differing in every imaginable respect. The change in autumn 1989 and the unification on 3 October 1990 - the two outstanding events - were accompanied by an immense number of radical political, economic, and social changes which were not without consequences on the preparation of this conference. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Towards A. ZAMPOLLI Reusable Linquistic
The paper will try to identify the various concurrent factors which, in the last years, have contributed to the increasing attention paid to the issue of reusable linguistic resources for natural language processing. The role of various major Organisations (EEC, Council of Europe, DARPA, NEH, etc.) will be examined, taking into account the reasons which seem to have stimulated their active participation. The recognition of the need of reusable linguistic resources by various sectors of automated linguistic data processing will also be considered as a catalyzer for the recent trend towards the cooperation of various scientific and professional A...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: COMPARATIVES AND ELLIPSIS
This paper analyses the syntax and semantics of English comparatives, and some types of ellipsis. It improves on other recent analyses in the computational linguistics literature in three respects: (i) it uses no tree- or logical-form rewriting devices in building meaning representations (ii) this results in a fully reversible linguistic description, equally suited for analysis or generation (iii) the analysis extends to types of elliptical comparative not elsewhere treated. INTRODUCTION Many treatments of the English comparative construction have been advanced recently in the computational linguistics literature (e.g. Rayner and Banks, 1989; Ballard, 1988). ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: DESIGNING ILLUSTRATED TEXTS: HOW LANGUAGE PRODUCTION IS INFLUENCED BY GRAPHICS GENERATION
Multimodal interfaces combining, e.g., natural language and graphics take advantage of both the individual strength of each communication mode and the fact that several modes can be employed in parallel, e.g., in the text-picture combinations of illustrated documents. It is an important goal of this research not simply to merge the verbalization results of a natural language generator and the visualization results of a knowledge-based graphics generator, but to carefully coordinate graphics and text in such a way that they complement each other. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A Probabilistic
This i)al)er describes a Ilatural language i)ars ing algorith,n for unrestricted text which uses a prol)al)ility-I~ased scoring function to select the l)est i)arse of a sclfl,ence. The parser, T~earl, is a time-asynchronous I)ottom-ul) chart parser with Earley-tyl)e tol)-down prediction which l)ur sues the highest-scoring theory iu the chart, where the score of a theory represents tim extent t o which the context of the sentence predicts that interpretation.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Long-Distance Scrambling and Tree Adjoining Grammars
Scrambling, both local and long-distance, has recently attracted considerable attention among linguists and computational linguists. In this paper, we will explore the adequacy of the Tree Adjoining Grammar (TAG) formalism for dealing with long-distance scrambling I in German. We will show that TAGs cannot capture the full range of constructions derived by scrambling. I[owever, Multi-Component TAGs (MC-TAG), an extension of TAGs introduced earlier [Joshi 1987a, Weir 1988] and utilized for linguistic purposes (e.g. for extraposition [Kroch and Joshi 1986]), can indeed capture the full range of constructions derived by scrambling. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: it works bottom-up from the lexical anchors and then expands (partial) analyses making top-down predictions. Even if such an algorithm does not improve tim worst-case time bounds of already known TAGs parsing methods, it could be relevant from the perspective of linguistic information processing, because it employs lexical information in a more direct...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: HORN EXTENDED FEATURE STRUCTURES: FAST UNIFICATION WITH NEGATION AND LIMITED DISJUNCTION
The notion of a Horn extended feature structure (HoXF) is introduced, which is a feature structure constrained so that its only allowable extensions are those satisfying some set of llorn clauses in featureterm logic, l l o X F ' s greatly generalize ordinary feature structures in admitting explicit representation of negative and implicational constraints. In contradistinction to the general case in which arbitrary logical constraints are allowed (for which the best known algorithms are exponential), there is a highly tractable algorithm for the unification of HoXF's. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: INDEXING AND REFERENTIAL DEPENDENCIES WITHIN BINDING THEORY: A COMPUTATIONAL FRAMEWORK
This work is concerned with the development of instruments for GB parsing. An alternative to the well known indexation system of (Chomsky, 1981) will be proposed and then used to formalize the view of Binding Theory in terms of the generation of constraints on the referential properties of the NPs of a sentence. Finally the problems of verification and satisfiability of BT will be addressed within the proposed framework.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: ON THE SYNTACTIC-SEMANTIC OF BOUND ANAPHORA ANALYSIS
Two well-known phenomena in the area of pronoun binding are considered: Indirect binding of pronouns by indefinite NPs (donkey sentences) and surfacesyntactic constraints on binding (weak cross-over). A common t r e a t m e n t is proposed, and general consequences for the relation between syntactic and semantic processing are discussed. It is argued that syntactic and semantic analysis must interact in a complex way, rather than in a simple sequential or strict rule-to-rule fashion.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AN INDEXING TECHNIQUE FOR IMPLEMENTING COMMAND RELATIONS
Command relations are important tools in linguistics, especially in a n a p h o r a theory. In this paper I present an indexing technique which allows us to implement a simple and efficient check for most cases of c o m m a n d relations which have been presented in linguistic literature. I also show a wide perspective of applications for the indexing technique in the implementation of other linguistic phenomena in syntax as well as in semantics.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Processing Language with Logical Types and Active Constraints
In this document, we present a language which associates type construction principles to constraint logic programming. We show that it is very appropriate for language processing, providing more uniform, expressive and efficient tools and treatments. We introduce three kinds of constraints, that we exemplify by motivational examples. Finally, we give the procedural semantics of our language, combining type construction with SLDresolution.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Non-deterministic Recursive Ascent Parsing
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. Memo-functions also facilitate a simple way to construct a very compact representation of the parse forest.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES
This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere. As a result, it constructs a minimal size of GOTO/ACTION table and eliminates the necessity of search for GOTO table entries during parsing.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A COMPUTATIONAL MODEL OF THE SYNTAX-PROSODY INTERFACE IN TOKYO JAPANESE
What is the relationship between syntax, prosody and phonetics? This paper argues for a declarative constraint-based theory, in which each step in a derivation adds diverse constraints to a pool. Some of these describe well formed objects in the feature structure domain, in terms of both syntactic and prosodic features. Some characterise the relative prominence of constituents as a partial order over some discrete domain (playing the role of metrical grid). Some are simultaneous equations in the reals, whose solutions represent the pitch level of phonetic objects - high and low tones....
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A TASK INDEPENDENT ORAL DIALOGUE MODEL
This paper presents a human-machine dialogue model in the field of task-oriented dialogues. The originality of this model resides in the clear separation of dialogue knowledge from task knowledge in order to facilitate for the modeling of dialogue strategies and the maintenance of dialogue coherence. These two aspects are crucial in the field of oral dialogues with a machine considering the current state of the art in speech recognition and understanding techniques.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A LOGICAL APPROACH TO ARABIC PHONOLOGY
Logical approaches to linguistic description, particularly those which employ feature structures, have generally treated phonology as though it was the same as orthography. This approach breaks down for languages where the phonological shape of a morpheme can be heavily dependent on the phonological shape of another, as is the case in Arabic. In this paper we show how the tense logical approach investigated by Blackburn (1989) can be used to encode hierarchical and temporal phonological information of the kind explored by Bird (1990). ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A UNIFIED MANAGEMENT AND PROCESSING OF WORD-FORMS, IDIOMS AND ANALYTICAL COMPOUNDS
The paper presents a morpho-lexical environment, designed for the management of rootoriented natural language dictionaries. It also encapsulates the basic morpho-lexical processings: analysis and synthesis of individual word-forms or compounds (idioms and analytic constructions).
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Analysis of Unknown Words through Morphological Decomposition
This paper describes a method of analysing words through morphological decomposition when the lexicon is incomplete. The method is used within a text-to-speech system to help generate pronunciations of unknown words. The method is achieved within a general morphological analyser system using Koskenniemi twolevel rules.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AUTOMATIC LEARNING OF WORD TRANSDUCERS FROM EXAMPLES
These two tasks are in fact closely related in that {I) the correct phoneme transcription may mirror an underlying morphological structure, like for asoc/a/ whose phonemic form is asos j a l rather than a .
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: FROM STRUCTURE-DRIVEN SEPARATE SEMANTIC GENERATION REPRESENTATIONS
A new approach to structure-driven generation is I)resented that is based on a separate semantics as input structure. For the first time, a GPSGbased formalism is complemented with a system of pattern-action rules that relate the parts of a semantics to appropriate syntactic rules. This way a front end generator can be adapted to some application system (such as a machine translation system) more easily than would be possible with many previous generators based on modern grammar formalisms.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: USING PLAUSIBLE INFERENCE RULES IN DESCRIPTION PLANNING
Current approaches to generating multi-sentence text fail to consider what the user may infer from the different statements in a description. This paper presents a system which contains an explicit model of the inferences that people may make from different statement types, and uses this model, together with assumptions about the user's prior knowledge, to pick the most appropriate sequence of utterances for achieving a given communicative goal.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Generating Sentences from Different Perspectives
Certain pairs or groups of sentences appear to be semantically distinct, yet specify the same underlying state of affairs, from different perspectives. This leads to questions about what that underlying state of affairs might be, and, for generation, how and why the alternative expressions might be produced. This paper looks at how such sentences may be generated in a Natural Language interface to a database system.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: PROSODIC INHERITANCE AND MORPHOLOGICAL GENERALISATIONS
Prosodic Inheritance (PI) morphology provides uniform treatment of both concatenative and non-concatenative morphological and phonological generalisations using default inheritance. Models of an extensive range of German Umlaut and Arabic intercalation facts, implemented in DATR, show that the PI approach also covers 'hard cases' more homogeneously and more extensively than previous computational treatments.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: DATR AS A LEXICAL COMPONENT FOR PATR
One advantage of this bundled information is its reusability, which allows redundancy to be reduced. The representation of lexical information should enable us to express a further kind of generalization, namely the relations between regularity, subregularity, and irregularity. Furthermore, the representation has to be computationaUy tractable and -- possibly with the addition ofsyntactic sugar -- more or less readable for human users.
8/30/2018 3:08:10 AM +00:00