This is similar to the `` deletion '' strategy employed by Zettlemoyer and Collins ( 2007 ) , but we do it directly in the grammar .
online learning of relaxed ccg grammars for parsing to logical form
Luke S Zettlemoyer Michael Collins
If no parse is found yet , then the parser attempts to strategically allow tokens to subsume a neighbor by making it a dependent ( first with a restricted root set , then without ) . This is similar to the `` deletion '' strategy employed by Zettlemoyer and Collins ( 2007 ) , but we do it directly in the grammar . We add unary rules of the form ( D ) - * u for every potential supertag u in the tree .
This is similar to the `` deletion '' strategy employed by @@CITATION , but we do it directly in the grammar .