| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Lillian Lee Oren Kurland , Lillian Lee, Carmel Domshlak : Better than the real thing?: iterative pseudo-query processing using cluster-based language models. SIGIR 2005 : 19-26 Oren Kurland , Lillian Lee: PageRank without hyperlinks: structural re-ranking using links induced by language models. SIGIR 2005 : 306-313 Bo Pang , Lillian Lee: A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts. ACL 2004 : 271-278 Regina Barzilay , Lillian Lee: Catching the Drift: Probabilistic Content Models, with Applications to Generation and Summarization. HLT-NAACL 2004 : 113-120 Oren Kurland , Lillian Lee: Corpus structure, language models, and ad hoc information retrieval. SIGIR 2004 : 194-201 Regina Barzilay , Lillian Lee: Catching the Drift: Probabilistic Content Models, with Applications to Generation and Summarization CoRR cs.CL/0405039 : (2004) Bo Pang , Lillian Lee: A Sentimental Education: Sentiment Analysis Using Subjectivity Summarization Based on Minimum Cuts CoRR cs.CL/0409058 : (2004) Oren Kurland , Lillian Lee: Corpus structure, language models, and ad hoc information retrieval CoRR cs.IR/0405044 : (2004) Regina Barzilay , Lillian Lee: Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment. HLT-NAACL 2003 Regina Barzilay , Lillian Lee: Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence Alignment CoRR cs.CL/0304006 : (2003) Lillian Lee: "I'm sorry Dave, I'm afraid I can't do that": Linguistics, Statistics and Natural Language Processing circa 2001 CoRR cs.CL/0304027 : (2003) Rie Kubota Ando , Lillian Lee: Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences CoRR cs.CL/0205009 : (2002) Regina Barzilay , Lillian Lee: Bootstrapping Lexical Choice via Multiple-Sequence Alignment CoRR cs.CL/0205065 : (2002) Bo Pang , Lillian Lee, Shivakumar Vaithyanathan : Thumbs up? Sentiment Classification using Machine Learning Techniques CoRR cs.CL/0205070 : (2002) Lillian Lee: Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM 49 (1): 1-15 (2002) Rie Kubota Ando , Lillian Lee: Iterative Residual Rescaling: An Analysis and Generalization of LSI. SIGIR 2001 : 154-162 Rie Kubota Ando , Lillian Lee: Iterative Residual Rescaling: An Analysis and Generalization of LSI CoRR cs.CL/0106039 : (2001) Lillian Lee: Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication CoRR cs.CL/0112018 : (2001) Rie Kubota Ando , Lillian Lee: Mostly-Unsupervised Statistical Segmentation of Japanese: Applications to Kanji. ANLP 2000 : 241-248 Lillian Lee: Measures of Distributional Similarity CoRR cs.CL/0001012 : (2000) Lillian Lee: Distributional Similarity Models: Clustering vs. Nearest Neighbors. ACL 1999 Lillian Lee: Measures of Distributional Similarity. ACL 1999 Ido Dagan , Lillian Lee, Fernando C. N. Pereira : Similarity-Based Models of Word Cooccurrence Probabilities. Machine Learning 34 (1-3): 43-69 (1999) Ido Dagan , Lillian Lee, Fernando C. N. Pereira : Similarity-Based Models of Word Cooccurrence Probabilities CoRR cs.CL/9809110 : (1998) Ido Dagan , Lillian Lee, Fernando C. N. Pereira : Similarity-Based Methods for Word Sense Disambiguation. ACL 1997 : 56-63 Lillian Lee: Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication. ACL 1997 : 9-15 Lillian Lee: Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication CoRR cmp-lg/9708008 : (1997) Ido Dagan , Lillian Lee, Fernando C. N. Pereira : Similarity-Based Methods For Word Sense Disambiguation CoRR cmp-lg/9708010 : (1997) Lillian Lee: Similarity-Based Approaches to Natural Language Processing CoRR cmp-lg/9708011 : (1997) Ido Dagan , Fernando C. N. Pereira , Lillian Lee: Similarity-Based Estimation of Word Cooccurrence Probabilities. ACL 1994 : 272-278 Fernando C. N. Pereira , Naftali Tishby , Lillian Lee: Distributional Clustering of English Words. ACL 1993 : 183-190 1 [ 13 ] [ 15 ] [ 16 ] [ 20 ] 2 [ 19 ] [ 22 ] [ 23 ] [ 26 ] [ 28 ] 3 [ 2 ] [ 4 ] [ 7 ] [ 8 ] [ 9 ] 4 [ 31 ] 5 [ 24 ] [ 27 ] [ 30 ] [ 31 ] 6 [ 18 ] [ 25 ] [ 29 ] 7 [ 1 ] [ 2 ] [ 4 ] [ 7 ] [ 8 ] [ 9 ] 8 [ 1 ] 9 [ 18 ]  ©2006 Association for Computing Machinery |
