@article{ranta04:GF,
  author = {Aarne Ranta},
  title = {Grammatical {F}ramework, a Type-Theoretical Grammar Formalism},
  journal = {The Journal of Functional Programming},
  year = {2004},
  volume = {14},
  number = {2},
  pages = {145--189},
  note = {\url{http://www.cs.chalmers.se/~aarne/articles/gf-jfp.ps.gz}}
}

@phdthesis{ljunglof04:phd,
  author =       {Peter Ljungl\"of},
  title =        {Expressivity and Complexity of the Grammatical Framework},
  school =       {G\"oteborg University},
  address =      {Gothenburg, Sweden},
  month =        {November},
  year =         {2004},
  note = {\url{http://www.cs.chalmers.se/~peb/pubs/p04-PhD-thesis.pdf}}
}

@incollection{nederhof-regular-2000,
   Author = {Nederhof, Mark-Jan},
   Title = {Regular Approximation of CFLs: A Grammatical View},
   BookTitle = {Advances in Probabilistic and other Parsing Technologies},
   Editor = {Bunt, Harry and Nijholt, Anton},
   Publisher = {Kluwer Academic Publishers},
   Pages = {221-241},
   note = {\url{http://www.coli.uni-sb.de/publikationen/softcopies/Nederhof:2000:RACa.pdf}},
   Abstract = {We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.},
 Year = {2000} 
}

@incollection{mohri-nederhof-regular-2001,
   Author = {Mohri, Mehryar and Nederhof, Mark-Jan},
   Title = {Regular Approximation of Context-Free Grammars through Transformation},
   BookTitle = {Robustness in Language and Speech Technology},
   Editor = {Junqua, Jean-Claude  and van Noord, Gertjan},
   Address = {Dordrecht},
   Publisher = {Kluwer Academic Publishers},
   Pages = {153--163},
   note = {\url{http://www.coli.uni-sb.de/publikationen/softcopies/Mohri:2001:RAC.pdf}},
   Abstract = {We present an algorithm for approximating context-free languages with regular languages. The algorithm is based on a simple transformation that applies to any context-free grammar and guarantees that the result can be compiled into a finite automaton. The resulting grammar contains at most one new nonterminal for any nonterminal symbol of the input grammar. The result thus remains readable and if necessary modifiable. We extend the approximation algorithm to the case of weighted context-free grammars. We also report experiments with several grammars showing that the size of the minimal deterministic automata accepting the resulting approximations is of practical use for applications such as speech recognition.},
 Year = {2001} }

@incollection{brzozowski,
author = {J. A. Brzozowski},
title = {Canonical regular expressions and minimal state graphs for definite events},
booktitle = {Mathematical theory of Automata},
note = {Volume 12 of MRI Symposia Series},
pages = {529--561},
publisher = {Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y.},
year = {1962}
}


@manual{atk,
  title = {{ATK} - {A}n {A}pplication {T}oolkit for {HTK}},
  author = {Steve Young},
  edition = {1.4.1},
  organization = {Machine Intelligence Laboratory, Cambridge University Engineering Dept},
  address = {Trumpington Street, Cambridge, CB2 1PZ, United Kingdom},
  year = {2004},
  month = {July},
  note = {\url{http://mi.eng.cam.ac.uk/~sjy/ATK_Manual.pdf}}
}

@book{htkbook,
  author = {Steve Young and Gunnar Evermann and Mark Gales and Thomas Hain and Dan Kershaw
            and Gareth Moore and Julian Odell and Dave Ollason and Dan Povey 
            and Valtcho Valtchev and Phil Woodland},
  title = {The {HTK} Book (for {HTK} Version 3.3)},
  publisher = {Cambridge University Engineering Department},
  year = {2005},
  month = {April},
  note = {\url{http://htk.eng.cam.ac.uk/prot-docs/htkbook.pdf}}
}

@misc{TIMIT,
  title = {{DARPA} {TIMIT} Acoustic-Phonetic Continuous Speech Corpus},
  note = {\url{http://www.ldc.upenn.edu/Catalog/LDC93S1.html}}
}

@misc{markus-swedish-transcription,
  author = {Markus Forsberg},
  title = {Automatic Transcription of Swedish},
  note = {\url{http://www.cs.chalmers.se/~markus/transcription/gtp.cgi}}
}

@misc{sampa-swedish,
  author = {J.C. Wells},
  title = {{SAMPA} for {S}wedish},
  note = {\url{http://www.phon.ucl.ac.uk/home/sampa/swedish.htm}}
}

@misc{sphinxtrain,
  author = {Rita Singh},
  title = {{S}phinx{T}rain Documentation},
  note = {\url{http://fife.speech.cs.cmu.edu/sphinxman/scriptman1.html}}
}

@article{swadesh1952,
  author =       "Morris Swadesh",
  title =        "Lexico-Statistic Dating of Prehistoric Ethnic Contacts",
  journal =      "Proceedings of the American Philosophical Society",
  volume =       "96",
  year =         "1952",
  pages =	 "452-463"
}

@inproceedings{dowding01practical,
    author = {John Dowding and Beth Ann Hockey and Jean Mark Gawron and Christopher Culy},
    title = {Practical Issues in Compiling Typed Unification Grammars for Speech Recognition},
    booktitle = {Meeting of the Association for Computational Linguistics},
    pages = {164--171},
    year = {2001},
    url = {http://www.stanford.edu/~jdowding/pubs/acl2001.pdf}
}

@mastersthesis{bringert:embedded-grammars,
  title = {Embedded Grammars},
  author = {Bj\"orn Bringert},
  school = {Chalmers University of Technology},
  address = {Gothenburg, Sweden},
  month = {February},
  year = {2005},
  url = {http://www.cs.chalmers.se/~bringert/publ/exjobb/embedded-grammars.pdf}
}

@manual{nuance:intro,
  title = {Nuance Speech Recognition System 8.5: Introduction to the {N}uance System},
  month = {December},
  year = {2003},
  organization = {Nuance Communications, Inc.},
  address = {Menlo Park, CA, USA}
}

@misc{beep-dict,
  title = {British English Example Pronunciations Dictionary},
  author = {Tony Robinson},
  year = {1997},
  note = {\url{http://www.speech.cs.cmu.edu/comp.speech/Section1/Lexical/beep.html}}
}