LEADER 04760nam 2200661 a 450 001 9910461625203321 005 20200520144314.0 010 $a1-283-14339-9 010 $a9786613143396 010 $a1-84816-545-5 035 $a(CKB)2670000000095728 035 $a(EBL)731303 035 $a(OCoLC)738434089 035 $a(SSID)ssj0000640903 035 $a(PQKBManifestationID)12291476 035 $a(PQKBTitleCode)TC0000640903 035 $a(PQKBWorkID)10614497 035 $a(PQKB)11047352 035 $a(MiAaPQ)EBC731303 035 $a(WSP)0000P707 035 $a(Au-PeEL)EBL731303 035 $a(CaPaEBR)ebr10480156 035 $a(CaONFJC)MIL314339 035 $a(EXLCZ)992670000000095728 100 $a20110714d2011 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aScientific applications of language methods$b[electronic resource] /$fedited by Carlos Marti?n-Vide 210 $aLondon $cImperial College Press$d2011 215 $a1 online resource (750 p.) 225 1 $aMathematics, computing, language, and life. Frontiers in mathematical linguistics and language theory,$x2042-1044 ;$vv. 2 300 $aDescription based upon print version of record. 311 $a1-84816-544-7 320 $aIncludes bibliographical references and indexes. 327 $aPreface; 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 327 $a3.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 327 $a4.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 327 $a4.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 327 $a4.4.2.2 Dictionary Compression 330 $aPresenting 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. 410 0$aMathematics, computing, language, and life ;$vv. 2. 606 $aFormal languages 606 $aNatural language processing (Computer science) 608 $aElectronic books. 615 0$aFormal languages. 615 0$aNatural language processing (Computer science) 676 $a006.3 701 $aMarti?n Vide$b Carlos$0168387 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461625203321 996 $aScientific applications of language methods$92203671 997 $aUNINA