Finite-State Techniques
DOI10.1017/9781108756945zbMath1465.68006OpenAlexW4252420661MaRDI QIDQ5741952
Publication date: 16 May 2019
Full work available at URL: https://doi.org/10.1017/9781108756945
lexiconrational functionnatural language processingimplementationpattern matchingmonoidfinite-state automatonrational relationfinite-state transducerrational languagebimachinerational setfunctional programming language C(M)natural language morphologysubsequential function
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Natural language processing (68T50) General topics in the theory of algorithms (68W01)
Related Items (2)
This page was built for publication: Finite-State Techniques