Filters








186 Hits in 4.4 sec

Finite-State Registered Automata for Non-Concatenative Morphology

Yael Cohen-Sygal, Shuly Wintner
2006 Computational Linguistics  
We introduce finite-state registered automata (FSRAs), a new computational device within the framework of finite-state technology, specifically tailored for implementing non-concatenative morphological  ...  This model extends and augments existing finite-state techniques, which are presently not optimized for describing this kind of phenomena.  ...  Acknowledgments We are grateful to Dale Gerdemann for his help and inspiration. We thank Victor Harnik and Nissim Francez for their comments on an earlier version of this paper.  ... 
doi:10.1162/089120106776173084 fatcat:2q2s4njoivdprasnbdphyf3osm

Finite-State Registered Automata for Non-Concatenative Morphology

Yael Cohen-Sygal, Shuly Wintner
2006 Computational Linguistics  
We introduce finite-state registered automata (FSRAs), a new computational device within the framework of finite-state technology, specifically tailored for implementing non-concatenative morphological  ...  This model extends and augments existing finite-state techniques, which are presently not optimized for describing this kind of phenomena.  ...  Acknowledgments We are grateful to Dale Gerdemann for his help and inspiration. We thank Victor Harnik and Nissim Francez for their comments on an earlier version of this paper.  ... 
doi:10.1162/coli.2006.32.1.49 fatcat:rhx75ur6fbawjhlre3j563tdqy

Page 29 of Computational Linguistics Vol. 32, Issue 1 [page]

2006 Computational Linguistics  
Finite-State Registered Automata for Non-Concatenative Morphology Yael Cohen-Sygal Shuly Wintner University of Haifa University of Haifa ite registered automata (FSRAs), a new computational device within  ...  the Lunal soc J] a7] Te | y tn01nle ” y 1 1 17 T10 technology, specifically tailored for implementing non-concatenative py J J t > 7 17 , , > > [his model extends and augments existing finite-state techniques  ... 

Finite-State Registered Automata and Their Uses in Natural Languages [chapter]

Yael Cohen-Sygal, Shuly Wintner
2006 Lecture Notes in Computer Science  
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages.  ...  In addition, we extend FSRA to finite-state registered transducers and demonstrate their space efficiency.  ...  We are grateful to Dale Gerdemann for his help.  ... 
doi:10.1007/11780885_6 fatcat:ptlfm2fmafethaehnn2y5qo4f4

Morphological Processing of Semitic Languages [chapter]

Shuly Wintner
2014 Natural Language Processing of Semitic Languages  
The bulk of the chapter, then, discusses available solutions for morphological processing, including analysis, generation, and disambiguation, in a variety of Semitic languages.  ...  This chapter addresses morphological processing of Semitic languages.  ...  Acknowledgements I am tremendously grateful to Nizar Habash for his help and advice; it would have been hard to complete this chapter without them.  ... 
doi:10.1007/978-3-642-45358-8_2 dblp:series/tanlp/Wintner14 fatcat:2haciwvubrbvlawaw6y26pkjlq

Finite-State Technology as a Programming Environment [chapter]

Shuly Wintner
2007 Lecture Notes in Computer Science  
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages.  ...  environment for language processing.  ...  I am very grateful to Shlomo Yona for implementing the XFST grammar and to Dalia Bojan for implementing the Java system. Kemal Oflazer provided useful comments on an earlier version of this paper.  ... 
doi:10.1007/978-3-540-70939-8_9 fatcat:t4c2sowgoffkdljiqfjgeqjlqq

Feature-based allomorphy

Hans-Ulrich Krieger, Hannes Pirker, John Nerbonne
1993 Proceedings of the 31st annual meeting on Association for Computational Linguistics -  
To describe both uniformly, we define finite automata (FA) for allomorphy in the same feature description language used for morphotactics.  ...  The latter is particularly useful when concatenative and non-concatenative allomorphy coexists in a single language, as it does, e.g., in German. 2 Finite Automata as Typed Feature Structures An FA A  ...  but also (ii) coneatenative and non-concatenative allomorphy.  ... 
doi:10.3115/981574.981593 dblp:conf/acl/KriegerPN93 fatcat:g62kmfrdtnfdfbzzscdbxw2gc4

Strengths and weaknesses of finite-state technology: a case study in morphological grammar development

SHULY WINTNER
2007 Natural Language Engineering  
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages.  ...  However, when widecoverage morphological grammars are considered, finite-state technology does not scale up well, and the benefits of this technology can be overshadowed by the limitations it imposes as  ...  I am very grateful to Shlomo Yona for implementing the XFST grammar and to Dalia Bojan for implementing the Java system.  ... 
doi:10.1017/s1351324907004676 fatcat:4pncqfaw5ncabfcib6bkzvutva

Morphological detection of malware

Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2008 2008 3rd International Conference on Malicious and Unwanted Software (MALWARE)  
Our construction employs tree automata techniques to provide an efficient representation of the CFG database.  ...  This study proposes an efficient construction of a morphological malware detector based on a syntactic and a semantic analysis, technically on control flow graphs of programs (CFG).  ...  For that sake, we use tree automata, a generalization to trees of finite state automata over strings [10] .  ... 
doi:10.1109/malware.2008.4690851 dblp:conf/malware/BonfanteKM08 fatcat:su2zd26z3fbzpgbvivbvzyi6qe

One-Level Prosodic Morphology [article]

Markus Walther
1999 arXiv   pre-print
The non-finite-state copying aspect of reduplication is mapped to automata intersection, itself a non-finite-state operation.  ...  In this paper I argue for certain extensions to the one-level model of phonology and morphology (Bird & Ellison 1994) to cover the computational aspects of prosodic morphology using finite-state methods  ...  In particular, the use of weakly non-finite-state enhancements like global registers that can be set (for initializing an agreeing feature) and tested against (an existing feature value) should be a profitable  ... 
arXiv:cs/9911011v1 fatcat:yhzkiz5vgne6hhqiztfhx7m3d4

Computing and classifying reduplication with 2-way finite-state transducers

Hossep Dolatian, Jeffrey Heinz
2020 Journal of Language Modelling  
Keywords: reduplication, 2-way finite state transducer, finite state morphology This article describes a novel approach to the computational modeling of reduplication.  ...  Reduplication is often treated as a stumbling block within finite-state treatments of morphology because they cannot adequately capture the productivity of unbounded copying (total reduplication) and because  ...  To give more context, most morphological processes can be computed by 1-way finite state automata and transducers (Koskenniemi 1983; Beesley and Karttunen 2003) .  ... 
doi:10.15398/jlm.v8i1.245 fatcat:wqga5pk7kzco7j6zu76hkimibm

Approximating context-free grammars with a finite-state calculus

Edmund Grimley Evans
1997 Proceedings of the 35th annual meeting on Association for Computational Linguistics -  
A method is presented here for calculating such finite-state approximations from context-free grammars.  ...  finite-state models are often preferred.  ...  context-free grammars can then be applied to these formalisms too. 2 Finite-state calculus A 'finite-state calculus' or 'finite automata toolkit' is a set of programs for manipulating finite-state automata  ... 
doi:10.3115/976909.979675 dblp:conf/acl/Evans97 fatcat:xaowtpyxkbeixhao3o526gpfs4

Video Retrieval of Human Interactions Using Model-Based Motion Tracking and Multi-layer Finite State Automata [chapter]

Sangho Park, Jihun Park, Jake K. Aggarwal
2003 Lecture Notes in Computer Science  
This paper presents a model-based approach to motion tracking and recognition of human interactions using multi-layer finite state automata (FA).  ...  The recognition model represents human behavior as a sequence of states that register the configuration of individual body parts in space and time.  ...  Our finite state automata consists of a finite set of states(Q), an initial state(q 0 ), a finite set of events( ), a state transition function(δ), and a finite set of final states(F ).  ... 
doi:10.1007/3-540-45113-7_39 fatcat:crslnfawgvgnxhn5vifzl6yqgi

A finite-state morphological grammar of Hebrew

S. YONA, S. WINTNER
2007 Natural Language Engineering  
We describe HAMSAH (HAifa Morphological System for Analyzing Hebrew), a morphological processor for Modern Hebrew, based on finite-state linguistically motivated rules and a broad coverage lexicon.  ...  Reliance on finite-state technology facilitates the construction of a highly efficient, completely bidirectional system for analysis and generation.  ...  We are grateful to Yael Cohen-Sygal, Shira Schwartz and Alon Itai for their help.  ... 
doi:10.1017/s1351324906004384 fatcat:halvih72mfec3ozxwjtlxerog4

Approximating Context-Free Grammars with a Finite-State Calculus [article]

Edmund Grimley-Evans
1997 arXiv   pre-print
A method is presented here for calculating such finite-state approximations from context-free grammars.  ...  finite-state models are often preferred.  ...  Finite-state calculus A 'finite-state calculus' or 'finite automata toolkit' is a set of programs for manipulating finite-state automata and the regular languages and transducers that they describe.  ... 
arXiv:cmp-lg/9711002v1 fatcat:kfexzqm63bdzlc6zlboizyshvy
« Previous Showing results 1 — 15 out of 186 results