6 0 Download (0) ✓
Figure 1:
Figure 2:
A B S T R A C T G E N E R A T I O N B A S E D O N R H E T O R I C A L S T R U C T U R E E X T R A C T I O N K e n j l O n o , K a z u o S u m l t a , S e i j l M i i k e Research and
CATEGORIAL GRAMMAR AND DISCOURSE REPRESENTATION THEORY C A T E G O R I A L G R A M M A R A N D D I S C O U R S E R E P R E S E N T A T I O N T H E O R Y R e i n h a r d M u s k e n s
A TOOL FOR COLLECTING DOMAIN DEPENDENT SORTAL CONSTRAINTS FROM CORPORA A T O O L F O R C O L L E C T I N G D O M A I N D E P E N D E N T S O R T A L C O N S T R A I N T S F R O M C O R P O
Virtual Polysemy Virtual P o l y s e m y A n t o n i o S a n f i l i p p o , K e r i m a B e n k e r i m i & D a g m a r D w e h u s * S H A R P L a b o r a t o r i e s o f E u r o p e O x
GENERATION FROM UNDER AND OVERSPECIFIED STRUCTURES G E N E R A T I O N F R O M U N D E R A N D O V E R S P E C I F I E D S T R U C T U R E S * D I E T E R K O H L U n i v e r s i t l i t S
Presuppositions as Beliefs P r e s u p p o s i t i o n s a s B e l i e f s D i a n e H O R T O N a n d G r a e m e H I I t S T D e p a r t m e n t o f C o m p u t e r S c i e n c e U n i v
Solving Some Persistent Presupposition Problems S o l v i n g S o m e P e r s i s t e n t P r e s u p p o s i t i o n t P r o b l e m s R o b e r t E MERCER * D e p a r t m e n t of C o m p
Parallel Intersection and Serial Composition of Finite State Transducers P a r a l l e l I n t e r s e c t i o n a n d S e r i a l C o m p o s i t i o n o f F i n i t e S t a t e T r a n s
ON THE USE OF TIED MIXTURE DISTRIBUTIONS O N T H E U S E O F T I E D M I X T U R E D I S T R I B U T I O N S Owen Kimball, Mari Ostendorf E l e c t r i c a l , C o m p u t e r a n d S y s t
ONE SENSE PER COLLOCATION O N E S E N S E P E R C O L L O C A T I O N D a v i d Yarowsky* D e p a r t m e n t o f C o m p u t e r a n d I n f o r m a t i o n S c i e n c e U n i v e r s i t
The Use of Relative Duration in Syntactic Disambiguation T h e U s e o f R e l a t i v e D u r a t i o n in S y n t a c t i c D i s a m b i g u a t i o n M O s t e n d o r f t P J P r i c e
SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMARS S O M E C O M P U T A T I O N A L P R O P E R T I E S O F T R E E A D J O I N I N G G R A M M A R S * K V i j a y S h a n k l t r a