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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Kallmeyer, Laura (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Cognitive Technologies,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02752nam a22004575i 4500
001 978-3-642-14846-0
003 DE-He213
005 20151204154648.0
007 cr nn 008mamaa
008 100825s2010 gw | s |||| 0|eng d
020 |a 9783642148460  |9 978-3-642-14846-0 
024 7 |a 10.1007/978-3-642-14846-0  |2 doi 
040 |d GrThAP 
050 4 |a P98-98.5 
072 7 |a CFX  |2 bicssc 
072 7 |a LAN009000  |2 bisacsh 
072 7 |a COM018000  |2 bisacsh 
082 0 4 |a 410.285  |2 23 
100 1 |a Kallmeyer, Laura.  |e author. 
245 1 0 |a Parsing Beyond Context-Free Grammars  |h [electronic resource] /  |c by Laura Kallmeyer. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XII, 248 p. 76 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Cognitive Technologies,  |x 1611-2482 ;  |v 0 
505 0 |a 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. 
520 |a 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 PTIME, moving from Tree Adjoining Grammars to Multiple Context-Free Grammars and then to Range Concatenation Grammars while explaining available parsing techniques for these formalisms. Although familiarity with the basic notions of parsing and formal languages is helpful when reading this book, it is not a strict requirement. The presentation is supported with many illustrations and examples relating to the different formalisms and algorithms, and chapter summaries, problems and solutions. The book will be useful for students and researchers in computational linguistics and in formal language theory. 
650 0 |a Linguistics. 
650 0 |a Computational linguistics. 
650 1 4 |a Linguistics. 
650 2 4 |a Computational Linguistics. 
650 2 4 |a Language Translation and Linguistics. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642148453 
830 0 |a Cognitive Technologies,  |x 1611-2482 ;  |v 0 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-14846-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)