Graph branch algorithm: An optimum tree search method for scored dependency graph with arc co-occurrence constraints

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

Volumn , Issue , 2006, Pages 361-368

  Hirakawa, Hideki ^a  

^a TOSHIBA CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORESTRY;

ARC CO; CO-OCCURRENCE; COMPUTATIONAL AMOUNTS; DEPENDENCY FOREST; DEPENDENCY GRAMMAR; DEPENDENCY GRAPHS; DEPENDENCY TREES; SHARED DATA STRUCTURE; TREE SEARCH ALGORITHM; TREE-SEARCH METHODS;

DATA STRUCTURES;

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

References (17)

1. Y. J. Chu and T. H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14.
2. J. Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards, 71B:233-240.
3. J. Eisner. 1996. Three new probabilistic models for dependency parsing: An exploration. In Proceedings of COLING'96, pages 340-345.
4. M. Harada and T. Mizuno. 2001. Japanese semantic analysis system sage using edr (in japanese). Transactions of JSAI, 16(1):85-93.
5. H. Hirakawa. 2001. Semantic dependency analysis method for japanese based on optimum tree search algorithm. In Proceedings of the PACLING2001.
6. H. Hirakawa. 2005. Evaluation measures for natural language analyser based on preference dependency grammar. In Proceedings of the PACLING2005.
7. H. Hirakawa. 2006. Preference dependency grammar and its packed shared data structure'dependency forest' (in japanese). To appear in Natural Language Processing, 13(3).
8. T. Ibaraki. 1978. Branch-and-bounding procedure and state-space representation of combinatorial optimization problems. Information and Control, 36,1-27.
9. S. Kanahe, A. Nasr, and O. Rambow. 1998. Pseudo-projectivity: A polynomially parsable non-projective dependency grammar. In COLING-ACL'98, pages 646-52.
10. N. Katoh and T. Ehara. 1989. A fast algorithm for dependency structure analysis (in japanese). In Proceedings of 39th Annual Convention of the Information Processing Society.
11. S. Lee and K. S. Choi. 1997. Reestimation and best-first parsing algorithm for probablistic dependency grammars. In Proceedings of the Fifth Workshop on Very Large Corpora, pages 41-55.
12. H. Maruyama. 1990. Constraint dependency grammar and its weak generative capacity. Computer Software.
13. R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proceedings of HLTEMNLP, pages 523-530.
14. J. Nivre and J. Nilsson. 2005. Pseudo-projective dependency parsing. In ACL-05, pages 99-106.
15. K. Ozeki and Y. Zhang. 1999. 最小コスト分割問題としての係り受け解析. In Proceeding of the Workshop of The Fifth Annual Meeting of The Association for Natural Language Processing, pages 9-14.
16. K. Ozeki. 1994. Dependency structure analysis as combinatorial optimization. Information Sciences, 78(1-2):77-99.
17. W. Wang and M. P. Harper. 2004. A statistical constraint dependency grammar (cdg) parser. In Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (ACL), pages 42-49.