Scientific applications of language methods / / edited by Carlos Martín-Vide

• Pubblicazione: London, : Imperial College Press, 2011
• Edizione: 1st ed.
• Descrizione fisica: 1 online resource (750 p.)
• Disciplina: 006.3
• Soggetto topico: Formal languages; Natural language processing (Computer science)
• Altri autori: Martín VideCarlos
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references and indexes.
• Nota di contenuto: Preface; Contents; Chapter 1 Descriptional Complexity - An Introductory Survey; 1.1 Introduction; 1.2 Descriptional Systems and Complexity Measures; 1.3 Measuring Sizes; 1.3.1 Descriptional Systems for Regular Languages; 1.3.1.1 Finite Automata; 1.3.1.2 Regular Expressions; 1.3.2 Pushdown Automata and Context-Free Grammars; 1.3.2.1 Pushdown Automata; 1.3.2.2 Context-Free Grammars; 1.4 Measuring Resources; 1.5 Non-Recursive Trade-Offs; 1.5.1 Proving Non-Recursive Trade-Offs; 1.5.2 A Compilation of Non-Recursive Trade-Offs; References ; 3.2.1 Classical Notions3.2.2 Extended Glushkov Construction; 3.2.3 Normal Forms and Casting Operation; 3.2.4 Characterization of Glushkov Automata in the Boolean Case; 3.2.5 The Problem of Reduction Rules; 3.3 Acyclic Glushkov WFA Properties; 3.3.1 K-rules; 3.3.2 Confluence for K-rules; 3.3.3 K-reducibility; 3.3.4 Several Examples of Use for K-rules; 3.4 Glushkov K-graph with Orbits; 3.5 Algorithm for Orbit Reduction; 3.6 Conclusion; References; Chapter 4 Natural Language Dictionaries Implemented as Finite Automata; 4.1 Dictionaries as Finite Automata ; 4.1.1 Simple and Complex, Static and Dynamic4.1.1.1 Implementing a Dictionary; 4.1.2 Variants of Finite-State Machines Relevant to Dictionary Data Structure Implementation; 4.1.2.1 Deterministic Finite-State Automaton; 4.1.2.2 Trie; 4.1.2.3 Minimal Deterministic Finite Automaton; 4.1.2.4 Recursive Automaton; 4.1.2.5 Nondeterministic FA and ε - NDFA; 4.1.2.6 Transducer; 4.1.2.7 Implementing Dictionaries with FSMs; 4.2 Automata as Mappings; 4.2.1 Perfect Hashing; 4.2.2 Morphological Analysis and Synthesis; 4.2.3 Spelling Correction and Restoration of Diacritics ; 4.2.4 Gazetteers and Information Extraction4.2.4.1 Pure DFA Approach; 4.2.4.2 Indexing Automaton Approach; 4.3 Construction Methods; 4.3.1 Construction from Strings; 4.3.2 Construction from Strings with Some Cyclic Structures; 4.3.3 Construction from Smaller Automata; 4.3.4 Construction from Other Sources; 4.4 Internal Structure and Compression; 4.4.1 Representation of Automata; 4.4.1.1 Transition Matrix; 4.4.1.2 Transition Lists; 4.4.1.3 Compressed Transition Matrix; 4.4.1.4 Comparison; 4.4.2 Compression Techniques; 4.4.2.1 A Space Optimized Representation of RA ; 4.4.2.2 Dictionary Compression
• Sommario/riassunto: Presenting interdisciplinary research at the forefront of present advances in information technologies and their foundations, ""Scientific Applications of Language Methods"" is a multi-author volume containing pieces of work (either original research or surveys) exemplifying the application of formal language tools in several fields, including logic and discrete mathematics, natural language processing, artificial intelligence, natural computing and bioinformatics.
• Titolo autorizzato: Scientific applications of language methods
• ISBN: 1-283-14339-9; 9786613143396; 1-84816-545-5
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910819617303321
• Lo trovi qui: Univ. Federico II
• Serie: Mathematics, computing, language, and life ; ; v. 2.