The constituent object parser: syntactic structure matching for information retrieval
ACM Transactions on Information Systems (TOIS)
On the application of syntactic methodologies in automatic text analysis
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Retrieval performance in Ferret a conceptual information retrieval system
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Stratified hypermedia structures for information disclosure
The Computer Journal - Special issue on information retrieval
Information retrieval from hypertext: an approach using plausible inference
Information Processing and Management: an International Journal - Special issue on hypertext and information retrieval
Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Some advances in transformation-based part of speech tagging
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Natural language information retrieval
TREC-2 Proceedings of the second conference on Text retrieval conference
Phase-based information retrieval
Information Processing and Management: an International Journal
Information Retrieval
Nesting and defoliation of index expressions for information retrieval
Knowledge and Information Systems
Bottom-Up Construction of Ontologies
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The INN system is a dynamic hypertext tool for searching and exploring the WWW. It uses a dynamically built ancillary layer to support easy interaction. This layer features the subexpressions of index expressions that are extracted from rendered documents. Currently, the INN system uses keyword based matching. The effectiveness of the INN system may be increased by using matching functions for index expressions. In the design of such functions, several constraints stemming from the INN must be taken into account. Important constraints are a limited response time and storage space, a focus on discriminating (different notions of) subexpressions for index expressions, and domain independency. With these contextual constraints in mind, several matching functions are designed and both theoretically and practically evaluated.