The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Keyword search is an effective paradigm for information discovery and has been introduced recently to query XML documents. In this paper, we address the problem of returning clustered results for keyword search on XML documents. We first propose a novel semantics for answers to an XML keyword query. The core of the
Efficient discovery of information based on partially specified and misspelled query keywords is a challenging problem in large scale peer-to-peer (P2P) networks. This paper presents QPM, a P2P search mechanism for efficient information retrieval with misspelled and partial keywords. QPM uses the double metaphone
This paper proposes a system of retrieving English sentences by utilizing linguistically structural information. The userpsilas query consists of a sequence of keywords. The system automatically identifies dependency relations between occurrences of the keywords in sentences and classifies the sentences according to
, the system carry out conversation with the user to explicitly understand his/her needs and accordingly filters search results for display. The conversation between the system and the user is based on word co-occurrence keyword extraction and Artificial Intelligence Markup Language (AIML) technique. As per initial
With the number of registered Web services growing, Identifying desired Web service is crucial for Web users. Current keyword based service search are inefficient in two main aspects: poor scalability and lack of semantics. Firstly ,the users are overwhelmed by the huge number of irrelevant services returned. Secondly
agent that targets a particular topic and visits and gathers only relevant web pages. In this dissertation I had worked on design and working of web crawler that can be used for copyright infringement. We will take one seed URL as input and search with a keyword, the searching result is based on keyword and it will fetch
Semantic-based information retrieval mechanism that handles the processing, recognition, extraction, extensions and matching of content semantics to achieve the following objectives: i) to analyze and determine the semantic feature of the content and to develop a semantic pattern that represent the semantic features of the content. ii) to analyze user's query and extend its implied semantics through...
Clients' queries upon keywords or other informed description do not usually provide complete and unambiguous retrieval of information. Expansion of the queries based on semantic relation and phrase patterns is an effective approach to improve the retrieval. In this paper, a novel approach to queries expansion is
Information retrieval is the method of retrieving the knowledge relevant to an issue of curiosity. It locates the relevant documents, on the premise of user's question which includes keywords or example files. Probably the most acquainted application of information retrieval system is search engine corresponding to
a series of Keywords. The main focus of this paper lies with matching of standard questions and questions asked by users. An experimental system based on the proposed method has been built, and the results of our experiments shows the proposed method is effective for question matching.
unstructured text documents based on a domain dependent ontology and populate a database. Here, we apply pattern matching in terms of keywords/constants to extract the patterns and generate a structured text representation with respect to a domain specific ontology. The approach is illustrated on one such unstructured, short and
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.