Generic soft pattern models for definitional question answering

Abstract

This paper explores probabilistic lexico-syntactic pattern matching, also known as <i>soft pattern matching</i>. While previous methods in soft pattern matching are ad hoc in computing the degree of match, we propose two formal matching models: one based on bigrams and the other on the Profile Hidden Markov Model (PHMM). Both models provide a theoretically… (More)
DOI: 10.1145/1076034.1076101

Topics

5 Figures and Tables

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Cui2005GenericSP, title={Generic soft pattern models for definitional question answering}, author={Hang Cui and Min-Yen Kan and Tat-Seng Chua}, booktitle={SIGIR}, year={2005} }