Mihai Surdeanu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nathanael Chambers

> Home > Persons > Mihai Surdeanu

Publications

2013
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/coling/LeeCPCSJ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coling/LeeCPCSJ13
Heeyoung Lee, Angel X. Chang, Yves Peirsman, Nathanael Chambers, Mihai Surdeanu, Dan Jurafsky:
Deterministic Coreference Resolution Based on Entity-Centric, Precision-Ranked Rules. Comput. Linguistics 39(4): 885-916 (2013)
2011
[c37]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/conll/LeePCCSJ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/conll/LeePCCSJ11
Heeyoung Lee, Yves Peirsman, Angel X. Chang, Nathanael Chambers, Mihai Surdeanu, Dan Jurafsky:
Stanford's Multi-Pass Sieve Coreference Resolution System at the CoNLL-2011 Shared Task. CoNLL Shared Task 2011: 28-34
2010
[c35]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/emnlp/RaghunathanLRCSJM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/emnlp/RaghunathanLRCSJM10
Karthik Raghunathan, Heeyoung Lee, Sudarshan Rangarajan, Nate Chambers, Mihai Surdeanu, Dan Jurafsky, Christopher D. Manning:
A Multi-Pass Sieve for Coreference Resolution. EMNLP 2010: 492-501

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.