Number of found records: 40
|
Information Extraction: Projects: An incomplete list of research projects that are related to Information Extraction and Wrapper Generation |
|
On line ( 15/06/2004) |
|
Incomplete list of the projects related to the information extraction. |
|
projects; extraction |
Assessment |
|
|
|
|
In memory of Gerard Salton, professor PhD Harvard University, 1958 |
|
On line ( 06/07/2005) |
|
Cornell University developed a text processing environment without restriction of size. They have worked with an automated encyclopaedia and in TREC |
|
text processing; TREC |
Assessment |
|
|
|
|
AHONEN, H. |
|
Knowledge discovery in documents by extracting frequent word sequences. |
|
Library Trends, 1999, vol. 48, n. 1, pp.160-81. |
|
On line ( 16/02/2005) |
|
Article included in an issue devoted to the theme: Knowledge discovery in bibliographic databases. Looks to the concept of knowledge discovery as a means of tackling the growing amount of digital information available and revealing the general patterns and regularities in data instead of specific facts. Describes a method for extracting maximal frequent sequences in a set of documents, the maximal frequent sequence defined as a sequence of words that is frequent in the document collection and, moreover, that is not contained in any other longer frequent sequence. Frequent maximal sequences can be used, for instance, as content descriptors for documents: a document is represented as a set of sequences, which can then be used to discover other regularities in the document collection. As the sequences are frequent, their combination of words is not accidental. Moreover, a sequence has exactly the same form in many documents, providing a possibility to do similarity mappings for information retrieval, hypertext linking, clustering, and discovery of frequent cooccurrences. (AU) |
|
Databases; Searching; Knowledge discovery; Data mining; Knowledge management; Term frequency |
Assessment |
|
|
|
|
CRAVEN, Timothy C. |
|
Algorithms for graphic display of sentence depending structures |
|
Information Processing and Management, 1991, vol. 27, n.6, pp.603-613. |
|
On line (11/05/2005) |
|
Reports on one aspect of an ongoing research project aimed at developing techniques for generating customised abstracts and extracts on demand from tests to which some coding has been added. 5 automatic graph-drawing algorithms were evaluated using a sample of texts for which sentence dependency structures had been coded. Evaluation criteria included speed and the number of crossing arcs, compactness, and suitability for application of selective scaling of the resulting display. The algorithms were implemented as options in the TEXTNET text structure management system. (DB) |
|
Services; User services; Information services; Abstracting services; Automatic |
Assessment |
|
|
|
|
