Filters








212,522 Hits in 5.3 sec

Extended Tree Transducers in Natural Language Processing

Andreas Maletti
2015 Finite-State Methods and Natural Language Processing  
natural languages.  ...  Indeed, STSG have a natural finite-state correspondence with the linear and complete bimorphisms (Arnold and Dauchet, 1982) , which did not receive much interest from the theoretical computer science  ... 
dblp:conf/fsmnlp/Maletti15 fatcat:dodh535cgzg5vmh2hfi42sa6wu

Finite-state methods and models in natural language processing

ANSSI YLI-JYRÄ, ANDRÁS KORNAI, JACQUES SAKAROVITCH
2011 Natural Language Engineering  
The guest editors would like to express their thanks to the authors, to the editor, Ruslan Mitkov, and the regular editorial board and staff of the journal for their help during the whole process.  ...  Acknowledgments The position of the guest editors for this special issue was held jointly by András Kornai, Jacques Sakarovitch, and Anssi Yli-Jyrä.  ...  The current issue on finite-state methods and models in natural language processing was planned in 2008 in this context as a response to a call for special issue proposals.  ... 
doi:10.1017/s1351324911000015 fatcat:a45ce6spsjdlbn2k7ojjiehcoi

Finite State Morphology Tool for Latvian

Daiga Deksne
2013 Finite-State Methods and Natural Language Processing  
As Finite state transducer (FST) technology is used for the morphology tool, it is easy to extend the lexicon, the tool can be reused on different platforms and it has good performance indicators.  ...  Its main weaknesses are: low processing speed when processing a large text corpus, complexity of adding new entries to the lexical data base, and limitations for usage on different operational platforms  ...  L-KC-11-0003 signed between ICT Competence Centre and Investment and Development Agency of Latvia, Research No. 2.8 "Research of automatic methods for text structural analysis".  ... 
dblp:conf/fsmnlp/Deksne13 fatcat:q6xlj7cvyjcwvcgfhf7n2ggnsa

Kleene, a Free and Open-Source Language for Finite-State Programming

Kenneth R. Beesley
2012 Finite-State Methods and Natural Language Processing  
Kleene is a high-level programming language, based on the OpenFst library, for constructing and manipulating finite-state acceptors and transducers.  ...  The design, implementation, development status and future plans for the language are discussed.  ...  Finally, I thank Lauri Karttunen, who introduced me to finite-state linguistics and has always been a good friend and mentor.  ... 
dblp:conf/fsmnlp/Beesley12 fatcat:7iawinmvk5bdrgk6ngdrzalugq

On Finite-State Tonology with Autosegmental Representations

Anssi Yli-Jyrä
2013 Finite-State Methods and Natural Language Processing  
Building finite-state transducers from written autosegmental grammars of tonal languages involves compiling the rules into a notation provided by the finitestate tools.  ...  The paper also presents a usual finite-state transducer for transforming a concatenated string of lexemes where each lexeme (such as "babaa|HH") consists of a segmental substring and a tonal substring  ...  Kay's (1987) early proposal about processing multilinear structures with an extended finite-state transducer model has inspired further research on multi-tape automata (Wiebe, 1992) and linear codes  ... 
dblp:conf/fsmnlp/Yli-Jyra13 fatcat:wnuasmdrknd35eurryxp5u6lfi

Multi-threaded composition of finite-state-automata

Bryan Jurish, Kay-Michael Würzner
2013 Finite-State Methods and Natural Language Processing  
We provide an approximate upper bound for composition speedup of the parallel variant with respect to serial execution, and empirically evaluate the performance of our implementation with respect to this  ...  Acknowledgements Research was supported by the Deutsche Forschungsgemeinschaft grants KL 337/12-2 and KL 955/19-1.  ...  Complex systems based on (weighted) finite-state automata have been successfully used in language processing , image compression (Culik II and Kari, 1993) , computational biology (Krogh et al., 1994)  ... 
dblp:conf/fsmnlp/JurishW13 fatcat:mnw3kfqkwbbqveynumqrernzoi

Harmonic Serialism and Finite-State Optimality Theory

Yiding Hao
2017 Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2017)  
This paper presents a new finite-state model of Optimality Theory (OT). In this model, two assumptions are imposed on the OT framework.  ...  Acknowledgments I would like to thank Ryan Bennett, Robert Frank, and the reviewers for their valuable feedback and discussion. Any remaining errors are my own.  ...  Under a paradigm introduced by and Bouajjani et al. (2000) , the set of possible states of a system are represented as a regular language, and the possible transitions between states are modelled as  ... 
doi:10.18653/v1/w17-4003 dblp:conf/fsmnlp/Hao17 fatcat:jm5zaikpofcfvkzxbaelofjh3q

Finite State Transducer Calculus for Whole Word Morphology

Maciej Janicki
2019 Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing  
The formalism covers a wide variety of morphological phenomena (including non-concatenative ones like stem vowel alternation) without the need of workarounds and extensions.  ...  In this paper, we propose a formalism describing structural relationships between words based on theories of morphology that reject the notions of internal word structure and morpheme.  ...  to handle those phenomena in a natural and general fashion.  ... 
doi:10.18653/v1/w19-3107 dblp:conf/fsmnlp/Janicki19 fatcat:gesrib5ovreohaof4eyxsqdlf4

Three Equivalent Codes for Autosegmental Representations

Anssi Yli-Jyrä
2015 Finite-State Methods and Natural Language Processing  
The codes are infinite, finite-state representable and optimal (efficiently computable, invertible, locally iconic, compositional) in the sense of Kornai (1995) .  ...  A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite-state transducer toolkits (Yli-Jyr  ...  I would like to express special thanks to Arvi Hurskainen, Andy Black, Lotta Aunio, Francis Nolan, Miikka Silfverberg, and Steven Bird for inspiring discussions and the reviewers for many useful comments  ... 
dblp:conf/fsmnlp/Yli-Jyra15 fatcat:rqffiamu25bdno6bamm4dg2jse

Finite-State Morphological Analysis for Marathi

Vinit Ravishankar, Francis M. Tyers
2017 Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2017)  
We use the lttoolbox lexicon formalism for describing the finite-state transducer, and attempt to work within a morphological framework that would allow for some consistency across Indo-Aryan languages  ...  An evaluation of our finite-state transducer shows that the coverage is adequate, over 80% on two corpora, and the precision is good (over 97%). 1.  ...  Acknowledgements We would like to thank the anonymous reviewers for their insight and helpful comments. We would also like to thank Memduh Gökırmak for inspiring discussion.  ... 
doi:10.18653/v1/w17-4006 dblp:conf/fsmnlp/RavishankarT17 fatcat:tyi3tvi45vgnnlt2lcz7xyunxm

Latin script keyboards for South Asian languages with finite-state normalization

Lawrence Wolf-Sonkin, Vlad Schogol, Brian Roark, Michael Riley
2019 Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing  
We explore several compact finite-state architectures that permit variable spellings of words during mobile text entry.  ...  The use of the Latin script for text entry of South Asian languages is common, even though there is no standard orthography for these languages in the script.  ...  In Proceedings of the 14th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2019). Virga and Sanjeev Khudanpur. 2003.  ... 
doi:10.18653/v1/w19-3114 dblp:conf/fsmnlp/Wolf-SonkinSR019 fatcat:2ft5cuk55vhftc4jxpwbfm4stq

E-Dictionaries and Finite-State Automata for the Recognition of Named Entities

Cvetana Krstev, Dusko Vitas, Ivan Obradovic, Milos Utvic
2011 Finite-State Methods and Natural Language Processing  
In this paper we present a system for named entity recognition and tagging in Serbian that relies on large-scale lexical resources and finite-state transducers.  ...  Our system recognizes several types of name, temporal and numerical expressions. Finite-state automata are used to describe the context of named entities, thus improving the precision of recognition.  ...  Gucul Milojević, Vanja Radulović and Jelena Jaćimović.  ... 
dblp:conf/fsmnlp/KrstevVOU11 fatcat:tgbs3cd6lreqhewpdp7i2kv5d4

Weighted parsing for grammar-based language models

Richard Mörbitz, Heiko Vogler
2019 Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing  
We show an algorithm which terminates and is correct for a large class of weighted grammar-based language models.  ...  We develop a general framework for weighted parsing which is built on top of grammarbased language models and employs flexible weight algebras.  ...  Acknowledgements We thank the anonymous reviewers for their helpful comments and our colleagues Kilian Gebhardt and Frederic Dörband for fruitful discussions.  ... 
doi:10.18653/v1/w19-3108 dblp:conf/fsmnlp/MorbitzV19 fatcat:6sbxnjyjzbbuljnw6fnfvcx364

Automated Lossless Hyper-Minimization for Morphological Analyzers

Senka Drobac, Miikka Silfverberg, Krister Lindén
2015 Finite-State Methods and Natural Language Processing  
The method utilizes flag diacritics to preserve the structure of the original lexc description in the finite-state analyzer, which results in reduced size of the analyzer.  ...  We compare our method against an earlier solution by Drobac et al. ( 2014 ) which requires manual selection of flag diacritics and results in slow lookup.  ...  Acknowledgements We want to thank the anonymous reviewers for their useful comments and suggestions.  ... 
dblp:conf/fsmnlp/DrobacSL15 fatcat:ycmgs52iy5awnldy7hgghk3gwu

Evaluation of Finite State Morphological Analyzers Based on Paradigm Extraction from Wiktionary

Ling Liu, Mans Hulden
2017 Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP 2017)  
An additional point that we make is that word transduction can also be used to borrow words from another similar language and adapt them to the phonology of the target language. 1  ...  We propose a method for 'word transduction' for addressing this problem.  ...  We showed that a weighted rewrite rulebased method on phoneme chunks significantly outperforms a method based on factored phrasebased machine translation for this purpose for such language pairs.  ... 
doi:10.18653/v1/w17-4009 dblp:conf/fsmnlp/SharmaS17 fatcat:tykwl4gmhbdvtix5tu65ogpzcy
« Previous Showing results 1 — 15 out of 212,522 results