메뉴 건너뛰기




Volumn 60, Issue 7, 2009, Pages 1448-1465

Evaluation of n-gram conflation approaches for arabic text retrieval

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE USER INTERFACE; ARABIC TEXTS; METASEARCH; N-GRAM MODELS; N-GRAMS; PRECISION AND RECALL; PRIOR KNOWLEDGE; RELATED WORD; SIMILARITY MEASURE; SPECIFIC LOCATION; SUBWORDS; TARGET LANGUAGE; UNSUPERVISED METHOD;

EID: 66749186635     PISSN: 15322882     EISSN: 15322890     Source Type: Journal    
DOI: 10.1002/asi.21063     Document Type: Article
Times cited : (25)

References (48)
  • 2
    • 0016083316 scopus 로고
    • The use of an association measure based on character structure to identify semantically related pairs of words and document titles
    • Adamson, G.W., & Boreham, J. (1974). The use of an association measure based on character structure to identify semantically related pairs of words and document titles. Information Storage and Retrieval, 10, 253-260.
    • (1974) Information Storage and Retrieval , vol.10 , pp. 253-260
    • Adamson, G.W.1    Boreham, J.2
  • 5
    • 0013182812 scopus 로고
    • A new algorithm to generate Arabic root-pattern forms
    • Dhahran. Saudi Arabia: King Fahd University of Petroleum and Minerals
    • Al-Fedaghi, S.S., & Al-Anzi, F.S. (1989). A new algorithm to generate Arabic root-pattern forms. In Proceedings of the 11th National Computer Conference (pp. 04-07). Dhahran. Saudi Arabia: King Fahd University of Petroleum and Minerals.
    • (1989) Proceedings of the 11th National Computer Conference , pp. 4-7
    • Al-Fedaghi, S.S.1    Al-Anzi, F.S.2
  • 7
    • 10044237388 scopus 로고    scopus 로고
    • Indexing the Indonesian Web: Language identification and miscellaneous issues
    • Paper presented at the Hong Kong
    • Berlian, V., Vega, S.N., &.Bressan, S. (2001). Indexing the Indonesian Web: Language identification and miscellaneous issues. Paper presented at the 10th International World Wide Web Conference, Hong Kong.
    • (2001) 10th International World Wide Web Conference
    • Berlian, V.1    Vega, S.N.2    Bressan, S.3
  • 8
    • 84962690278 scopus 로고    scopus 로고
    • Unsupervised knowledge-free morpheme boundary detection
    • September. Paper presented at the Retrieved March 17, 2009
    • Bordag, S. (2005, September). Unsupervised knowledge-free morpheme boundary detection. Paper presented at the International Conference on Recent Advances in Natural Language Processing (RANLP 05). Retrieved March 17, 2009, from http://wortschatz.unileipzig.de/-sbordag/papers/BordagMorphy05.pdf.
    • (2005) International Conference on Recent Advances in Natural Language Processing (RANLP 05).
    • Bordag, S.1
  • 10
    • 84873303650 scopus 로고    scopus 로고
    • Improving precision, in information retrieval for Swedish using stemming
    • May. Paper presented at Uppsala, Sweden. Retrieved March 17, 2009
    • Carlberger, J., Dalianis, H., Hassel, M., & Knutsson, O. (2001, May). Improving precision, in information retrieval for Swedish using stemming. Paper presented at NODALIDA '01: The 13th Nordic Conference on Computational Linguistics, Uppsala, Sweden. Retrieved March 17, 2009, from http://stp.ling.uu.se/nodalida01/pdf/carlberger.pdf.
    • (2001) NODALIDA '01: the 13th Nordic Conference on Computational Linguistics
    • Carlberger, J.1    Dalianis, H.2    Hassel, M.3    Knutsson, O.4
  • 11
    • 66749156030 scopus 로고    scopus 로고
    • Simple unsupervised morphology analysis algorithm
    • Laboratory of Computer and Information Science. Retrieved February 26, 2009
    • Dang, M.T., & Choudri, S. (2005). Simple unsupervised morphology analysis algorithm. In Unsupervised Segmentation of Words into Morphemes: Challenge 2005, Laboratory of Computer and Information Science. Retrieved February 26, 2009, from www.cis.hut.fi/morphochallenge 2005/P09-DangChoudri.pdf.
    • (2005) Unsupervised Segmentation of Words into Morphemes: Challenge 2005
    • Dang, M.T.1    Choudri, S.2
  • 15
    • 3042527495 scopus 로고    scopus 로고
    • Stemming and n-gram matching for term, conflation in Turkish texts
    • Retrieved February 26, 2009
    • Ekmekcioglu, F.C., Lynch, M.F., & Willett, P. (1996). Stemming and n-gram matching for term, conflation in Turkish texts. Information Research News, 2, pp. 2-6. Retrieved February 26, 2009, from http://informationr.net/ir/ 2-2/paper13.html.
    • (1996) Information Research News , vol.2 , pp. 2-6
    • Ekmekcioglu, F.C.1    Lynch, M.F.2    Willett, P.3
  • 16
    • 0001918328 scopus 로고
    • Stemming algorithms
    • W.B. Frakes & R. Baeza-Yates (Eds.), Englewood Cliffs, NJ: Prentice-Hall
    • Frakes, W.B. (1992). Stemming algorithms. In W.B. Frakes & R. Baeza-Yates (Eds.), Information retrieval: Data structures and algorithms. Englewood Cliffs, NJ: Prentice-Hall.
    • (1992) Information Retrieval: Data Structures and Algorithms
    • Frakes, W.B.1
  • 21
    • 0013181554 scopus 로고
    • Word segmentation by letter successor varieties
    • Hafer, M., & Weiss, S. (1974). Word segmentation by letter successor varieties. Information Processing & Management. 10, 371-386.
    • (1974) Information Processing & Management , vol.10 , pp. 371-386
    • Hafer, M.1    Weiss, S.2
  • 23
    • 66749190976 scopus 로고    scopus 로고
    • Retrieved March 17,2009
    • Khoja, S., & Garside, R. (1999). Arabic stemmer. Retrieved March 17,2009, from. http://zeus.cs.pacificu.edu/shereen/research.htm#stemming.
    • (1999) Arabic Stemmer
    • Khoja, S.1    Garside, R.2
  • 24
    • 58149461920 scopus 로고    scopus 로고
    • Arabic text classification using n-gram frequency statistics: A comparative study
    • S.F. Crone, S. Lessmann, & R. Stahlbock (Eds), Las Vegas, NV: CSREA Press
    • Khreisat, L. (2006). Arabic text classification using n-gram frequency statistics: A comparative study. In S.F. Crone, S. Lessmann, & R. Stahlbock (Eds), Proceedings of the 2006 International Conference on Data Mining (DMIN 2006) (pp. 78-82). Las Vegas, NV: CSREA Press.
    • (2006) Proceedings of the 2006 International Conference on Data Mining (DMIN 2006) , pp. 78-82
    • Khreisat, L.1
  • 28
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • Levenshtein, V.I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Dokladi 10, 8, 707-710.
    • (1966) Soviet Physics Dokladi , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 32
    • 2942723334 scopus 로고    scopus 로고
    • Shallow morphological, analysis in monolingual information retrieval for Dutch, German, and Italian
    • C Peters, M. Braschler, J. Gonzalo, & M. Kluck (Eds), London: Springer
    • Monz, C., & de Rijke, M. (2001). Shallow morphological, analysis in monolingual information retrieval for Dutch, German, and Italian. In C Peters, M. Braschler, J. Gonzalo, & M. Kluck (Eds), Lecture Notes in Computer Science, Vol.2406: Evaluation of Cross-Language Information Retrieval Systems (CLEF 2001) (pp. 262-277). London: Springer.
    • (2001) Lecture Notes in Computer Science, Vol.2406: Evaluation of Cross-Language Information Retrieval Systems (CLEF 2001) , pp. 262-277
    • Monz, C.1    De Rijke, M.2
  • 33
    • 56749116875 scopus 로고    scopus 로고
    • Lost in cyberspace: How do search engines handle Arabic queries?
    • Proceedings of the 32nd Annual Conference of the Canadian Association for Information Science. Retreived March 1, 2009
    • Moukdad, H. (2004). Lost in cyberspace: How do search engines handle Arabic queries?, In Access to Information: Technologies, Skills, and Sociopolitical Context. Proceedings of the 32nd Annual Conference of the Canadian Association for Information Science. Retreived March 1, 2009, from http://www.cais-acsi.ca/proceedings/2004/moukdad-2004.pdf.
    • (2004) Access to Information: Technologies, Skills, and Sociopolitical Context
    • Moukdad, H.1
  • 34
    • 12344319489 scopus 로고    scopus 로고
    • Information retrieval from full-text Arabic databases: Can search engines designed for English do the job?
    • Moukdad,H.,&Large,A.(2001).Informationretrievalfromfull- textArabicdatabases:CansearchenginesdesignedforEnglish,dothejob?Libri,51(2), 63-74.(Pubitemid33778535)
    • (2001) Libri , vol.51 , Issue.2 , pp. 63-74
    • Moukdad, H.1    Large, A.2
  • 36
    • 11144226971 scopus 로고    scopus 로고
    • Character contiguity in n-gram-based word matching: The case for Arabic text searching
    • Mustafa, S.H. (2004). Character contiguity in n-gram-based word matching: The case for Arabic text searching. Information Processing & Management, 41, 819-827.
    • (2004) Information Processing & Management , vol.41 , pp. 819-827
    • Mustafa, S.H.1
  • 38
    • 84976754255 scopus 로고
    • Another stemmer
    • Paice, C.D. (1990). Another stemmer. ACM SIGIR Forum, 24(3), 56-61.
    • (1990) ACM SIGIR Forum , vol.24 , Issue.3 , pp. 56-61
    • Paice, C.D.1
  • 39
    • 0030290473 scopus 로고    scopus 로고
    • Retrieval effectiveness of proper name search methods
    • DOI 10.1016/S0306-4573(96)00042-8, PII S0306457396000428
    • Pfeifer, U., Poersch, T., & Fuhr, N. (1996). Retrieval effectiveness of proper name search methods. Information Processing & Management, 32, 667-679. (Pubitemid 126371199)
    • (1996) Information Processing and Management , vol.32 , Issue.6 , pp. 667-679
    • Pfeifer, U.1    Poersch, T.2    Fuhr, N.3
  • 41
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • Porter, M.F. (1980). An algorithm for suffix stripping. Program, 14(3), 130-137.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.F.1
  • 42
    • 0013182812 scopus 로고
    • A new algorithm, to generate Arabic rootpattern forms
    • Dhahran, Saudi. Arabia: King Fahd University of Petroleum and Minerals
    • Sabah, S., & Al-Anzi. (1989). A new algorithm, to generate Arabic rootpattern forms. In Proceedings of the 11th National Computer Conference (pp. 04-07). Dhahran, Saudi. Arabia: King Fahd University of Petroleum and Minerals.
    • (1989) Proceedings of the 11th National Computer Conference , pp. 4-7
    • Sabah, S.1    Al-Anzi2
  • 44
    • 0031599183 scopus 로고    scopus 로고
    • Corpus-based stemming using cooccurrence of word variants
    • Xu, J., & Croft, W.B. (1996). Corpus-based stemming using cooccurrence of word variants, ACM Transactions on Information Systems, 16(1), 61-81.
    • (1996) ACM Transactions on Information Systems , vol.16 , Issue.1 , pp. 61-81
    • Xu, J.1    Croft, W.B.2
  • 48
    • 0029271657 scopus 로고
    • Finding approximate matches in large lexicons
    • Zobel, J., & Dart, P. (1995). Finding approximate matches in large lexicons. Software: Practice and Experience, 25, 331-345.
    • (1995) Software: Practice and Experience , vol.25 , pp. 331-345
    • Zobel, J.1    Dart, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.