LEADER 00000cam a2200637Ka 4500
001 ocn738438156
003 OCoLC
005 20160527040333.7
006 m o d
007 cr cnu---unuuu
008 110705s2010 enka ob 001 0 eng d
019 754711913|a758543138
020 9781848165618|q(electronic book)
020 1848165617|q(electronic book)
020 |z9781848165601
020 |z1848165609
035 (OCoLC)738438156|z(OCoLC)754711913|z(OCoLC)758543138
040 N$T|beng|epn|cN$T|dEBLCP|dE7B|dYDXCP|dCDX|dSTF|dOCLCQ|dUIU
|dOCLCQ|dOCLCF|dOCLCQ|dDEBSZ|dOCLCQ
049 RIDW
050 4 QA76.9.A43|bG66 2010eb
072 7 COM|x051240|2bisacsh
082 04 005.45|222
090 QA76.9.A43|bG66 2010eb
100 1 Gómez Rodríguez, Carlos.|0https://id.loc.gov/authorities/
names/n2004141683
245 10 Parsing schemata for practical text analysis /|cCarlos
Gómez-Rodriguez.
264 1 London :|bImperial College Press,|c[2010]
264 4 |c©2010
300 1 online resource (xiv, 275 pages) :|billustrations.
336 text|btxt|2rdacontent
337 computer|bc|2rdamedia
338 online resource|bcr|2rdacarrier
340 |gpolychrome|2rdacc
347 text file|2rdaft
490 1 Mathematics, computing, language, and life,|x2042-1044 ;
|vv. 1
504 Includes bibliographical references and index.
505 0 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.
520 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.
588 0 Print version record.
590 eBooks on EBSCOhost|bEBSCO eBook Subscription Academic
Collection - North America
650 0 Computer algorithms.|0https://id.loc.gov/authorities/
subjects/sh91000149
650 0 Parsing (Computer grammar)|0https://id.loc.gov/authorities
/subjects/sh85098312
650 0 Computational linguistics.|0https://id.loc.gov/authorities
/subjects/sh85077224
650 7 Computer algorithms.|2fast|0https://id.worldcat.org/fast/
872010
650 7 Parsing (Computer grammar)|2fast|0https://id.worldcat.org/
fast/1053948
650 7 Computational linguistics.|2fast|0https://id.worldcat.org/
fast/871998
655 0 Electronic books.
655 4 Electronic books.
776 08 |iPrint version:|aGómez-Rodríguez, Carlos.|tParsing
schemata for practical text analysis.|dLondon : Imperial
College Press, ©2010|z9781848165601|w(OCoLC)496951697
830 0 Mathematics, computing, language, and life ;|0https://
id.loc.gov/authorities/names/no2010144282|vv. 1.
856 40 |uhttps://rider.idm.oclc.org/login?url=http://
search.ebscohost.com/login.aspx?direct=true&scope=site&
db=nlebk&AN=374795|zOnline eBook. Access restricted to
current Rider University students, faculty, and staff.
856 42 |3Instructions for reading/downloading this eBook|uhttp://
guides.rider.edu/ebooks/ebsco
901 MARCIVE 20231220
948 |d20160616|cEBSCO|tebscoebooksacademic|lridw
994 92|bRID
