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: FORMALISMS FOR MORPHOGRAPHEMIC
Recently there has been some interest in rule formaltsms for describing morphologically significant regularities in orthography of words, largely influenced b y the w o r k of Koskenniemi. Varioue implementationa of these rules are possible, but there are some weaknesses in the formalism as it stands. An alternative specification formalism is possible which solves some of the problems. This new formalism can be viewed as a variant of the pure' Koskenniemi model w i t h certain conetraints relaxed. The new formalism has particular advantages for multiple cheLracter changes. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: MORPHOLOGY in the EUROTRA BASE LEVEL CONCEPT
Finnish by establishing correspondences between a surface alphabet and a lexical alphabet (the two levels) and using a lexicon to determine which combinations of characters and morphemes are legal. Moreover, this is done by means of declarative rules, thereby avoiding the procedural problems of generative phonology, and the algorithm used is language independent.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: A MORPHOLOGICAL PROCESSOR FOR MODERN GREEK
In this paper, we present a morphological processor for Modern Greek. From the linguistic point of view, we tr5, to elucidate the complexity of the inflectional system using a lexical model which follows the mecent work by Lieber, 1980, Selkirk 1982, Kiparsky 1982, and others. The implementation is based on the concept of validation grammars (Coumtin 1977). The morphological processing is controlled by a finite automaton and it combines a. a dictionary containing the stems for a representative fragment of Modern Greek and all the inflectional affixes with b. a grammar which camries out the transmission of the linguistic...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: A GENERATIVE GRAMMAR APPROACH FOR THE MORPHOLOGIC AND MORPHOSYNTACTIC ANALYSIS OF ITALIAN
A morphologic and morphosyntactic analyzer for the Italian language has been implemented in VM/Prolog 131 at the IBM Romc Scientific Center as part of a project on text understanding. Aim of this project is the development of a prototype which analyzes short narrative texts (press agency news) and gives a formal representation of their meaning as a set of first order logic expressions. Question answering features are also provided. The morphologic analyzer processes every word by means of a context free grammar, in order to obtain its morphologic and syntactic characteristics. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: HOW TO DETECT GRAMMATICAL ERRORS IN A TEXT WITHOUT PARSING IT
The Constituent Likelihood Automatic Word-tagging System (CLAWS) was originally designed for the low-level grammatical analysis of the million-word LOB Corpus of English text samples. CLAWS does not attempt a full parse, but uses a firat-order Markov model of language to assign word-class labels to words. CLAWS can be modified to detect grammatical errors, essentially by flagging unlikely word-class transitions in the input text. This may seem to be an intuitively implausible and theoretically inadequate model of natural language syntax, but nevertheless it can successfully pinpoint most grammatical errors in a text. Several modifications to CLAWS have been explored....
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: AUTOMATED REASONING ABOUT NATURAL LANGUAGE CORRECTNESS
Automated R e a s o n i n g techniques applied to the p r o b l e m of natural language correctness allow the d e s i g n of flexible training aids for the t e a c h i n g of foreign languages. The approach involves important advantages for both the student and the teacher by d e t e c t i n g possible errors and pointing out their reasons. Explanations may be given on four d i s t i n c t levels, thus offering differently instructive error messages according to the needs of the student.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: TOWARDS AN INTEGRATED ENVIRONMENT FOR SPANISH DOCUMENT VERIFICATION AND COMPOSITION
Languages other than English have received little attention as far as the application of natural language processing techniques to text composition is concerned. The present paper describes briefly work under development aiming at the design of an integrated environment for the construction and verification of documents written in Spanish. in a first phase, a dictionary of Spanish has been implemented, together with a synonym dictionary.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: A TOOL FOR THE AUTOMATIC CREATION, EXTENSION OF LEXICAL KNOWLEDGE
A tool is described which helps in the creation, extension and updating of lexical knowledge bases (LKBs). Two levels of representation are distinguished: a static storage level and a dynamic knowledge level. The latter is an object-oriented environment containing linguistic and lexicographic knowledge. At the knowledge level, constructors and filters can be defined. Constructors are objects which extend the LKB both horizontally (new information) and vertically (new entries) using the linguistic knowledge. Filters are objects which derive new LKBs from existing ones thereby optionally changing the storage structure. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: TEXT UNDERSTANDING WITH MULTIPLE KNOWLEDGE SOURCES: AN EXPERIMENT IN DISTRIBUTED PARSING
A novel approach to the problem of text understanding is presented, which exploits a distributed processing concept, where knowledge from different sources comes into play in the course of comprehension. In the paper the rationale of advocating such an approach and the.advantages in following it are discussed. A prototype parser based on an original distributed problem-solving architecture is presented. It encompasses a centralized declarative control module and a collection of decentralized, loosely coupled, heterogeneous problem solvers specialized in the vadous facets of the parsing task. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: AN AUTOMATIC SPEECH RECOGNITION SYSTEM FOR ITALIAN LANGUAGE
An automatic speech recognition system for Italian language has been developed at IBM Italy Scientific Center in Rome. It is able to recognize in real time natural language sentences, composed with words from a dictionary of 6500 items, dictated by a speaker with short pauses among them. The system is speaker dependent, before using it the speaker has to perform the training stage reading a predefined text 15-20 minutes long. It runs on an architecture composed by an IBM 3090 mainframe and a PC/AT based workstation with signal processing equipments. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: MULTILEVEL SEMANTIC ANALYSIS IN AN AUTOMATIC SPEECH UNDERSTANDING AND DIALOG SYSTEM
At our institute a speech understanding and dialog system is developed. As an example we model an information system for timetables and other information about intercity trains. In understanding spoken utterances, additional problems arise due to pronunciation variabilities and vagueness of the word recognition process. Experiments so far have also shown that the syntactical analysis produces a lot more hypotheses instead of reducing the number of word hypotheses. The reason for that is the possibility o! combining nearly every group of word hypotheses which are adjacent with respect to the speech signal to a syntactically correct constituent. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: STOCHASTIC MODELING OF LANGUAGE VIA SENTENCE SPACE PARTITIONING
In some computer applications of linguistics (such as maximum-likelihood decoding of speech or handwriting), the purpose of the language-handling component (Language Model) is to estimate the linguistic (a priori) probability of arbitrary natural-language sentences. This paper discusses theoretical and practical issues regarding an approach to building such a language model based on any equivalence criterion defined on incomplete sentences, and experimental results and measurements performed on such a model of the Italian language, which is a part of the prototype for the recognition of spoken Italian built at the IBM Rome Scintific Center. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: DICTIONARY ORGANIZATION FOR MACHINE TRANSLATION: THE EXPERIENCE AND IMPLICATIONS OF THEUMIST JAPANESE PROJECT
It is implemented in Prolog,ln the interests of rapid prototyping, but intended for later optimization. For development purposes we are using an existing corpus of i0,000 words of continuous prose from the PERQ's graphics documentation; in the long term,the system will be extended for use by technical writers in fields other than software, and possibly to other languages. At the time of writing, we have welldeveloped system development software, user interface, grammar and dictionary handling facilities, including dictionary entry in kanji, and a range of formats for output of linguistic representations and Japanese text. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: MACHINE TRANSLATION, LINGUISTICS, AND INTERLINGUA
never has been based needs of translating in theoretiwith the 2. The requirements as a background follows: (a~ Adequacy: relatively the structure tual knowledge The theory should underlie reflecting facSince humans diftheory as for MT can be summarized and mostly has not been Outside the U.S.A., Grenoble, with broad interest of G.E.T.A., cal background. the exception research projects groups; project projects search.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: FAIL-SOFT EMERGENCY MEASURES IN A PRODUCTION-ORIENTED MT SYSTEM
that the end-user expects to have at his disposal a complete text rather than an alternating sequence of ~sentence) segments look and blanks. On the other hand, everyone involved in MT would agree fice for such a system to be applicable information a c q u i s i t i o n and would be capable to meet the main r e q u i r e m e n t s by average users. 2.1 The specific purposes of the system of fail-soft Cemergency) measures to and set up who has ever made even a p e...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: REFTEX -A CONTEXT-BASED TRANSLATION AID
We leave aside a discussion special device has been introduced to overcome such an abnormal end: nating such a defective the program processing phase and continues rules that compensate preferential instead of elimiis suspended string, the appllcathis string skips the for the lacuna can be of the u n i f i c a t i o n of o r t h o g r a p h y ways of spelling, scribed here.) general rules ing rules) as American and British usage, different use of hyphens etc. which comes before the first device decharacter: sweep-tion of the phase...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: AN NT SYSTEM BETWEEN CLOSELY RELATED LANGUAGES
A project of machine Czech computer manuals described, description of the presenting translation into Russian first overall and a of is a system mainly parsing parser in cooperation with Mathematical Mathematics University, Department Physics, Charles structure and c o n c e n t r a t i n g then on input text preparation algorithm programmed based on bottom-up Input texts in olmerauer's Q-systems. The texts our system should translate are software manuals DOS-4 operating to V~MS-developed which is an DOS. on system the and advanced extension to common maintained. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: Subgrammars, Rule Classes and Control in the Rosetta Translation System
The paper discusses a recent extension of the linguistic framework of the Rosetta system. The original framework is elegant and has proved its value in practice, but it also has a number of deficiencies, of which the most salient is the impossibility to assign an explicit structure to the grammars. This may cause problems, especially in a situation where large grammars have to be written by a group of people. The newly developed framework enables us to divide a grammar into subgrammars in a linguistically motivated way and to control explicitly the application of rules in a subgrammar. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: A MODEL FOR PREFERENCE
In this paper we address the problem of choosing the best solution(s) from a set of interpretations of the same object (in our case a segment of text). A notion of preference is stated, based on pairwise comparisons of complete interpretations in order to obtain a partial order among the competing interpretations. An experimental implementation is described, which uses Prolog-like preference statements.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: Parsing into Discourse Object Descriptions
This paper reports work on the design of a natural language interface with a limited dialogue capability. It is argued that (i) The interpretation of the input is preferably represented as a structure of Discourse Object Descriptions (DODs); (ii) The DODs must be determined on the basis of different types of knowledge such as grammatical knowledge, object type deirmitions and knowledge about existing discourse objects and their discourse status; (iii) The different types of knowledge are stored separately but integrated in the interpretation process which is based on constraints. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: DESCRIPTIONAL ANAPHORA IN DISCOURSE REPRESENTATION THEORY
Standard Discourse Representation Theory (DRT) was designed mainly to explain the so-called donkey-sentences. The pronouns plaYing such a prominent role in all these sentences belong, however, exclusively to one (partlculaPly simple) type of pronoun. We try to extend DRT in order to cover an equally Important type of pronoun, the so-called etdes0rIptlonal,* pronoun. Discourse referents ape now used Eo carry information on the intenslon of their referents as well as on the extenslon. This allows, at the same time. to suggest accessibility rules for Pronouns which are more appropriate than those suggested by traditional DRT. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: A POOAFR MODIFICATIONS IN TEFRAIMOGSRP SLOHOML SFPG
Recent investigations show a remarkable convergence among contemporary unification-based formalisms for syntactic description. This convergence is now i t s e l f becoming an object of study, and there is an increasing recognition of the need for e x p l i c i t characterizations of the properties that relate and distinguish similar grammar formalisms. The paper proposes a series of changes in the formalism of Generalized Phrase Structure Grammar that throw light on its relation to Functional Unification Grammar. The essential contribution is a generalization of cooccurrence restrictions, which become the principal and unifying device...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: STRING-TREE CORRESPONDENCE GRAMMAR: A DECLARATIVE GRAMMAR FORMALISM FOR DEFINING THE CORRESPONDENCE BETWEEN STRINGS OF TERMS AND TREE STRUCTURES
The paper introduces a grammar formalism for defining the set of sentences in a language, a set of labeled trees (not the derivation trees of the grammar) for the representation of the interpretation of the sentences, and the (possibly non-projective) correspondence between subtrees of each tree and substrings of the related sentence. The grammar formalism is motivated by the linguistic approach (adopted at GETA) where a multilevel interpretative structure is associated to a sentence. The topology of the multilevel structure is 'meaning' motivated, and hence its substructures may not correspond projectively to the substrings of the related sentence. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: DANISH FIELD GRAMMAR IN TYPED PROLOG
This paper describes a field grammar for Danish and its implementations in a Prolog version with predeclared types. In compar i s o n to the u s u s a l S - NP VP schema, this kind of grammar, where the first rule is S - CNF FF NF CF e n h a n c e s a n a l y s i s effeciency because the fields specify constituents and syntactic function at the same time. The field grammar tradition is outlinedand an o v e r v i e w of the major...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: AUXILIARIES AND CLITICS IN FRENCH UCG GRAMMAR
French auxilliaries and clitics have been analysed in the flame of U.C.G. (Unification Categorial Grammar). Concatenation of a functor sign and an adjacent argument sign is the basic operation of the model ; unification allows (a) to verify ff constraints on concatenation are respected ; (b) to produce a flow of information between the functor sign and the argument sign.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: NATURAL AND SIMULATED POINTING
Referent identification in human conversation is performed both by describing the objects in question and by pointing at them. Up till now, only the linguistic component could be simulated in dialog systems. But recently, technical innovations have made it possible to 'point' at the objects on a display as well. The paper has two intentions. First, it investigates natural pointing in more detail and offers some possibilities to classify the great variety of pointing actions. Then, it tries to clarify the extent to which pointing by technical means (especially mouse-clicks) can be regarded as a simulation of natural pointing...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: PLANNING FOR PROBLEM IN ADVICE-GIVING FOR MULATION DIALOGUE
the solution is in fact what she/he needs. Our work concentrates on a problem formulation activity in a dialogue module which cooperates with a problem solver and a natural language front-end. The problem solver selects adequate securities for basic investment situations of a private investor and is being developed as part of the same Esprit project [Bruffaerts 1986]. The natural language front-end based on functional grammars is t h e result of s e p a r a t e r e s e a r c h at C a p Sogeti Innovation [Fimbel 1985, Lancel 1986]. ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: MODELING EXTEMPORANEOUS ELABORATION
Intelligent problem solving systems must be able to express their results in a coherent and flexible manner. One way this can be done is by eztemporaneous elaboration, the method of language production that underlies more skilled tasks such as explanation. This paper outlines a computational model for extemporaneous elaboration that is implemented in a computer model called Extemper, shows examples of its operation, and compares it with other models of language production.
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: FOR A N EFFICIENT CONTEXT-FREE PARSER AUGMENTED PHRASE-STRUCTURE GRAMMARS
In this paper we present an efficient context-free (CF) bottom-up, non deterministic parser. It is an extension of the ICA (Immediate Constituent Analysis) parser proposed by Grishman (1976), and its major improvements are described. It has been designed to run Augmented Phrase-Structure Grammars (APSG) and performs semantic interpretation in parallel with syntactic analysis. It has been implemented in Franz Lisp and runs on VAX 11/780 and, recently, also on a SUN workstation, as the main component of a transportable Natural Language Interface (SAIL = Sistema per I'Analisi e I'lnterpretazione del Linguaggio). ...
8/30/2018 3:08:09 AM +00:00
Báo cáo khoa học: DISCONTINUOUS CONSTITUENTS IN TREES, RULES, AND PARSING
This paper discusses the consequences of allowing discontinuous constituents in syntactic representions and phrase-structure rules, and the resulting complications for a standard parser of phrase-structure grammar. It is argued, first, that discontinuous constituents seem inevitable in a phrase-structure grammar which is acceptable from a semantic point of view. It is shown that tree-like constituent structures with discontinuities can be given a precise definition which makes them just as acceptable for syntactic representation as ordinary trees. However, the formulation of phrase-structure rules that generate such structures entails quite intricate problems. ...
8/30/2018 3:08:09 AM +00:00