NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 1
  • 1
  • Tagged with
  • 5
  • 5
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 5 of 5 (0.074 seconds)

Spelling suggestions: "subject:"algebraische spezifikation"" "subject:"algebraische misspezifikation""

1

Zur Kontextanalyse einer algebraischen Programmiersprache

Maeder, Christian. January 2001 (has links) (PDF)
Berlin, Techn. Univ., Diss., 2001.
Algebraische Spezifikation
2

Integration of verification and testing into compilation systems concept and case study /

Didrich, Klaus. Unknown Date (has links) (PDF)
Techn. University, Diss., 2001--Berlin.
3

Zur Kontextanalyse einer algebraischen Programmiersprache

Maeder, Christian. Unknown Date (has links) (PDF)
Techn. Universiẗat, Diss., 2001-- Berlin.
4

Algebraic decoder specification: coupling formal-language theory and statistical machine translation

Büchse, Matthias 28 January 2015 (has links) (PDF)
The specification of a decoder, i.e., a program that translates sentences from one natural language into another, is an intricate process, driven by the application and lacking a canonical methodology. The practical nature of decoder development inhibits the transfer of knowledge between theory and application, which is unfortunate because many contemporary decoders are in fact related to formal-language theory. This thesis proposes an algebraic framework where a decoder is specified by an expression built from a fixed set of operations. As yet, this framework accommodates contemporary syntax-based decoders, it spans two levels of abstraction, and, primarily, it encourages mutual stimulation between the theory of weighted tree automata and the application.
Maschinelles Übersetzen
Algebraische Spezifikation
Theorie der formalen Sprachen
Gewichtete Baumautomaten
machine translation
algebraic specification
formal-language theory
weighted tree automata
ddc:004
rvk:ST 136
Maschinelle Übersetzung
Automatentheorie
Algebra
5

Algebraic decoder specification: coupling formal-language theory and statistical machine translation: Algebraic decoder specification: coupling formal-language theory and statistical machine translation

Büchse, Matthias 18 December 2014 (has links)
The specification of a decoder, i.e., a program that translates sentences from one natural language into another, is an intricate process, driven by the application and lacking a canonical methodology. The practical nature of decoder development inhibits the transfer of knowledge between theory and application, which is unfortunate because many contemporary decoders are in fact related to formal-language theory. This thesis proposes an algebraic framework where a decoder is specified by an expression built from a fixed set of operations. As yet, this framework accommodates contemporary syntax-based decoders, it spans two levels of abstraction, and, primarily, it encourages mutual stimulation between the theory of weighted tree automata and the application.
info:eu-repo/classification/ddc/004
ddc:004

Page generated in 0.0769 seconds