default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"Some Computational Complexity Results for Synchronous Context-Free Grammars."

Giorgio Satta, Enoch Peserico (2005)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-06

- view
  - electronic edition @ aclanthology.org (open access)
- export record
  dblp key:
  - conf/naacl/SattaP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/naacl/SattaP05
Giorgio Satta, Enoch Peserico:
Some Computational Complexity Results for Synchronous Context-Free Grammars. HLT/EMNLP 2005: 803-810

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.