| J95-4002 | be converted into a lexicalized | tree insertion | grammar ( LTIG ) that generates |
| P11-2036 | inference technique for handling a | tree insertion | that makes use of dynamic program |
| P06-3013 | Arabic . Chiang ( 2000 ) used | Tree Insertion | Grammars , one variation of TAG |
| J12-3006 | restricted variant of TAG called | tree insertion | grammars ( TIGs ) . This formalism |
| P11-2036 | substitution grammars ( BTSG ) . | Tree insertion | is helpful for modeling syntax |
| N09-2047 | Probabilistic Dependency Based on | Tree Insertion | Grammars Application Note </title> |
| E09-1080 | likelihood , using EM , under a | Tree Insertion | Grammar ( TIG ) model1 . In this |
| N12-1031 | decompose the original trees into a | Tree Insertion | Grammar representation ( Chiang |
| P11-2036 | grammar induction is high since | tree insertion | significantly increases the number |
| P11-2036 | grammars ( TAG ) ( Joshi , 1985 ) or | tree insertion | grammars ( TIG ) ( Schabes and |
| N13-1061 | aside a precise comparison to | Tree Insertion | Grammar ( Chiang , 2003 ) and |
| N09-2047 | pro- cess . In a first step , a | Tree Insertion | Grammar ( TIG ) ( Schabes and |
| J95-4002 | CFGs . 2 . Tree Insertion Grammar | Tree insertion | grammar ( TIG ) is a tree generating |
| J10-3006 | constructions meet the constraints of | Tree Insertion | Grammar ( TIG ) , a known context-free |
| J04-3001 | the Probabilistic Lexicalized | Tree Insertion | Grammar ( PLTIG ) formalism ( |
| J95-4002 | Definition 7 -LSB- LTIG1 A lexicalized | tree insertion | grammar ( LTIG ) 4 ( E , NT , |
| P01-1018 | context free grammar ( CFG ) to | tree insertion | grammar ( Schabes and Waters |
| J95-4002 | Richard C Waters MERL MERL MERL MERL | Tree insertion | grammar ( TIG ) is a tree-based |
| J95-4002 | computation costs than CFGs . | Tree insertion | grammar ( TIG ) is a restricted |
| J95-4002 | than with the original CFGs . 2 . | Tree Insertion | Grammar Tree insertion grammar |
