Locally Tree-shaped Sentence Automata and Resolution of Ambiguity
Jussi Piitulainen · DSpace repository (University of Tartu) · 1995
ta te in te rs e ctio n g r a m m a r s is d ir e c te d to w a rd s p r a c tic a l r e p re s e n ta tio n a n d p a rs in g o f r u n n in g te x t.A p r o b le m in pa rs in g h a s b e e n th a t in te r s e c tio n w ith su ccessiv e ru le a u t o m a t a ca n p r o d u c e p r o h ib it iv e ly la rg e in te r m e d ia te sen te n ce a u to m a t a .See (K o s k e n n ie m i, T a p a n a in e n a n d V o u tila in e n 1 9 9 2 ) a n d (K o s k e n n ie m i 19 90 ) a n d (V o u tila in e n a n d T a p a n a in e n 1 9 9 3 ).T h is p a p e r sk etch es a d a ta s tru ctu re a n d p a rs in g m e t h o d th a t m a y h e lp t o c o m p u t e th e in te r s e c tio n o f a se n te n ce a u t o m a t o n w ith all rule a u t o m a t a w h ile k e e p in g th e size o f in te r m e d ia te se n te n ce a u t o m a t a under c o n t r o l.