A fast morphological algorithm with unknown word guessing induced by a dictionary for a web search engine

Proceedings of the International Conference on Machine Learning; Models, Technologies and Applications

Volumn , Issue , 2003, Pages 273-280

  Segalovich, Ilya ^a  

^a Yandex ^*  (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

MINIMUM DESCRIPTION LENGTH (MDL); MORPHOLOGICAL MODELS;

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; VOCABULARY CONTROL; WORD PROCESSING; WORLD WIDE WEB;

SEARCH ENGINES;

EID: 1642406247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Harman, D. How effective is suffixing?, JASIS vol. 42, 1991
2. Hull, D. A. Stemming Algorithms A Case Study for Detailed Evaluation, (Rank Xerox Research Centre), JASIS vol. 47, 1996
3. Google Help: The Basics of Google Search, http://www.google.com/help/basics.html
4. Karttunen, L. and Beesley, K. R. Two-Level Rule Compiler, Xerox Palo Alto Research Centre, Palo Alto, 1992
5. Mohri, M., Fernando Pereira, Michael Riley, The Design Principles of a Weighted Finite-State Transducer Library.Theoretical Computer Science, 2000
6. Daciuk J,.; B. W. Watson; S. Mihov; R.E. Watson Incremental Construction of Minimal Acyclic Finite-State Automata, Computational Linguistics, Volume 26, Number 1, March 2000
7. Jacquemin, C. Guessing morphology from terms and corpora, SIGIR'97
8. Lovins, J.B. Development of a Stemming Algorithm,.Mechanical Translation and Computational Linguistics, Vol. 11
9. Porter, M. F. An algorithm for suffix stripping, Program, 14:130-137, July 1980
10. Gaussier, E. Unsupervised learning of derivational morphology from inflectional lexicons, ACL'99 Workshop: Unsupervised Learning in Natural Language Processing, 1999
11. Goldsmith, J. Unsupervised learning of the morphology of a natural language, Comp. Ling. 2001
12. Snover, M. G. and Brent M. R. A Probabilistic Model for Learning Concatenative Morphology, Proceedings of NIPS-2002
13. Schone, P., Jurafsky, D. Knowledge-Free Induction of Morphology Using Latent Semantic Analysis. 4th Conference on Computational Natural Language Learning and 2nd Learning Language in Logic Workshop, Lisbon, 2000
14. Manning, C.D., Schutze, H. Foundations of Statistical Natural Language Processing, 1999
15. Woods, W.A. Aggressive Morphology for Robust Lexical Coverage. Sun Technical Report http://research.sun.com/techrep/1999/smli_t r-99-82.pdf
16. Mikheev, A. Automatic Rule Induction for Unknown Word Guessing 1997 University of Edinburgh
17. Belonogov, G.G., Zelenkov, Yu.G. Voprosy informatsionnoi teorii i praktiki, N 53, M., 1985 / Informational Theory and Practice Issues, N 53, M., 1985 (In Russian).
18. Kovalenko, A. Stemmer: morphological analysis for small-sized information retrieval systems. System Administrator #1, October, 2002 (In Russian) http://linguist.nm.ru/stemka/stemka.html
19. Segalovich, I., Maslov, M. Russian Morphological Analysis and Synthesis With Automatic Generation of Inflection Models For Unknown Words. Proceedings of the International Seminar In Computational Linguistics Dialog'98, Tarusa, 1998 (in Russian).
20. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Introduction to algorithms. London: MIT Press, 1990
21. Zalizniak, A.A. Grammatical Dictionary of the Russian Language. Published 1980
22. Russian Morphological Corpus http://corpora.narod.ru/article.html
23. Paice, C. D. Method for evaluation of stemming algorithms based on error counting. JASIS, Vol.47, Issue 8, August 1996