uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
Departamento de Computación, Universidade da Coruña.
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Languages, Department of Linguistics and Philology. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
Department of Information Engineering, University of Padua.
Department of Informatics, University of Sussex.
2009 (English)In: Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, 2009, 539-547 p.Conference paper, Published paper (Refereed)
Abstract [en]

Linear Context-free Rewriting Systems (LCFRS) is an expressive grammar formalism with applications in syntax-based machine translation. The parsing complexity of an LCFRS is exponential in both the rank of a production, defined as the number of nonterminals on its right-hand side, and a measure for the discontinuity of a phrase, called fan-out. In this paper, we present an algorithm that transforms an LCFRS into a strongly equivalent form in which all productions have rank at most 2, and has minimal fan-out. Our results generalize previous work on Synchronous Context-Free Grammar, and are particularly relevant for machine translation from or to languages that require syntactic analyses with discontinuous constituents.

Place, publisher, year, edition, pages
2009. 539-547 p.
National Category
Language Technology (Computational Linguistics) Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
Identifiers
URN: urn:nbn:se:uu:diva-105319OAI: oai:DiVA.org:uu-105319DiVA: diva2:221080
Conference
NAACL HLT 2009. May 31-June 5, Boulder, Colorado
Available from: 2009-06-03 Created: 2009-06-03 Last updated: 2013-07-17

Open Access in DiVA

No full text

Other links

http://www.aclweb.org/anthology/N09-1061

Authority records BETA

Kuhlmann, Marco

Search in DiVA

By author/editor
Kuhlmann, Marco
By organisation
Department of Linguistics and Philology
Language Technology (Computational Linguistics)Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 476 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf