Amanote Research

Amanote Research

    RegisterSign In

Nonconcatenative Finite-State Morphology

doi 10.3115/976858.976860
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1987

Authors
Martin Kay
Publisher

Association for Computational Linguistics


Related search

Finite-State Registered Automata for Non-Concatenative Morphology

Computational Linguistics
LinguisticsComputer Science ApplicationsArtificial IntelligenceLanguage
2006English

A Finite State Approach to German Verb Morphology

1988English

Compounding and Derivational Morphology in a Finite-State Setting

2003English

Finite State Machines

2017English

Finite-State Markov Chains

English

Reasoning About Finite-State Switched Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Finite State Testing and Syntax Testing

INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
2012English

Probabilistic Finite-State Machines - Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
2005English

Finite-State Automata on Infinite Inputs

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy