| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Alberto Lavelli Alberto Lavelli, Fabrizio Sebastiani , Roberto Zanoli : Distributional term representations: an experimental comparison. CIKM 2004 : 615-624 Alberto Lavelli, Fabrizio Sebastiani , Roberto Zanoli : An Experimental Comparison of Term Representation for Term Management Applications. SEBD 2004 : 190-201 Henri Avancini , Alberto Lavelli, Bernardo Magnini , Fabrizio Sebastiani , Roberto Zanoli : Expanding Domain-Specific Lexicons by Term Categorization. SAC 2003 : 793-797 Alberto Lavelli, Bernardo Magnini , Fabrizio Sebastiani : Building thematic lexical resources by term categorization. SIGIR 2002 : 415-416 Fabio Ciravegna , Alberto Lavelli, Giorgio Satta : Bringing Information Extraction out of the Labs: the NoName Environment. ECAI 2000 : 416-420 Fabio Ciravegna , Alberto Lavelli, Nadia Mana , Johannes Matiasek , Luca Gilardoni , Silvia Mazza , Massimo Ferraro , William J. Black , Fabio Rinaldi , David Mowatt : Flexible Text Classification for Financial Applications: The Facile System. ECAI 2000 : 696-700 Fabio Ciravegna , Alberto Lavelli: Full Text Parsing using Cascades of Rules: an Information Extraction Perspective. EACL 1999 : 102-109 Fabio Ciravegna , Alberto Lavelli, Luca Gilardoni , Johannes Matiasek , Nadia Mana , Silvia Mazza , Massimo Ferraro , William J. Black , Fabio Rinaldi , David Mowatt : FACILE: Classifying Texts Integrating Pattern Matching and Information Extraction. IJCAI 1999 : 890-897 Alberto Lavelli, Bernardo Magnini , Carlo Strapparava : An Approach To Multilevel Semantics For Applied Systems. ANLP 1992 : 17-24 Alberto Lavelli, Bernardo Magnini : Lexical Discrimination within a Multilevel Semantics Approach. AI*IA 1991 : 455-459 Alberto Lavelli, Giorgio Satta : Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars. EACL 1991 : 27-32 Alberto Lavelli, Oliviero Stock : When Something Is Missing: Ellipsis, Coordination and the Chart. COLING 1990 : 184-189 1 [ 10 ] 2 [ 5 ] [ 7 ] 3 [ 5 ] [ 6 ] [ 7 ] [ 8 ] 4 [ 5 ] [ 7 ] 5 [ 5 ] [ 7 ] 6 [ 3 ] [ 4 ] [ 9 ] [ 10 ] 7 [ 5 ] [ 7 ] 8 [ 5 ] [ 7 ] 9 [ 5 ] [ 7 ] 10 [ 5 ] [ 7 ] 11 [ 5 ] [ 7 ] 12 [ 2 ] [ 8 ] 13 [ 9 ] [ 10 ] [ 11 ] [ 12 ] 14 [ 1 ] 15 [ 4 ] 16 [ 10 ] [ 11 ] [ 12 ]  ©2005 Association for Computing Machinery |
