scientific article; zbMATH DE number 1773072

MaRDI QIDQ4540955zbMATH OpenFDO

Authors Lauri Karttunen

Publication date 28 July 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2088/20880034

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 2081050
• Finite state transducers with predicates and identities
• scientific article; zbMATH DE number 1670708
• Finite-state registered automata for non-concatenative morphology
• Finite state transducers

Cited in

(16)

• State complexity of unique rational operations
• Survey: finite-state technology in natural language processing
• scientific article; zbMATH DE number 1670708 (Why is no real title available?)
• Finite-state registered automata for non-concatenative morphology
• Efficiently Matching with Local Grammars Using Prefix Overlay Transducers
• An application of virtual deterministic finite automaton (VDFA) in natural language processing (NLP)
• Finite State Transducers with Intuition
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• scientific article; zbMATH DE number 1952683 (Why is no real title available?)
• scientific article; zbMATH DE number 2040887 (Why is no real title available?)
• scientific article; zbMATH DE number 2081050 (Why is no real title available?)
• scientific article; zbMATH DE number 1773099 (Why is no real title available?)
• scientific article; zbMATH DE number 7488335 (Why is no real title available?)
• Grammatical Inference: Algorithms and Applications
• State complexity of basic language operations combined with reversal
• Finite-state methods and natural language processing. 8th international workshop, FSMNLP 2009, Pretoria, South Africa, July 21--24, 2009. Revised selected papers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540955)