Explorations on Positionwise Flag Diacritics in Finite-State Morphology
Permalink
Citation
Yli-Jyrä , A M 2011 , Explorations on Positionwise Flag Diacritics in Finite-State Morphology . in B Sandford Pedersen , G Nešpore & I Skadiņa (eds) , Proceedings of the 18th Nordic Conference of Computational Linguistics NODALIDA 2011 . NEALT Proceedings Series , vol. 11 (2011) , Northern European Association for Language Technology , Tartu, Estonia , pp. 262-269 , The Nordic Conference of Computational Linguistics , Riga , Latvia , 11/05/2011 . < http://dspace.utlib.ee/dspace/handle/10062/17339 >
| Title: | Explorations on Positionwise Flag Diacritics in Finite-State Morphology |
| Author: | Yli-Jyrä, Anssi Mikael |
| Editor: | Sandford Pedersen, Bolette; Nešpore, Gunta; Skadiņa, Inguna |
| Contributor: | University of Helsinki, Department of Modern Languages 2010-2017 |
| Publisher: | Northern European Association for Language Technology |
| Date: | 2011-05-10 |
| Language: | eng |
| Number of pages: | 8 |
| Belongs to series: | Proceedings of the 18th Nordic Conference of Computational Linguistics NODALIDA 2011 |
| Belongs to series: | NEALT Proceedings Series |
| URI: | http://hdl.handle.net/10138/29897 |
| Abstract: | (översättning:) I dokumentet föreslås morphofonematisk markörer kallas positionwise flaggor. Dessa flaggor är inspirerade av de tekniker som används i sammanställningen av två nivåer regler. Det sammanställer praktiskt taget alla regler parallellt, men på ett effektivt sätt. Tekniken hanterar morphofonematisk processer utan separat morphofonematisk representation. De förekomster av allomorphofonem i latenta fonologiska strängar spåras genom en dynamisk datastruktur där den mest framträdande (dvs. bäst rankade) flaggor samlas in. Tillämpningen av tekniken är misstänkt för att ge fördelar när de beskriver morfologi Bantu språk och dialekter |
| Subject: |
6121 Languages
morfologia äärellistilaiset menetelmät äärelliset automaatit äärellistilainen morfologinen analyysi äärellistilaiset transduktorit foneemin esitysmuodot fonologinen prosessointi kieliopit kaksitasoinen morfologia kaksitasosäännöt leksikot morphology finite-state methods finite automata finite-state morphological analysis finite-state transducers PHONEME REPRESENTATIONS phonemes morpho-phonemes phonological processing grammars two-level morphology two-level rules lexicon morfologi finite-state metoder ändliga automater finite-state morfologisk analysis ändliga transduktor fonem represention fonem morphologiska fonem fonologisk bearbetning grammatiker två-nivå morfologi två-nivå regler lexikon 113 Computer and information sciences äärelliset automaatit äärelliset transduktorit äärellistilaiset transduktorit kääntäjät representaatio kontekstuaalisuus merkkijonoalgoritmit hahmontunnistus finite-automata finite-state transducers compilers representation contextual effects string algorithms pattern processing ändliga automater ändliga transduktor kompilatorer representation kontextuella effekter sträng algoritmer mönster bearbetning |
| Rights: |
Files in this item
Total number of downloads: Loading...
| Files | Size | Format | View |
|---|---|---|---|
| 0Yli_Jyra_70.pdf | 215.9Kb |
View/ |
This item appears in the following Collection(s)
-
Articles from TUHAT CRIS [38637]
Related items
Showing items related by title, author, creator and subject.
-
Toward a widely usable finite-state morphology workbench for less studied languages, 1: Desiderata (2005)Most of the world’s languages lack electronic word form dictionaries. The linguists who gather such dictionaries could be helped with an efficient morphology workbench that adapts to different environments and uses. A widely usable workbench could be characterized, ideally, as generally applicable, extensible, and freely available (GEA). It seems that such a solution could be implemented in the framework of finite-state methods. The current work defines the GEA desiderata and starts a series of articles concerning these desiderata in finite- state morphology. Subsequent parts will review the state of the art and present an action plan toward creating a widely usable finite-state morphology workbench.
-
(The Association for Computational Linguistics, 1992)A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in this forrealism. As a substantial example, fragments from a nontrivial finite-state grammar of English are discussed. The linguistic framework of the present approach is based on a surface syntactic tagging scheme by F. Karlsson. This representation is slightly less powerful than phrase structure tree notation, letUng some ambiguous constructions be described more concisely. The finite-state rule compiler implements what was briefly sketched by Koskenniemi (1990). It is based on the calculus of finite-state machines. The compiler transforms rules into rule-automata. The run-time parser exploits one of certain alternative strategies in performing the effective intersection of the rule automata and the sentence automaton. Fragments of a fairly comprehensive finite-state granmmr of English are presented here, including samples from non-finite constructions as a demonstration of the capacity of the present formalism, which goes far beyond plain disamblguation or part of speech tagging. The grammar itself is directly related to a parser and tagging system for English created as a part of project SIMPR I using Karlsson's CG (Constraint Grammar) formalism.
-
(The Association for Computational Linguistics, 2018)A practical method for interactive guessing of LEXC lexicon entries is presented. The method is based on describing groups of similarly inflected words using regular expressions. The patterns are compiled into a finite-state transducer (FST) which maps any word form into the possible LEXC lexicon entries which could generate it. The same FST can be used (1) for converting conventional headword lists into LEXC entries, (2) for interactive guessing of entries, (3) for corpus-assisted interactive guessing and (4) guessing entries from corpora. A method of representing affixes as a table is presented as well how the tables can be converted into LEXC format for several different purposes including morphological analysis and entry guessing. The method has been implemented using the HFST finite-state transducer tools and its Python embedding plus a number of small Python scripts for conversions. The method is tested with a near complete implementation of Finnish verbs. An experiment of generating Finnish verb entries out of corpus data is also described as well as a creation of a full-scale analyzer for Finnish verbs using the conversion patterns.
