default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKimmo Koskenniemi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c20]Kimmo Koskenniemi:
Aligning phonemes using finte-state methods. NODALIDA 2017: 56-64- 2013
- [j3]Kimmo Koskenniemi:
An informal discovery procedure for two-level rules. J. Lang. Model. 1(1): 155-188 (2013) - 2010
- [c19]Peter Wittenburg, Núria Bel, Lars Borin, Gerhard Budin, Nicoletta Calzolari, Eva Hajicová, Kimmo Koskenniemi, Lothar Lemnitzer, Bente Maegaard, Maciej Piasecki, Jean-Marie Pierrel, Stelios Piperidis, Inguna Skadina, Dan Tufis, Remco van Veenendaal, Tamás Váradi, Martin Wynne:
Resource and Service Centres as the Backbone for a Sustainable Service Infrastructure. LREC 2010 - [c18]Kimmo Koskenniemi, Miikka Silfverberg:
A Method for Compiling Two-Level Rules with Multiple Contexts. SIGMORPHON 2010: 38-45
2000 – 2009
- 2008
- [c17]Jyrki Niemi, Kimmo Koskenniemi:
Quantification and Implication in Semantic Calendar Expressions Represented with Finite-State Transducers. COLING (Posters) 2008: 71-74 - [c16]Kimmo Koskenniemi, Anssi Yli-Jyrä:
CLARIN and Free Open Source Finite-State Tools. FSMNLP 2008: 3-13 - [c15]Jyrki Niemi, Kimmo Koskenniemi:
Representing and Combining Calendar Information by Using Finite-State Transducers. FSMNLP 2008: 122-133 - [c14]Tamás Váradi, Steven Krauwer, Peter Wittenburg, Martin Wynne, Kimmo Koskenniemi:
CLARIN: Common Language Resources and Technology Infrastructure. LREC 2008 - 2007
- [c13]Jyrki Niemi, Kimmo Koskenniemi:
Representing Calendar Expressions with Finite-State Transducers that Bracket Periods of Time on a Hierachical Timeline. NODALIDA 2007: 355-362 - [c12]Anssi Yli-Jyrä
, Kimmo Koskenniemi:
A New Method for Compiling Parallel Replacement Rules. CIAA 2007: 320-321 - 2006
- [c11]Anssi Yli-Jyrä, Kimmo Koskenniemi:
Compiling Generalized Two-Level Rules and Grammars. FinTAL 2006: 174-185 - [c10]Jyrki Niemi, Lauri Carlson, Kimmo Koskenniemi:
Two String-Based Finite-State Models of the Semantics of Calendar Expressions. FinTAL 2006: 748-755 - 2003
- [j2]Lauri Karttunen, Kimmo Koskenniemi, Gertjan van Noord:
Finite state methods in natural language processing. Nat. Lang. Eng. 9(1): 1-3 (2003) - 2002
- [c9]Kimmo Koskenniemi:
Is natural language an inconvenience or an opportunity for IR?. SIGIR 2002: 315
1990 – 1999
- 1996
- [j1]Kimmo Koskenniemi:
Finite state morphology and information retrieval. Nat. Lang. Eng. 2(4): 331-336 (1996) - 1992
- [c8]Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilainen:
Compiling and Using Finite-State Syntactic Rules. COLING 1992: 156-162 - 1990
- [c7]Kimmo Koskenniemi:
Finite-State Parsing And Disambiguation. COLING 1990: 229-232
1980 – 1989
- 1988
- [c6]Laura Kataja, Kimmo Koskenniemi:
Finite-state description of Semitic morphology: a case study of ancient Accadian. COLING 1988: 313-315 - [c5]Kimmo Koskenniemi, Kenneth Ward Church:
Complexity, two-level morphology and Finnish. COLING 1988: 335-340 - 1985
- [c4]Kimmo Koskenniemi:
Compilation of automata from morphological two-level rules. NODALIDA 1985: 143-149 - 1984
- [c3]Kimmo Koskenniemi:
A General Computational Model For Word-Form Recognition And Production. COLING 1984: 178-181 - 1983
- [c2]Kimmo Koskenniemi:
Two-Level Model for Morphological Analysis. IJCAI 1983: 683-685 - [c1]Kimmo Koskenniemi:
A General Computational Model for Word-Form Recognition and Production. NODALIDA 1983: 145-154
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
