ACM Home Page
Please provide us with feedback. Feedback
How to cope with questions typed by dyslexic users
Full text PdfPdf (813 KB)
Source AND; Vol. 303 archive
Proceedings of the second workshop on Analytics for noisy unstructured text data table of contents
Singapore
Pages 1-8  
Year of Publication: 2008
ISBN:978-1-60558-196-5
Authors
Laurianne Sitbon  University of Avignon, Avignon, France
Patrice Bellot  University of Avignon, Avignon, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390749.1390752
What is a DOI?

ABSTRACT

In this paper we propose a way to cope with questions typed by dyslexic users as they are usually a deformation of the intended query that cannot be corrected with classical spellcheckers. We first propose a new model for statistic question answering systems based on a probabilistic information retrieval model and a combination of results. This model allows a multiple weighted terms query as an input. We also introduce a phonology based approach at the sentence level to derive possible intended terms from typed questions. This approach uses the finite state machine framework to go from phonetic hypothesis and spellchecker proposals to hypothesized sentences thanks to a language model. The final weighted queries are obtained thanks to posterior probabilities computation. They are evaluated according to new density and appearance rating measures which adapt recall and precision to non binary data.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Allauzen and M. Mohri. The design principles and algorithms of a weighted grammar library. International Journal of Foundations of Computer Science, 16(3):403--421, 2005.
 
2
G. Amati, C. Carpineto, and G. Romano. Query difficulty, robustness and selective application of query expansion. In Actes de ECIR'04, Lecture Notes in Computer Science, pages 127--137, Sunerland, 2004. Springer.
 
3
F. Bechet. Lia_phon - un systeme complet de phonetisation de textes. Traitement Automatique des Langues (T.A.L.), 42 (1), 2001.
 
4
5
 
6
S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6):391--407, 1990.
 
7
S. Deorowicz and M. G. Ciura. Correcting spelling errors by modelling their causes. International journal of applied mathematics and computer science, 15(2):275--285, 2005.
 
8
C. Fairon and S. Paumier. A translated corpus of 30,000 french sms. In In Proceeding of LREC 2006, Genoa, Italy, May 2006.
 
9
E. A. Fox and J. A. Shaw. Combination of multiple searches. In Proceedings of the 2nd Text REtrieval Conference (TREC-2), pages 243--252, 1994.
10
 
11
G. T. Gillon. Phonological Awareness- From Research to Practice. Guilford Press, 2004.
 
12
J. Grivolla, P. Jourlin, and R. D. Mori. Automatic classification of queries by expected retrieval performance. In Actes de SIGIR'05, Salvador, 2005. ACM Press.
 
13
A. James and E. Draffan. The accuracy of electronic spell checkers for dyslexic learners. PATOSS bulletin, August 2004.
 
14
K. L. Kwok. An attempt to identify weakest and strongest queries. In Actes de SIGIR'05, Salvador, 2005. ACM Press.
15
 
16
R. P. W. Loosemore. A neural net model of normal and dyslexic spelling. In International Joint Conference on Neural Networks, volume 2, pages 231--236, Seattle, USA, 1991.
 
17
C. D. Loupy and P. Bellot. Evaluation of document retrieval systems and query difficulty. In Actes du. LREC'2000 Satellite Workshop "Using Evaluation within HLT Programs: Results and trends", pages 31--38, Athènes, 2000.
 
18
M. Mohri, F. C. N. Pereira, and M. Riley. Weighted finite-state transducers in speech recognition. Computer Speech and Language, 16(1):69--88, 2002.
 
19
M. Mohri, F. C. N. Pereira, and M. D. Riley. At&t fsm librarytm - finite-state machine library, 1997.
 
20
J. Mothe and L. Tanguy. Linguistic features to predict query difficulty - a case study on previous trec campaigns. In Actes de SIGIR'05, pages 7--10, Salvador, 2005. ACM Press.
 
21
J.-Y. Nie. Clir as query expansion as logical inference. Technology letters, 4(1):69--76, 2000.
 
22
J. Pedler. The detection and correction of real-word spelling errors in dyslexic text. In Proceedings of the 4th Annual CLUK Colloquium, 2001.
 
23
 
24
Roger. A spelling checker for dyslexic users: user modelling for error recovery. PhD thesis, Human Computer Interaction Group, Department of Computer Science, University of York, Heslington, York, September 1998.
 
25
L. Sitbon, P. Bellot, and P. Blache. Phonetic based sentence level rewriting of questions typed by dyslexic spellers in an information retrieval context. In Proceedings of Interspeech 2007, Antwerp, Belgium, September 2007.
 
26
L. Sitbon, P. Bellot, and P. Blache. A corpus of real-life questions for evaluating robustness of qa systems. In Proceedings of the 6th edition of the Language Resources and Evaluation Conference (LREC 2008), Marrakech, Morocco, May 2008.
 
27
L. Sitbon, L. Gillard, J. Grivolla, P. Bellot, and P. Blache. Vers une prédiction automatique de la difficulté d'une question en langue naturelle. In 13ième conférence Traitement Automatique des Langues Naturelles (TALN), pages 337--346, Louvain, Belgique, 10--13 Avril 2006.
 
28
 
29
 
30
E. M. Voorhees and D. Harman. Overview of the eighth text retrieval conference (trec-8). In proceedings of the eighth Text REtrieval Conference, pages 1--24, Gaithersburg, Maryland, USA, November 1999.
 
31
P. Wolf and B. Raj. The merl spokenquery information retrieval system. In IEEE International Conference on Multimedia and Expo (ICME), volume 2, pages 317--320, Août 2002.

Collaborative Colleagues:
Laurianne Sitbon: colleagues
Patrice Bellot: colleagues