| P04-1041 | contrast to Johnson 's approach , our | LDD resolution | algorithm is not biased . It |
| P04-1041 | frames ( i.e. semantic forms ) and | LDD resolution | paths through f-structure . Tra |
| J08-1003 | treebank-induced CCG-based models including | LDD resolution | . It would be interesting to |
| P04-1041 | robust , and - with the addition of | LDD resolution | - " deep " or " full " , PCFG-based |
| P04-1041 | while we present an approach to | LDD resolution | on the level of f-structure . |
| P04-1041 | order to model the LFG account of | LDD resolution | we require subcat frames ( i.e. |
| J08-1003 | better results are achieved by | LDD resolution | on f-structure ( Cahill et al. |
| P04-1041 | treebank trees and use them in an | LDD resolution | algorithm to parse new text . |
| P04-1041 | DCU 105 , both before and after | LDD resolution | . Using the software described |
| P04-1041 | evaluated a finite approximation of | LDD resolution | in automatically constructed |
| J08-1003 | We also did not use the limited | LDD resolution | for wh - relative clauses provided |
