메뉴 건너뛰기




Volumn 2, Issue 4, 2007, Pages 12-23

New functions for unsupervised asymmetrical paraphrase detection

Author keywords

Paraphrase Identification; Paraphrasing; Sentence compression; Text Generation; Text Mining; Text Summarization; Textual Entailment

Indexed keywords

DATA MINING; FUNCTIONS; LEARNING ALGORITHMS; TEXT PROCESSING;

EID: 84858054703     PISSN: 1796217X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jsw.2.4.12-23     Document Type: Article
Times cited : (29)

References (23)
  • 2
    • 0036641584 scopus 로고    scopus 로고
    • Summarization beyond sentence extraction: A probabilistic approach to sentence compression
    • K. Knight and D. Marcu, "Summarization beyond sentence extraction: A probabilistic approach to sentence compression. " Artificial Intelligence, pp. 139(1):91-107, 2002.
    • (2002) Artificial Intelligence , vol.139 , Issue.1 , pp. 91-107
    • Knight, K.1    Marcu, D.2
  • 4
    • 85037066932 scopus 로고    scopus 로고
    • Learning to paraphrase: An unsupervised approach using multiple-sequence alignment
    • R. Barzilay and L. Lee, "Learning to paraphrase: An unsupervised approach using multiple-sequence alignment. " In Proceedings of HLT-NAACL., 2003.
    • (2003) In Proceedings of HLT-NAACL.
    • Barzilay, R.1    Lee, L.2
  • 8
    • 0031247886 scopus 로고    scopus 로고
    • Automatic induction of rules for text simplification
    • [Online]. Available: citeseer.ist.psu.edu/article/chandrasekar97automatic.html
    • R. Chandrasekar and B. Srinivas, "Automatic induction of rules for text simplification, " Knowledge-Based Systems, pp. 10:183-190, 1997. [Online]. Available: citeseer. ist. psu. edu/article/chandrasekar97automatic. html
    • (1997) Knowledge-Based Systems , vol.10 , pp. 183-190
    • Chandrasekar, R.1    Srinivas, B.2
  • 14
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals. " Soviet Physice-Doklady, pp. 10:707-710, 1966.
    • (1966) Soviet Physice-Doklady , pp. 10707-10710
    • Levenshtein, V.1
  • 15
    • 0042879653 scopus 로고    scopus 로고
    • A systematic comparison of various statistical alignment models
    • F. Och and H. Ney, "A systematic comparison of various statistical alignment models, " Computational Linguistics, pp. 29(1):19-51, 2003.
    • (2003) Computational Linguistics , vol.29 , Issue.1 , pp. 19-51
    • Och, F.1    Ney, H.2
  • 20
    • 0038632285 scopus 로고    scopus 로고
    • Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus
    • M. Yamamoto and K. Church, "Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus, " Computational Linguistics, pp. 27(1):1-30, 2001.
    • Computational Linguistics , vol.27 , Issue.1 , pp. 1-30
    • Yamamoto, M.1    Church, K.2


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