Parsing schemata for practical text analysis:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London
Imperial College Press
©2010
|
| Schriftenreihe: | Mathematics, computing, language, and life
v. 1 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references and index 1. Introduction. 1.1. Motivation. 1.2. Background. 1.3. Outline of the book -- 2. Preliminaries. 2.1. Context-free grammars. 2.2. Parsing algorithms and schemata. 2.3. The formalism of parsing schemata. 2.4. Advantages of parsing schemata -- 3. A compiler for parsing schemata. 3.1. Motivation and goals. 3.2. System architecture. 3.3. Generated code. 3.4. Reading schemata. 3.5. The code generation process. 3.6. Indexing. 3.7. Discussion -- 4. Practical complexity of constituency parsers. 4.1. Parsing natural language with CFGs. 4.2. Parsing with TAGs. 4.3. Parsing schemata for TAG. 4.4. Parsing schemata for the XTAG English grammar. 4.5. Comparing several parsers for the XTAG grammar. 4.6. Parsing with artificially-generated TAGs. 4.7. Overhead of TAG parsing over CFG parsing. 4.8. Discussion -- 5. Error-repair parsing schemata. 5.1. Motivation. 5.2. Error repair in parsing schemata. 5.3. Lyon's error-repair parser. 5.4. Obtaining minimal distance parses. 5.5. Global and regional error repair. 5.6. Discussion -- 6. Transforming standard parsers into error-repair parsers. 6.1. From standard parsers to error-repair parsers. 6.2. Formal description of the error-repair transformation. 6.3. Proof of correctness of the error-repair transformation. 6.4. Optimising the results of the transformation. 6.5. Discussion -- 7. Dependency parsing schemata. 7.1. Motivation. 7.2. The formalism of dependency parsing schemata. 7.3. Parsing schemata for projective dependency parsers. 7.4. Relations between dependency parsers. 7.5. Proving the correctness of dependency parsers. 7.6. Parsing schemata for non-projective dependency parsers. 7.7. Parsing schemata for Link Grammar parsers. 7.8. Discussion -- 8. Mildly non-projective dependency parsing. 8.1. Motivation. 8.2. Preliminaries. 8.3. The WG[symbol] parser. 8.4. The WG[symbol] parser. 8.5. Parsing ill-nested structures. 8.6. Discussion -- 9. Conclusions. 9.1. Future work The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that contains the basic notions needed to understand the rest of the parts. Thus, this compendium can be used as an introduction to natural language parsing, allowing postgraduate students not only to get a solid grasp of the fundamental concepts underlying parsing algorithms, but also an understanding of the latest developments and challenges in the field. Researchers in computational linguistics will find novel results where parsing schemata are applied to current problems that are being actively researched in the computational linguistics community (like dependency parsing, robust parsing, or the treatment of non-projective linguistics phenomena). This book not only explains these results in a more detailed, comprehensive and self-contained way, and highlights the relations between them, but also includes new contributions that have not been presented |
| Beschreibung: | 1 Online-Ressource (xiv, 275 pages) |
| ISBN: | 1848165609 1848165617 9781848165601 9781848165618 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043130386 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s2010 |||| o||u| ||||||eng d | ||
| 020 | |a 1848165609 |9 1-84816-560-9 | ||
| 020 | |a 1848165617 |c electronic bk. |9 1-84816-561-7 | ||
| 020 | |a 9781848165601 |9 978-1-84816-560-1 | ||
| 020 | |a 9781848165618 |c electronic bk. |9 978-1-84816-561-8 | ||
| 035 | |a (OCoLC)738438156 | ||
| 035 | |a (DE-599)BVBBV043130386 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 005.45 |2 22 | |
| 100 | 1 | |a Gómez-Rodríguez, Carlos |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parsing schemata for practical text analysis |c Carlos Gómez-Rodriguez |
| 264 | 1 | |a London |b Imperial College Press |c ©2010 | |
| 300 | |a 1 Online-Ressource (xiv, 275 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics, computing, language, and life |v v. 1 | |
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a 1. Introduction. 1.1. Motivation. 1.2. Background. 1.3. Outline of the book -- 2. Preliminaries. 2.1. Context-free grammars. 2.2. Parsing algorithms and schemata. 2.3. The formalism of parsing schemata. 2.4. Advantages of parsing schemata -- 3. A compiler for parsing schemata. 3.1. Motivation and goals. 3.2. System architecture. 3.3. Generated code. 3.4. Reading schemata. 3.5. The code generation process. 3.6. Indexing. 3.7. Discussion -- 4. Practical complexity of constituency parsers. 4.1. Parsing natural language with CFGs. 4.2. Parsing with TAGs. 4.3. Parsing schemata for TAG. 4.4. Parsing schemata for the XTAG English grammar. 4.5. Comparing several parsers for the XTAG grammar. 4.6. Parsing with artificially-generated TAGs. 4.7. Overhead of TAG parsing over CFG parsing. 4.8. Discussion -- 5. Error-repair parsing schemata. 5.1. Motivation. 5.2. Error repair in parsing schemata. 5.3. Lyon's error-repair parser. 5.4. Obtaining minimal distance parses. 5.5. Global and regional error repair. 5.6. Discussion -- 6. Transforming standard parsers into error-repair parsers. 6.1. From standard parsers to error-repair parsers. 6.2. Formal description of the error-repair transformation. 6.3. Proof of correctness of the error-repair transformation. 6.4. Optimising the results of the transformation. 6.5. Discussion -- 7. Dependency parsing schemata. 7.1. Motivation. 7.2. The formalism of dependency parsing schemata. 7.3. Parsing schemata for projective dependency parsers. 7.4. Relations between dependency parsers. 7.5. Proving the correctness of dependency parsers. 7.6. Parsing schemata for non-projective dependency parsers. 7.7. Parsing schemata for Link Grammar parsers. 7.8. Discussion -- 8. Mildly non-projective dependency parsing. 8.1. Motivation. 8.2. Preliminaries. 8.3. The WG[symbol] parser. 8.4. The WG[symbol] parser. 8.5. Parsing ill-nested structures. 8.6. Discussion -- 9. Conclusions. 9.1. Future work | ||
| 500 | |a The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that contains the basic notions needed to understand the rest of the parts. Thus, this compendium can be used as an introduction to natural language parsing, allowing postgraduate students not only to get a solid grasp of the fundamental concepts underlying parsing algorithms, but also an understanding of the latest developments and challenges in the field. Researchers in computational linguistics will find novel results where parsing schemata are applied to current problems that are being actively researched in the computational linguistics community (like dependency parsing, robust parsing, or the treatment of non-projective linguistics phenomena). This book not only explains these results in a more detailed, comprehensive and self-contained way, and highlights the relations between them, but also includes new contributions that have not been presented | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Language and languages | |
| 650 | 7 | |a COMPUTERS / Software Development & Engineering / Systems Analysis & Design |2 bisacsh | |
| 650 | 7 | |a Computational linguistics |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Parsing (Computer grammar) |2 fast | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Sprache | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 650 | 4 | |a Computational linguistics | |
| 650 | 0 | 7 | |a Syntaktische Analyse |0 (DE-588)4058778-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerlinguistik |0 (DE-588)4035843-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computerlinguistik |0 (DE-588)4035843-4 |D s |
| 689 | 0 | 1 | |a Syntaktische Analyse |0 (DE-588)4058778-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028554577 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175569083957248 |
|---|---|
| any_adam_object | |
| author | Gómez-Rodríguez, Carlos |
| author_facet | Gómez-Rodríguez, Carlos |
| author_role | aut |
| author_sort | Gómez-Rodríguez, Carlos |
| author_variant | c g r cgr |
| building | Verbundindex |
| bvnumber | BV043130386 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)738438156 (DE-599)BVBBV043130386 |
| dewey-full | 005.45 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.45 |
| dewey-search | 005.45 |
| dewey-sort | 15.45 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05557nmm a2200601zcb4500</leader><controlfield tag="001">BV043130386</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2010 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848165609</subfield><subfield code="9">1-84816-560-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848165617</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-84816-561-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848165601</subfield><subfield code="9">978-1-84816-560-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848165618</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-84816-561-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)738438156</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043130386</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.45</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gómez-Rodríguez, Carlos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parsing schemata for practical text analysis</subfield><subfield code="c">Carlos Gómez-Rodriguez</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Imperial College Press</subfield><subfield code="c">©2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiv, 275 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Mathematics, computing, language, and life</subfield><subfield code="v">v. 1</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">1. Introduction. 1.1. Motivation. 1.2. Background. 1.3. Outline of the book -- 2. Preliminaries. 2.1. Context-free grammars. 2.2. Parsing algorithms and schemata. 2.3. The formalism of parsing schemata. 2.4. Advantages of parsing schemata -- 3. A compiler for parsing schemata. 3.1. Motivation and goals. 3.2. System architecture. 3.3. Generated code. 3.4. Reading schemata. 3.5. The code generation process. 3.6. Indexing. 3.7. Discussion -- 4. Practical complexity of constituency parsers. 4.1. Parsing natural language with CFGs. 4.2. Parsing with TAGs. 4.3. Parsing schemata for TAG. 4.4. Parsing schemata for the XTAG English grammar. 4.5. Comparing several parsers for the XTAG grammar. 4.6. Parsing with artificially-generated TAGs. 4.7. Overhead of TAG parsing over CFG parsing. 4.8. Discussion -- 5. Error-repair parsing schemata. 5.1. Motivation. 5.2. Error repair in parsing schemata. 5.3. Lyon's error-repair parser. 5.4. Obtaining minimal distance parses. 5.5. Global and regional error repair. 5.6. Discussion -- 6. Transforming standard parsers into error-repair parsers. 6.1. From standard parsers to error-repair parsers. 6.2. Formal description of the error-repair transformation. 6.3. Proof of correctness of the error-repair transformation. 6.4. Optimising the results of the transformation. 6.5. Discussion -- 7. Dependency parsing schemata. 7.1. Motivation. 7.2. The formalism of dependency parsing schemata. 7.3. Parsing schemata for projective dependency parsers. 7.4. Relations between dependency parsers. 7.5. Proving the correctness of dependency parsers. 7.6. Parsing schemata for non-projective dependency parsers. 7.7. Parsing schemata for Link Grammar parsers. 7.8. Discussion -- 8. Mildly non-projective dependency parsing. 8.1. Motivation. 8.2. Preliminaries. 8.3. The WG[symbol] parser. 8.4. The WG[symbol] parser. 8.5. Parsing ill-nested structures. 8.6. Discussion -- 9. Conclusions. 9.1. Future work</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that contains the basic notions needed to understand the rest of the parts. Thus, this compendium can be used as an introduction to natural language parsing, allowing postgraduate students not only to get a solid grasp of the fundamental concepts underlying parsing algorithms, but also an understanding of the latest developments and challenges in the field. Researchers in computational linguistics will find novel results where parsing schemata are applied to current problems that are being actively researched in the computational linguistics community (like dependency parsing, robust parsing, or the treatment of non-projective linguistics phenomena). This book not only explains these results in a more detailed, comprehensive and self-contained way, and highlights the relations between them, but also includes new contributions that have not been presented</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Language and languages</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Software Development & Engineering / Systems Analysis & Design</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational linguistics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parsing (Computer grammar)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sprache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational linguistics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Syntaktische Analyse</subfield><subfield code="0">(DE-588)4058778-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Syntaktische Analyse</subfield><subfield code="0">(DE-588)4058778-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028554577</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043130386 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:18:22Z |
| institution | BVB |
| isbn | 1848165609 1848165617 9781848165601 9781848165618 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028554577 |
| oclc_num | 738438156 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (xiv, 275 pages) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Imperial College Press |
| record_format | marc |
| series2 | Mathematics, computing, language, and life |
| spelling | Gómez-Rodríguez, Carlos Verfasser aut Parsing schemata for practical text analysis Carlos Gómez-Rodriguez London Imperial College Press ©2010 1 Online-Ressource (xiv, 275 pages) txt rdacontent c rdamedia cr rdacarrier Mathematics, computing, language, and life v. 1 Includes bibliographical references and index 1. Introduction. 1.1. Motivation. 1.2. Background. 1.3. Outline of the book -- 2. Preliminaries. 2.1. Context-free grammars. 2.2. Parsing algorithms and schemata. 2.3. The formalism of parsing schemata. 2.4. Advantages of parsing schemata -- 3. A compiler for parsing schemata. 3.1. Motivation and goals. 3.2. System architecture. 3.3. Generated code. 3.4. Reading schemata. 3.5. The code generation process. 3.6. Indexing. 3.7. Discussion -- 4. Practical complexity of constituency parsers. 4.1. Parsing natural language with CFGs. 4.2. Parsing with TAGs. 4.3. Parsing schemata for TAG. 4.4. Parsing schemata for the XTAG English grammar. 4.5. Comparing several parsers for the XTAG grammar. 4.6. Parsing with artificially-generated TAGs. 4.7. Overhead of TAG parsing over CFG parsing. 4.8. Discussion -- 5. Error-repair parsing schemata. 5.1. Motivation. 5.2. Error repair in parsing schemata. 5.3. Lyon's error-repair parser. 5.4. Obtaining minimal distance parses. 5.5. Global and regional error repair. 5.6. Discussion -- 6. Transforming standard parsers into error-repair parsers. 6.1. From standard parsers to error-repair parsers. 6.2. Formal description of the error-repair transformation. 6.3. Proof of correctness of the error-repair transformation. 6.4. Optimising the results of the transformation. 6.5. Discussion -- 7. Dependency parsing schemata. 7.1. Motivation. 7.2. The formalism of dependency parsing schemata. 7.3. Parsing schemata for projective dependency parsers. 7.4. Relations between dependency parsers. 7.5. Proving the correctness of dependency parsers. 7.6. Parsing schemata for non-projective dependency parsers. 7.7. Parsing schemata for Link Grammar parsers. 7.8. Discussion -- 8. Mildly non-projective dependency parsing. 8.1. Motivation. 8.2. Preliminaries. 8.3. The WG[symbol] parser. 8.4. The WG[symbol] parser. 8.5. Parsing ill-nested structures. 8.6. Discussion -- 9. Conclusions. 9.1. Future work The book presents a wide range of recent research results about parsing schemata, introducing formal frameworks and theoretical results while keeping a constant focus on applicability to practical parsing problems. The first part includes a general introduction to the parsing schemata formalism that contains the basic notions needed to understand the rest of the parts. Thus, this compendium can be used as an introduction to natural language parsing, allowing postgraduate students not only to get a solid grasp of the fundamental concepts underlying parsing algorithms, but also an understanding of the latest developments and challenges in the field. Researchers in computational linguistics will find novel results where parsing schemata are applied to current problems that are being actively researched in the computational linguistics community (like dependency parsing, robust parsing, or the treatment of non-projective linguistics phenomena). This book not only explains these results in a more detailed, comprehensive and self-contained way, and highlights the relations between them, but also includes new contributions that have not been presented Computer science Language and languages COMPUTERS / Software Development & Engineering / Systems Analysis & Design bisacsh Computational linguistics fast Computer algorithms fast Parsing (Computer grammar) fast Informatik Sprache Computer algorithms Parsing (Computer grammar) Computational linguistics Syntaktische Analyse (DE-588)4058778-2 gnd rswk-swf Computerlinguistik (DE-588)4035843-4 gnd rswk-swf Computerlinguistik (DE-588)4035843-4 s Syntaktische Analyse (DE-588)4058778-2 s 1\p DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Gómez-Rodríguez, Carlos Parsing schemata for practical text analysis Computer science Language and languages COMPUTERS / Software Development & Engineering / Systems Analysis & Design bisacsh Computational linguistics fast Computer algorithms fast Parsing (Computer grammar) fast Informatik Sprache Computer algorithms Parsing (Computer grammar) Computational linguistics Syntaktische Analyse (DE-588)4058778-2 gnd Computerlinguistik (DE-588)4035843-4 gnd |
| subject_GND | (DE-588)4058778-2 (DE-588)4035843-4 |
| title | Parsing schemata for practical text analysis |
| title_auth | Parsing schemata for practical text analysis |
| title_exact_search | Parsing schemata for practical text analysis |
| title_full | Parsing schemata for practical text analysis Carlos Gómez-Rodriguez |
| title_fullStr | Parsing schemata for practical text analysis Carlos Gómez-Rodriguez |
| title_full_unstemmed | Parsing schemata for practical text analysis Carlos Gómez-Rodriguez |
| title_short | Parsing schemata for practical text analysis |
| title_sort | parsing schemata for practical text analysis |
| topic | Computer science Language and languages COMPUTERS / Software Development & Engineering / Systems Analysis & Design bisacsh Computational linguistics fast Computer algorithms fast Parsing (Computer grammar) fast Informatik Sprache Computer algorithms Parsing (Computer grammar) Computational linguistics Syntaktische Analyse (DE-588)4058778-2 gnd Computerlinguistik (DE-588)4035843-4 gnd |
| topic_facet | Computer science Language and languages COMPUTERS / Software Development & Engineering / Systems Analysis & Design Computational linguistics Computer algorithms Parsing (Computer grammar) Informatik Sprache Syntaktische Analyse Computerlinguistik |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=374795 |
| work_keys_str_mv | AT gomezrodriguezcarlos parsingschemataforpracticaltextanalysis |