Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Efficient Retrieval of Frequently Asked Questions (FAQs)

Efficient Retrieval of Frequently Asked Questions (FAQs)

Joshi, Hardik

Paperback

General Computers

ISBN10: 6209428061
ISBN13: 9786209428067
Publisher: LAP Lambert Academic Publishing
Published: Jan 5 2026
Pages: 100
Weight: 0.32
Height: 0.24 Width: 6.00 Depth: 9.00
Language: English
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.

Also from

Joshi, Hardik

View All

Also in

General Computers

View All