Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stephen Soderland

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 Kobi Reiter

> Home > Persons > Stephen Soderland

Publications

2010
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/ai/MausamSEWRSSB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/MausamSEWRSSB10
Mausam, Stephen Soderland, Oren Etzioni, Daniel S. Weld, Kobi Reiter, Michael Skinner, Marcus Sammer, Jeff A. Bilmes:
Panlingual lexical translation via probabilistic inference. Artif. Intell. 174(9-10): 619-637 (2010)
2007
[c21]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/mtsummit/EtzioniRSS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mtsummit/EtzioniRSS07
Oren Etzioni, Kobi Reiter, Stephen Soderland, Marcus Sammer:
Lexical translation with application to image searching on the web. MTSummit 2007
2006
[c18]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/amta/SammerRSKE06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/amta/SammerRSKE06
Marcus Sammer, Kobi Reiter, Stephen Soderland, Katrin Kirchhoff, Oren Etzioni:
Ambiguity Reduction for Machine Translation: Human-Computer Collaboration. AMTA 2006: 193-202

a service of

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.