Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Kimmo Koskenniemi"'
Autor:
Kimmo Koskenniemi
Publikováno v:
Journal of Language Modelling, Vol 1, Iss 1 (2013)
The paper shows how a certain kind of underlying representations (or deep forms) of words can be constructed in a straightforward manner through aligning the surface forms of the morphs of the word forms. The inventory of morphophonemes follows direc
Externí odkaz:
https://doaj.org/article/20d55c30c00e4352a02f22cbf2e2157e
Autor:
Auli Hakulinen, Kimmo Koskenniemi
Publikováno v:
Virittäjä. 126
Autor:
Kimmo Koskenniemi
Publikováno v:
University of Helsinki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::06b47c302e164a4cf88fa15ebe9c72b8
http://hdl.handle.net/10138/305329
http://hdl.handle.net/10138/305329
Autor:
Kimmo Koskenniemi
Publikováno v:
Natural Language Engineering. 2:331-336
A source of potential systematic errors in information retrieval is identified and discussed. These errors occur when base form reduction is applied with a (necessarily) finite dictionary. Formal methods for avoiding this error source are presented,
Publikováno v:
Natural Language Engineering. 9:1-3
Finite state methods have been in common use in various areas of natural language processing (NLP) for many years. A series of specialized workshops in this area illustrates this. In 1996, András Kornai organized a very successful workshop entitled
Autor:
Anssi Yli-Jyrä, Kimmo Koskenniemi
Publikováno v:
Implementation and Application of Automata ISBN: 9783540763352
CIAA
CIAA
Kempe and Karttunen [1] have presented a method that compiles a set of parallel conditional replacement (rewriting) rules into a finite-state transducer. Other, simpler methods exist for single rules or for rules of a restricted type, but they can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a44a0b5be34842d0c8f0a28efa5c208
https://doi.org/10.1007/978-3-540-76336-9_34
https://doi.org/10.1007/978-3-540-76336-9_34
Autor:
Kimmo Koskenniemi, Anssi Yli-Jyrä
Publikováno v:
Advances in Natural Language Processing ISBN: 9783540373346
FinTAL
FinTAL
New methods to compile morphophonological two-level rules into finite-state machines are presented. Compilation of the original and new two-level rules and grammars is formulated using an operation called the generalized restriction that constructs a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58dc611db573126e9fbba821d66d2da9
https://doi.org/10.1007/11816508_19
https://doi.org/10.1007/11816508_19
Publikováno v:
Advances in Natural Language Processing ISBN: 9783540373346
FinTAL
University of Helsinki
FinTAL
University of Helsinki
This paper presents two string-based finite-state approaches to modelling the semantics of natural-language calendar expressions: extended regular expressions (XREs) over a timeline string of unique symbols, and a string of hierarchical periods of ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfa01f7cbb63dc2e8304237c4910efe3
https://doi.org/10.1007/11816508_74
https://doi.org/10.1007/11816508_74
Autor:
Kimmo Koskenniemi
Publikováno v:
SIGIR
Natural language (NL) has evolved to facilitate human communication. It enables the speaker to make the listener's mind wander among her experiences and mental associations roughly according to the intentions of the speaker. The speaker and the liste
Publikováno v:
COLING
Proceeding volume: 1 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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05b8dfdf9515c65f998c4737deaa3499
http://hdl.handle.net/10138/33899
http://hdl.handle.net/10138/33899