Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-Occurrence Constraints

Hideki Hirakawa. Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-Occurrence Constraints. In ACL 2006, 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Sydney, Australia, 17-21 July 2006. The Association for Computer Linguistics, 2006. [doi]

@inproceedings{Hirakawa06,
  title = {Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-Occurrence Constraints},
  author = {Hideki Hirakawa},
  year = {2006},
  url = {http://acl.ldc.upenn.edu/P/P06/P06-2047.pdf},
  tags = {constraints, graph-rewriting, rewriting, search},
  researchr = {https://researchr.org/publication/Hirakawa06},
  cites = {0},
  citedby = {0},
  booktitle = {ACL 2006, 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Sydney, Australia, 17-21 July 2006},
  publisher = {The Association for Computer Linguistics},
}