Many methods and techniques have been developed to retrieve requiredinformation from bulk of documents. In this work we have comparedsome techniques for retrieving best matched FAQs (Frequently AskedQuestions) from FAQ list for given noisy SMS query. Noisy queries alwayscontain multiple noisy stop-words and less informative noisy words. It istrickier to get best correct word for a noisy word. Based on theassumption from which domain (like Railway, Health, Career etc.) a querytends to be, it becomes helpful to get absolutely correct words for all thenoisy words of a query. Probability theory becomes helpful in identifyingdomain of a query. We have applied those two techniques to get betterpossible words for noisy words and we got best results with ourexperiments.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Dr. Hardik Joshi works as an Associate Professor at the School of Advanced Computing - Gujarat University and his research interests are in Information Retrieval, Natural Language Processing & Cyber Security.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 408508814
Anzahl: 4 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Efficient Retrieval of Frequently Asked Questions (FAQs) | Amidst Noisy Questions | Hardik Joshi | Taschenbuch | Englisch | 2026 | LAP LAMBERT Academic Publishing | EAN 9786209428067 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu. Artikel-Nr. 134520989
Anzahl: 5 verfügbar