نتایج جستجو برای: lalearning automat

تعداد نتایج: 215  

1995
Usama M. Fayyad

In astronomy and space sciences, we current ly face a data g lut crisis. The problem of dealing w i t h the huge volume of data accumulated f rom a variety of sources, of correlating the data and extract ing and visualizing the impor tan t trends, is now fu l ly recognized. This problem wi l l become more acute very rapidly, w i th the advent of new telescopes, detectors, and space missions, w ...

1998
Richard Power Donia Scott

There are obvious reasons for trying to automate the product ion of multilingual documentation, especially for routine subject-matter in restricted domains (e.g. technical instructions). Two approaches have been adopted: Machine ~lh'anslation (MT) of a source text, and Multilingual Natural Language Generation (M-NLG) from a knowledge base. For MT, information extraction is a major difficulty, s...

1991
Fausto Giunchiglia Paolo Traverso

The goal of this paper is to present a theorem prover where the underlying code has been wr i t ten to behave as the p r o c e d u r a l m e t a leve l of the object logic. We have then defined a logical d e c l a r a t i v e m e t a t h e o r y MT which can be put in a one-to-one relation w i th the code and automatically generated from i t . MT is proved correct and complete in the sense that...

1993
Thomas E. Ahlswede David Lorand

Although automated word sense disambiguation has become a popular activity within computational lexicology, evaluation of the accuracy of disambiguation systems is still mostly limited to manual checking by the developer. This paper describes our work in collecting data on the disambiguation behavior of human subjects, with the intention of providing (I) a norm against which dictionary-based sy...

1997
Giorgio Satta John C. Henderson

String t ransformat ion systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computat ional problem of automatical ly learning from a given corpus the set of transformat ions presenting the best evidence. We introduce an original da ta structure and efficient algori thms that learn some families of t ransformati...

Journal: :Complex Systems 1991
Bhavin Sheth Prantik Nag Robert W. Hellwarth

A cellular auto mata approach to fast addit ion of binary numbers is pr esented. This approach utilizes the intrinsically parallel nature of the cellular auto maton to add binary numbers represented as on/off pixels on the computer screen . Numbers nbit long are added serially pairwise until the final sum is ob tained . This approach can eas ily be genera lized to numbers of any base, but is co...

1992
Stephan M. Kerpedjiev

Weather reports are created in various modes natural language text, specialized language text, tables and maps. The system presented allows the user to define his needs of weather information and requirements on the form of presentation. The system analyzes a dataset obtained through specific procedures of forecasting or observation, plans the product according to the user requirements and gene...

1993
John R. Koza

This paper describes an approach for automatically decomposing a problem into subproblems and then automatically discovering reusable subroutines , and a way of assembling the results produced by these subroutines in order to solve a problem. The approach uses g e n e t i c p r o g r a m m i n g w i t h automatic funct ion def init ion. Genetic programming provides a way to genetically breed a ...

1994
Naohiko Uramoto

To improve tit(.' coverage of examl)le-bases , two nlethods are introduced into the 1)est-match algor i thm. The first is for acquiring conjunctive relat ionships fl'om corpora, as measures of word similarity t h a t can be used in addit ion to thesauruses. The Second, used when a word does not appear in an examltled)asc or a thesaurus, is for inferring links to words in the examph>base by ( 'm...

1992
Jerry R. Hobbs Douglas E. Appelt John Bear Mabry Tyson

I1. 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 fox' syntactic and pragmatic analysis can be bolstered with methods for achieving robustness. We describe three techniques...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید