Computational Lexicography
Formal and Applied
Exemplified with muffin recipes

Thorsten Trippel
Mathematics and English (Sek I + II)
Course: Computational Lexicography
Winter Term 1998/99
Lecturer: Prof. Dr. Dafydd Gibbon

Bielefeld, November 16, 1999

Thorsten Trippel

E-Mail: ttrippel@spectrum.uni-bielefeld.de/~ttrippel

 
• Contents
• Introduction
  • What is a lexicon?
    • Possible lexica: general lexica
      • Corpus based collection of information
      • Normative or prescriptive creation of information
    • Possible lexica: domain specific
      • Corpus based
      • Normative/Prescriptive
      • Difference to termbases
  • Hyperlexica
    • Reasons for referencing in dictionaries
    • Ways of referencing
      • Crossreferencing (DTP)
    • Referencing with HTML
    • SGML
    • DATR
• Fomalising lexical relations: Lexicon as a relation between sets
  • Lexicon as an injective map
  • Lexicon as a surjective relation
  • Lexicon as a bijective relation
  • Problems forming bijective lexica
• Text-technologic tagging of lexica
  • SGML-coding of lexica versus DATR-coding
    • Comparison of DATR and SGML coding of lexica
    • Exclusive use of one method
    • The method of choice
• Implementation of data: Writing a DATR-theory
  • Verbs
    • Pronunciation rules for verbs in unmarked forms and in the continuous aspect
    • Pronunciation rules for verbs, marked
    • Orthographic rules implemented
  • Rules for nouns
  • Rules for adjectives
  • Other wordclasses
  • Exceptions
• Corpus: Recipe
  • Plain Muffins
• DATR theory
• DATR declaration file
• DATR token file
• Query to the DATR-theory
• References

Thorsten Trippel Tue Nov 16 15:01:58 MET 1999