| Stephan Oepen and John Carroll. 2000. Ambiguity packing in constraint-based parsing - practical results. In Proceedings of the North American Chapter of the Association for Computational Linguistics (NAACL), pages 162--169, Seattle, WA. |
No context found.
Stephan Oepen and John Carroll. 2000. Ambiguity packing in constraint-based parsing - practical results. In Proceedings of the North American Chapter of the Association for Computational Linguistics (NAACL), pages 162--169, Seattle, WA.
No context found.
Stepan Oepen and John Carroll. 2000a. Ambiguity packing in constraint-based parsing - practical results. In Proceedings of the 1st Conference of the North American Chapter of the Association for Computational Linguistics, pages 162-- 169, Seattle, WA.
....by Schmid and Rooth s algorithm. However, there are problems. If the test for being able to pack local ambiguities in the unification grammar parse forest is feature structure subsumption, unpacking a parse apparently encoded in the forest can fail due to non local inconsistency in feature values (Oepen and Carroll, 2000) 6 , so every governor tuple hypothesis would have to be checked to ensure that the parse it came from was globally valid. It is likely that this verification step would cancel out the e#ciency gained from using an algorithm based on dynamic programming. This problem could be side stepped (but ....
Oepen, S. and J. Carroll (2000) Ambiguity packing in constraint-based parsing --- practical results. In Proceedings of the 1st Conference of the North American Chapter of the ACL, 162--169. Seattle, WA.
No context found.
Stephan Oepen and John Carroll. Ambiguity packing in constraint-based parsing: Practical results. In Proceedings of the 1st Conference of the North American Chapter of the ACL, pages 162--169, Seattle, WA, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC