Survey: finite-state technology in natural language processing (Q2357102): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4939994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of a family of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Domain Ontologies from Document Warehouses and Dedicated Web Sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on maximum likelihood estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Inference for Probabilistic Functions of Finite State Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and Probabilistic Context-Free Grammars Are Equally Expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and weighted grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable formal power series on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OpenFst: A General and Efficient Weighted Finite-State Transducer Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiburon: A Weighted Tree Automata Toolkit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Machine Translation / rank
 
Normal rank

Latest revision as of 00:37, 14 July 2024

scientific article
Language Label Description Also known as
English
Survey: finite-state technology in natural language processing
scientific article

    Statements

    Survey: finite-state technology in natural language processing (English)
    0 references
    0 references
    19 June 2017
    0 references
    This is a survey on the use of finite-state information and technology for natural language processing, in problems such as tokenization, part-of-speech tagging, parsing. All the involved concepts are thoroughly presented and accompanied by examples. It is overall a theoretical material suitable for computer scientists with a background in automata theory.
    0 references
    natural language processing
    0 references
    finite-state automaton
    0 references
    tokenization
    0 references
    part-of-speech tagging
    0 references
    parsing
    0 references
    tree automaton
    0 references
    context-free grammar
    0 references
    machine translation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers