Computational Linguistics - Fachbereich 10
Computer Science • Formal Language Theory (mathematics: 1930s + 1940s) – a language is a set of strings – grammars can describe sets of strings – we can divide grammars into distinct classes according to how ‘powerful’ powerful they are Sprach- und Literaturwissenschaften 36
Example • A ‘language’ might be the set of strings: – {ab, { , aabb, , aaabbb, , aaaabbbb, , …} } • Thi This can be b produced d d bby a grammar of f th the following kind: A → ab A → aAb (Questions of ‘meaning’ left out for the time being) Sprach- und Literaturwissenschaften 37
Language as an Emergent Phenomenon
CConvergence of f LLexicons i (Stee
Perspective in Spatial Language L.
Computational Linguistics linguisti
Language is ‘doubly doubly articu
Natural Language Technology computa
Levels of language technology • P
• History Computational Linguisti
Change language