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: Parsing without lexicon: the MorP system
MorP is a system for automatic word class assignment on the basis of surface features. It has a very small lexicon of form words (%o entries), and for the rest works entirely on morphological and configurational patterns. This makes it robust and fast, and in spite of the (deliberate) restrictedness of the system, its performance reaches an average accuracy level above 91% when run on unrestricted Swedish text. K e y w o r d s : parsing, morphology. The development of the parser to be presented has been supported by the Swedish Research Council for the Humanities. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: INTEGRATING TEACHING THE ENGLISH TENSE: NAIVE AND FORMAL GRAMMARS IN AN INTELLIGENT TUTOR FOR FOREIGN LANGUAGE TEACHING
A basic problem that must be dealt with in order to build an intelligent tutoring system (ITS) in the domain of foreign language teaching is that of establishing what kind of grammatical knowledge has to be included in the domain expert module. Two basic options are possible: (i) to use a naive or pedagogical grammar, comprising knowledge derived from textbooks and school grammars or (ii) to use one of the formal grammars developed by theoretical and computational linguists.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: THE RECOGNITION CAPACITY OF LOCAL SYNTACTIC CONSTRAINTS
Givcn a grammar for a language, it is possible to create finite state mechanisms that approximate its recognition capacity. These simple automata consider only short context information~ drawn from local syntactic constraints which the grammar hnposes. While it is short of providing the strong generative capacity of the grammar, such an approximation is useful for removing most word tagging ambiguities, identifying many cases of iU-fonncd input, and assisting efficiently in othcr natural language processing tasks. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Generating Referring Expressions Involving Relations
The core of the problem is finding a way of describing the intended referent that distinguishes it from other potential referents with which it might be confused. We refer to this problem as the c o n t e n t d e t e r m i n a t i o n task. In this paper, we point out some limitations in an earlier solution proposed in Dale [1988, 1989], and discuss the possibilites of extending this solution by incorporating a use of constraints motivated by the work of Haddock [1987, 1988].
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: COORDINATION INUNIFICATION-BASED GRAMMARS
Within unification-based grammar formalisms, providing a treatment of cross-categorial coordination is problematic, and most current solutions either over-generate or under-generate. In this paper we consider an approach to coordination involving composite feature structures, which describe coordinate phrases, and present the augmentation to the logic of feature structures required to admit such feature structures.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: The Formal and Processing Models of CLG
In this paper we present the tormal processing model of CLG, which has been influenced by the Constraint Logic Programming paradigm 18] 191. We show in what way it extends pure unilication based formalisms and how it achieves a sound implementation of classically interpreted first order logic while m a i n t a i n i n g practical computational behaviour by resorting to a simple set of constraint rewrite rules and a lazy evaluation model for constraints satisfaction thus avoiding the problem mentioned in I10] concerning the non-monotonic properties of negation and implication intcrpretcd in the...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Prediction in Chart Parsing Algorithms for Categorial Unification Grammar
Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In this paper we present a lexicalist prediction technique for CUG and show thai this may lead to considerable gains in efficiency for both bottom-up and top-down parsing. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Multiple Interpreters in a Principle-Based Model of Sentence Processing
This paper describes a computational model of human sentence processing based on the principles and parameters paradigm of current linguistic theory. The syntactic processing model posits four modules, recovering phrase structure, long-distance dependencies, coreference, and thematic structure. These four modules are implemented as recta-interpreters over their relevant components of the grammar, permitting variation in the deductive strategies employed by each module.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: EXPLOITING CONVERSATIONAL IMPLICATURE FOR GENERATING CONCISE EXPLANATIONS
This paper presents an approach for achieving conciseness in generating explanations, which is clone by exploiting formal reconstructions of aspects of the Gricean principle of relevance to simulate conversational implicature. By applying contextually motivated inference rules in an anticipation feed-back loop, a set of propositions explicitly representing an explanation's content is reduced to a subset which, in the actual context, can still be considered to convey the message adequately.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: SEMANTIC FEATURES AND SELECTION RESTRICTIONS
One of the essential aspects is described of an expert system (called LEXICOGRAPItER), designed to supply the user with diverse brformation about Russian words, h~cluding bibliographic hiformation concemhrg hrdividual lexical entries. Tire lexical database of tire system contahrs semantic btfonnation that catmot be elicited from the existhrg dictionaries. Tire priority is given to semantic features influenchtg lexical or grammatical co-occurrence restrictions. Possibilities are discussed of predicting selectional restrictions on the basis of semantic features of a word bz the lexicon. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: PROOF FIGURES AND STRUCTURAL OPERATORS FOR CATEGORIAL GRAMMAR
Use of Lambek's (1958) categorial grammar for linguistic work has generally been rather limited. There appear to be two main reasons for this: the notations most commonly used can sometimes obscure the structure of proofs and fail to clearly convey linguistic structure, and the cMculus as it stands is apparently not powerful enough to describe many phenomena encountered in natural language. In this paper we suggest ways of dealing with both these deficiencies.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: CLASSICAL LOGICS FOR ATTRIBUTE-VALUE
This paper describes a classical logic for attribute-value (or feature description) languages which ate used in urfification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). Tile algorithm which is used for deciding satisfiability of a feature description is based on a restricted deductive closure construction for sets of literals (atomic formulas and negated atomic formulas). In contrast to the Kasper/Rounds approach (cf. [Kasper/Rounds 90]), we can handle cyclicity, without the need for the introduction of complexity norms, as in [Johnson 88J and [Beierle/Pletat 88]. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Computational Aspects of M-grammars
In this paper M-grammars t h a t are used in the Rosetta translation system will be looked at as the specification of a t t r i b u t e grammars. We will show t h a t the a t t r i b u t e evaluation order is such t h a t instead of the special-purpose parsing and generation algorithms introduced for M-grammars in Appelo et al.(1987), also Earley-like context-free parsing and ordinary generation strategies can be used. Furthermore, it is illustrated t h a t the a t t r i...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: The Semantics of Collocational Patterns for Reporting
One of the hardest problems for knowledge extraction from machine readable textual sources is distinguishing entities and events that are part of the main story from those that are part of the narrative structure, hnportantly, however, reported sl)eech in newspaper articles explicitly links these two levels. In this paper, we illustrate what the lexical semantics of reporting verbs must incorporate in order to contribute to the reconstruction of story and context.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AUTOMATIC SEMANTIC CLASSIFICATION OF VERBS FROM THEIR
This paper discusses an implemented program that automatically classifies verbs into those that ~describe only states of the world, such as to know, and those that describe events, such as to look. It works by exploiting the con, straint between the syntactic environments in which a verb can occur and its meaning. The only input is on-line text. This demonstrates an important new technique for the automatic generation of lexical databases.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AN ASSESSMENT EXTRACTED OF SEMANTIC INFORMATION FROM MACHINE READABLE AUTOMATICALLY DICTIONARIES
In this paper we provide a quantitative evaluation of information automatically extracted from machine readable dictionaries. Our results show that for any one dictionary, 55-70% of the extracted information is garbled in some way. However, we show that these results can be dramatically reduced to about 6% by combining the information extracted from five dictionaries. It therefore appears that even if individual dictionaries are an unreliable source of semantic information, multiple dictionaries can play an important role in building large lexical-semantic databases. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A DIALOGUE MANAGER USING INITIATIVE-RESPONSE UNITS AND DISTRIBUTED CONTROL
This paper describes a system for managing: dialogue in a natural language interface. The proposed approach uses a dialogue manager as the overall control mechanism. The dialogue manager accesses domain independent resources for interpretation, generation and background system access. It also uses information from domain dependent knowledge sources, which are customized for various applications. Instead of using complex plan-based reasoning, the dialogue manager uses information about possible interaction structures and information from the specific dialogue situation to manage the dialogue. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Modelling Knowledge for a Natural Language Understanding System
In the field of knowledge based systems for natural language processing, one of the most challenging aims is to use parts of an existing knowledge base for different domains and/or different tasks. We support the point that this problem can only be solved by using adequate metainformation about the content and structuring principles of the representational systems concerned. One of the prerequisites in this respect is the transparency of modelling decisions.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A BIDIRECTIONAL MODEL FOR NATURAL LANGUAGE PROCESSING
In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS
This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and construction functions. Thus, the algorithm is interesting for a modular linguistic theory, which is flexible with respect to syntactic and semantic framework. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: HELPFUL ANSWERS TO MODAL AND tlYPOTHETICAL QUESTIONS
This paper describes a computational pragmatic model which is geared towards providing helpful answers to modal and hypothetical questions. The work brings together elements from f o n n a l . semantic theories on modality m~d question answering, defines a wkler, pragmatically flavoured, notion of answerhood based on non-monotonic inference aod develops a notion of context, within which aspects of more cognitively oriented theories, such as Relevance Theory, can be accommodated.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: THE TEXTUAL DEVELOPMENT OF NON-STEREOTYPIC CONCEPTS
The basic premise of the KONTEXT model is that new concepts are communicated by using the mechanisms of text constitution. The text model used assumes that the information conveyed in a text and the information describing its contextual organization can be structured into five layers (sentence structure, information on thematic progression, referential structure, conceptual representation of the text and conceptual background knowledge).
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: LIMITS OF A SENTENCE BASED PROCEDURAL APPROACH FOR ASPECT CHOICE IN GERMAN-RUSSIAN MT
In this paper we discuss some problems arising in German-Russian Machine Translation with regard to tense and aspect. Since the formal category of aspect is missing in German the information required for generating Russian aspect forms has to be extracted from different representation levels. A sentence based procedure for aspect choice in the MT system VIRTEX is presented which takes lexieal, morphological and semantic criteria into account. The limits of this approach are shown. To overcome these difficulties a human interaction component is proposed. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Lexical Transfer based on bilingual signs: Towards interaction during transfer
The lexical transfer phase is the most crucial step in MT because most of difficult problems are caused by lexical differences between two languages. In order to treat lexical issues systematically in transfer-based MT systems, we introduce the concept of bilingual-sings which are defined by pairs of equivalent monolingual signs. The bilingual signs not only relate the local linguistic structures of two languages but also play a central role in connecting the linguistic processes of translation with knowledge based inferences. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A PREFERENCE MECHANISM BASED ON MULTIPLE CRITERIA RESOLUTION
This paper presents an experimental preference tool des!gned, implemented and tested m the Eurotra pro)ect. The mechanism is based on preference rules which can either compare subtrees pairwise or single out a subtree on the basis of some specified constraints. Scoring permits combining the effects of various preference rules.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A Language for the Statement of Binary Relations over Feature Structures
Unification is often the appropriate method for expressing relations between representations in the form of feature structures; however, there are circumstances in which a different approach is desirable. A declarative formalism is presented which permits direct mappings of one feature structure into another, and illustrative examples are given of its application to areas of current interest.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION
Kaplan et al (1989) present an approach to machine translation based on co-description. In this paper we show that the notation is not as natural and expressive as it appears. We first show that the most natural analysis proposed in Kaplan et al (1989) cannot in fact cover the range of data for the important translational phenomenon in question. This contribution extends the work reported on in Sadler et al (1989) and Sadler et al (1990). We then go on to discuss alternatives which depart from or extend the formalism proposed in Kaplan et al (1989) in various...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: An Extension of Earley's Algorithm for S-Attributed Grammars
Attribute grammars are an elegant formalization of the augmented context-free grammars characteristic of most current natural language systems. This paper presents an extension of Earley's algorithm to Knuth's attribute grammars, considering the case of S-attributed grammars. For this case, we study the conditions on the underlying base grammar under which the extended algorithm may be guaranteed to terminate. Finite partitioning of attribute domains is proposed to guarantee the termination of the algorithm, without the need for any restrictions on the context-free base. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: TOWARDS A CORE VOCABULARY FOR SYSTEM A NATURAL LANGUAGE
The desire to construct robust and portable natural language systems has led to research o n how a core vocabulary for such systems can be defined. Stalistical methods and semantic criteria for doing this arc discussed and compared. Currcnlly it docs not seem possible to precisely define the notion of core vocabulary, but it is argued that workable criteria can nevertheless be ['o1.1110. l:inally it is emplmsized that the implementation of a core vt~cabulary must be seen as a long-range research prt~gram rather than as a short-term goal. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: SUBLANGUAGES IN MACHINE TRANSLATION
There have been various attempts at using the sublanguage notion for disambiguation and the selection of target language equivalents in machine translation. In this paper a theoretical concept and its implementation in a real MT application are presented. Above this, means of linguistic engineering like weighting mechanisms are proposed.
8/30/2018 3:08:10 AM +00:00