<--- Back to Details
First PageDocument Content
Theoretical computer science / Linguistics / Latin script / Computational complexity theory / List decoding / Swedish language / Reed–Solomon error correction / Ö / Diaeresis / Coding theory / Error detection and correction / Latin alphabet ligatures
Date: 2007-08-30 00:21:36
Theoretical computer science
Linguistics
Latin script
Computational complexity theory
List decoding
Swedish language
Reed–Solomon error correction
Ö
Diaeresis
Coding theory
Error detection and correction
Latin alphabet ligatures

29 Chapter 3

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

File Size: 713,04 KB

Share Document on Facebook

Similar Documents

Size is not Everything Genre Balance in Bootstrapping a Swedish PoS Tagger Eva Forsbom Department of Linguistics and Philology, Uppsala University Graduate School of Language Technology

DocID: 1ve5q - View Document

1 The Development and Performance of a Grammar Checker for Swedish: A Language Engineering Perspective J. C a r l b e r g e r, R. D o m e i j, V. K a n n, O. K n u t s s o n

DocID: 1uT3n - View Document

MedEval The Construction of a Swedish Medical Test Collection Karin Friberg Heppin Department of Swedish Language University of Gothenburg Gothenburg, Sweden

DocID: 1uGaY - View Document

Revisiting Reduplication Toward a description of reduplication in predicative signs in Swedish Sign Language Carl Börstell

DocID: 1tk0X - View Document

Verb Morphology of Hebrew and Maltese — Towards an Open Source Type Theoretical Resource Grammar in GF Dana Dannélls∗ and John J. Camilleri† ∗ Department of Swedish Language, University of Gothenburg

DocID: 1tfYa - View Document