{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":26,"n_cols":5,"rows_kept":26,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[19,2,19,3],[20,2,20,3],[24,2,24,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465914203316"]
[null,null,"Titolo",null,"Finite-State Methods and Natural Language Processing [[electronic resource] ] : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"1-281-38797-5"]
[{"$nulls":4},"3-540-35469-7"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIV, 312 p.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 4002"]
[null,null,"Disciplina",null,"006.3/5"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Lectures -- Characterizations of Regularity -- Finnish Optimality-Theoretic Prosody -- Contributed Papers -- Partitioning Multitape Transducers -- Squeezing the Infinite into the Finite -- A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers -- Finite-State Registered Automata and Their Uses in Natural Languages -- TAGH: A Complete Morphology for German Based on Weighted Finite State Automata -- Klex: A Finite-State Transducer Lexicon of Korean -- Longest-Match Pattern Matching with Weighted Finite State Automata -- Finite-State Syllabification -- Algorithms for Minimum Risk Chunking -- Collapsing ?-Loops in Weighted Finite-State Machines -- WFSM Auto-intersection and Join Algorithms -- Further Results on Syntactic Ambiguity of Internal "]
[{"$nulls":4},"Contextual Grammars -- Error-Driven Learning with Bracketing Constraints -- Parsing with Lexicalized Probabilistic Recursive Transition Networks -- Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines -- Modelling the Semantics of Calendar Expressions as Extended Regular Expressions -- Using Finite State Technology in a Tool for Linguistic Exploration -- Applying a Finite Automata Acquisition Algorithm to Named Entity Recognition -- Principles, Implementation Strategies, and Evaluation of a Corpus Query System -- On Compact Storage Models for Gazetteers -- German Compound Analysis with wfsc -- Scaling an Irish FST Morphology Engine for Use on Unrestricted Text -- Improving Inter-level Communication in Cascaded Finite-State Partial Parsers -- Pivotal Synchronization Languages: A Framework for Alignments -- Abstracts of Interactive Presentations -- A Complete FS Model for Amharic Morphographemics -- Tagging with Delayed Disambiguation -- A New Algorithm for Unsupervised Induction of Concatenative Morphology -- Morphological Parsing of Tone: An Experiment with Two-Level Morphology on the Ha Language -- Describing Verbs in Disjoining Writing Systems -- An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System -- Finite State Transducers Based on k-TSS Grammars for Speech Translation -- Abstracts of Software Demos -- Unsupervised Morphology Induction Using Morfessor -- SProUT – A General-Purpose NLP Framework Integrating Finite-State and Unification-Based Grammar Formalisms -- Tool Demonstration: Functional Morphology -- From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology -- A Programming Language for Finite State Transducers -- FIRE Station."]