Parsing Beyond Context-Free Grammars
Given that context-free grammars (CFG) cannot adequately describe natural languages, grammar formalisms beyond CFG that are still computationally tractable are of central interest for computational linguists. This book provides an extensive overview of the formal language landscape between CFG and P...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
Σειρά: | Cognitive Technologies,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Grammar Formalisms for Natural Languages
- Parsing: Preliminaries
- Tree Adjoining Grammars
- Parsing Tree Adjoining Grammars
- Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
- Parsing MCFG, LCFRS and Simple RCG
- Range Concatenation Grammars
- Parsing Range Concatenation Grammars
- Automata.