Hybrid parsing: Using probabilistic models as predictors for a symbolic parser

COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2006, Pages 321-328

  Foth, Kilian A ^a   Menzel, Wolfgang ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY GRAMMAR; ERROR PROPAGATION; PROBABILISTIC MODELS; RULE BASED; UNCERTAIN EVIDENCE;

COMPUTATIONAL LINGUISTICS;

FORMAL LANGUAGES;

EID: 84860510155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Srinivas Bangalore and Aravind K. Joshi. 1999. Supertagging: an approach to almost parsing. Computational Linguistics, 25(2):237-265.
2. Thorsten Brants, Roland Hendriks, Sabine Kramp, Brigitte Krenn, Cordula Preis, Wojciech Skut, and Hans Uszkoreit. 1997. Das NEGRAAnnotationsschema. Negra project report, Universit ät des Saarlandes, Computerlinguistik, Saarbrücken, Germany.
3. Sabine Brants, Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, and George Smith. 2002. The TIGER treebank. In Proceedings of the Workshop on Treebanks and Linguistic Theories, Sozopol.
4. Thorsten Brants. 2000. TnT - A Statistical Part-of-Speech Tagger. In Proceedings of the Sixth Applied Natural Language Processing Conference (ANLP-2000), Seattle, WA, USA.
5. Eugene Charniak. 2000. A maximum-entropyinspired parser. In Proc. NAACL-2000.
6. Stephen Clark and James R. Curran. 2004. The importance of supertagging for wide-coverage CCG parsing. In Proc. 20th Int. Conf. on Computational Linguistics, Coling-2004.
7. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Phd thesis, University of Pennsylvania, Philadephia, PA.
8. Michael Daum, Kilian Foth, and Wolfgang Menzel. 2004. Automatic transformation of phrase treebanks to dependency trees. In Proc. 4th Int. Conf. on Language Resources and Evaluation, LREC-2004, Lisbon, Portugal.
9. Amit Dubey. 2005. What to do when lexicalization fails: parsing German with suffix analysis and smoothing. In Proc. 43rd Annual Meeting of the ACL, Ann Arbor,MI.
10. Kilian Foth and Wolfgang Menzel. 2006. The benefit of stochastic PP-attachment to a rule-based parser. In Proc. 21st Int. Conf. on Computational Linguistics, Coling-ACL-2006, Sydney.
11. Kilian A. Foth, Wolfgang Menzel, and Ingo Schröder. 2000. A Transformation-based Parsing Technique with Anytime Properties. In 4th Int. Workshop on Parsing Technologies, IWPT-2000, pages 89 - 100.
12. Kilian Foth, Michael Daum, and Wolfgang Menzel. 2005. Parsing unrestricted German text with defeasible constraints. In H. Christiansen, P. R. Skadhauge, and J. Villadsen, editors, Constraint Solving and Language Processing, volume 3438 of Lecture Notes in Artificial Intelligence, pages 140-157. Springer-Verlag, Berlin.
13. Kilian Foth, Tomas By, and Wolfgang Menzel. 2006. Guiding a constraint dependency parser with supertags. In Proc. 21st Int. Conf. on Computational Linguistics, Coling-ACL-2006, Sydney.
14. Kilian Foth. 2004. Writing Weighted Constraints for Large Dependency Grammars. In Proc. Recent Advances in DependencyGrammars, COLINGWorkshop 2004, Geneva, Switzerland.
15. Jochen Hagenströmand Kilian A. Foth. 2002. Tagging for robust parsers. In Proc. 2nd. Int. Workshop, RobustMethods in Analysis of Natural Language Data, ROMAND-2002.
16. Robert Malouf and Gertjan van Noord. 2004. Wide coverage parsing with stochastic attribute value grammars. In Proc. IJCNLP-04 Workshop Beyond Shallow Analyses - Formalisms and statistical modeling for deep analyses, Sanya City, China.
17. Hiroshi Maruyama. 1990. Structural disambiguation with constraint propagation. In Proc. 28th Annual Meeting of the ACL (ACL-90), pages 31-38, Pittsburgh, PA.
18. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. Human Language Technology Conference /Conference on Empirical Methods in Natural Language Processing, HLT/EMNLP-2005, Vancouver, B.C.
19. Joakim Nivre. 2003. An Efficient Algorithm for Projective Dependency Parsing. In Proc. 4th International Workshop on Parsing Technologies, IWPT-2003, pages 149-160.
20. Helmut Schmid. 1994. Probabilistic part-of-speech tagging using decision trees. In Int. Conf. on New Methods in Language Processing, Manchester, UK.
21. Ingo Schröder, Horia F. Pop, Wolfgang Menzel, and Kilian Foth. 2001. Learning grammar weights using genetic algorithms. In Proceedings Euroconference Recent Advances in Natural Language Processing, pages 235-239, Tsigov Chark, Bulgaria.
22. Ingo Schröder. 2002. Natural Language Parsing with Graded Constraints. Ph.D. thesis, Dept. of Computer Science, University of Hamburg, Germany.
23. Martin Volk. 2002. Combining unsupervised and supervised methods for pp attachment disambiguation. In Proc. of COLING-2002, Taipeh.
24. Wen Wang and Mary P. Harper. 2004. A statistical constraint dependency grammar (CDG) parser. In Proc. ACLWorkshop Incremental Parsing: Bringing Engineering and Cognition Together, pages 42-49, Barcelona, Spain.