05363nam 22007335 450 99646584530331620200703015318.03-540-46950-810.1007/3-540-52292-1(CKB)1000000000233499(SSID)ssj0000323622(PQKBManifestationID)11240556(PQKBTitleCode)TC0000323622(PQKBWorkID)10318927(PQKB)11206417(DE-He213)978-3-540-46950-6(PPN)155189999(EXLCZ)99100000000023349920121227d1990 u| 0engurnn|008mamaatxtccrGraph-Theoretic Concepts in Computer Science[electronic resource] 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings /edited by Manfred Nagl1st ed. 1990.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1990.1 online resource (XI, 377 p.)Lecture Notes in Computer Science,0302-9743 ;411Bibliographic Level Mode of Issuance: Monograph3-540-52292-1 Disjoint paths in the hypercube -- Time bounds for broadcasting in bounded degree graphs -- t/s-Diagnosable systems: A characterization and diagnosis algorithm -- Toward a complete representation of graphoids in graphs — Abridged Version -- CADULA — A graph-based model for monitoring CAD-processes -- On hyperedge replacement and BNLC graph grammars -- Graph rewriting systems with priorities -- Filtering hyperedge-replacement languages through compatible properties -- Describing distributed systems by categorical graph grammars -- A parser for context free plex grammars -- to PROGRESS, an attribute graph grammar based specification language -- On the complexity of optimal drawings of graphs -- Bounds to the page number of partially ordered sets -- Beyond Steiner's problem: A VLSI oriented generalization -- A fast sequential and parallel algorithm for the computation of the k-closure of a graph -- On feedback problems in digraphs -- Improved self-reduction algorithms for graphs with bounded treewidth -- Finding a minimal transitive reduction in a strongly connected digraph within linear time -- Paging binary trees with external balancing -- The complexity of graph problems for succinctly represented graphs -- An O(n log n) algorithm for 1-D tile compaction -- Weighted parallel triangulation of simple polygons -- Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry -- k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points -- Finding squares and rectangles in sets of points -- Combinatorial properties of abstract Voronoi diagrams.The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.Lecture Notes in Computer Science,0302-9743 ;411Data structures (Computer science)Programming languages (Electronic computers)Software engineeringCombinatoricsAlgorithmsComputersData Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Programming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Data structures (Computer science).Programming languages (Electronic computers).Software engineering.Combinatorics.Algorithms.Computers.Data Structures and Information Theory.Programming Languages, Compilers, Interpreters.Software Engineering/Programming and Operating Systems.Combinatorics.Algorithm Analysis and Problem Complexity.Computation by Abstract Devices.005.74Nagl Manfrededthttp://id.loc.gov/vocabulary/relators/edtBOOK996465845303316Graph-Theoretic Concepts in Computer Science772292UNISA04198nam 2200745 450 991082701230332120230807210957.01-61451-838-61-61451-995-110.1515/9781614518389(CKB)3360000000515429(EBL)1692487(SSID)ssj0001401685(PQKBManifestationID)12607356(PQKBTitleCode)TC0001401685(PQKBWorkID)11370800(PQKB)10109418(MiAaPQ)EBC1692487(DE-B1597)428363(OCoLC)898769824(DE-B1597)9781614518389(Au-PeEL)EBL1692487(CaPaEBR)ebr11006141(CaONFJC)MIL807310(EXLCZ)99336000000051542920150127h20152015 uy 0engur|nu---|u||utxtccrCoreference annotation, resolution and evaluation in Polish /Maciej Ogrodniczuk [and four others]Berlin, [Germany] :Walter de Gruyter, Inc.,2015.©20151 online resource (298 p.)Description based upon print version of record.1-61451-835-1 Includes bibliographical references.Front matter --Contents --Preface --1. Reference, anaphora, coreference --2. Polish coreference-related studies --3. Related work --4. Annotation models --5. Annotation guidelines --6. Annotation methodology --7. Annotation tools --8. Polish Coreference Corpus --9. Resolution approaches --10. Mention detection --11. Rule-based approach --12. Statistical approach --13. Manual annotation evaluation --14. Evaluation approaches --15. Evaluation results --16. Conclusions --17. Perspectives --Acknowledgements --Bibliography‘Coreference’ presents specificities of reference, anaphora and coreference in Polish, establish identity-of-reference annotation model and present methodology used to create the corpus of Polish general nominal coreference. Various resolution approaches are presented, followed by their evaluation. By discussing the subsequent steps of building a coreference-related component of the natural language processing toolset and offering deeper explanation of the decisions taken, this volume might also serve as a reference book on state-of the art methods of carrying out coreference projects for new languages and a tutorial for NLP practitioners. Apart from serving as a description of the fi rst complete approach to annotation and resolution of direct nominal coreference for Polish, this book is a useful starting point for further work on other types of anaphora/coreference, semantic annotation, cognitive linguistics (related to the topic of near-identity, discussed in the book) etc. With extended tutorial-like sections on important subtopics, such as evaluation metrics for coreference resolution, it can prove useful to both researchers and practitioners interested in semantic description of Balto-Slavic languages and their processing, engineers developing language resources, tools and linguistic processing chains, as well as computational linguists in general.Polish languageSemanticsPolish languageSyntaxReference (Linguistics)Anaphora (Linguistics)Applied Linguistics.Corpus Linguistics.Discourse Analysis.Natural Language Processing.Speech Processing.Speech Technoloy.Text Analysis.Polish languageSemantics.Polish languageSyntax.Reference (Linguistics)Anaphora (Linguistics)491.8/501456Ogrodniczuk Maciej , authttp://id.loc.gov/vocabulary/relators/aut1696424Ogrodniczuk MaciejMiAaPQMiAaPQMiAaPQBOOK9910827012303321Coreference4076395UNINA