liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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, A Coruña, Spain.
Uppsala universitet, Institutionen för lingvistik och filologi. (Datorlingvistik)ORCID iD: 0000-0002-2492-9872
Department of Information Engineering, University of Padua, Padua, Italy.
Department of Informatics, University of Sussex, East Sussex, Storbritannien.
2009 (English)In: Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Stroudsburg, PA, USA: Association for Computational Linguistics, 2009, 539-547 p.Conference paper, Published paper (Other academic)
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
Stroudsburg, PA, USA: Association for Computational Linguistics, 2009. 539-547 p.
National Category
Language Technology (Computational Linguistics) Language Technology (Computational Linguistics)
Research subject
Computational Linguistics
Identifiers
URN: urn:nbn:se:liu:diva-100289ISBN: 978-1-932432-41-1 (print)OAI: oai:DiVA.org:liu-100289DiVA: diva2:661451
Conference
NAACL HLT 2009. May 31-June 5, Boulder, Colorado, USA
Available from: 2009-06-03 Created: 2013-11-04 Last updated: 2014-10-08Bibliographically approved

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
Language Technology (Computational Linguistics)Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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