![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
15th NODALIDA 2005: Joensuu, Finland
- Stefan Werner:
Proceedings of the 15th Nordic Conference of Computational Linguistics, NODALIDA 2005, Joensuu, Finland, May 2005. University of Joensuu, Finland 2006, ISBN 978-952-458-771-6 - Marita Ailomaa, Vladimír Kadlec, Martin Rajman, Jean-Cédric Chappelier:
Robust stochastic parsing: Comparing and combining two approaches for processing extra-grammatical sentences. 1-7 - Ergin Altintas, M. Elif Karsligil, Vedat Coskun:
A new semantic similarity measure evaluated in word sense disambiguation. 8-11 - Lili Aunimo, Reeta Kuuskoski:
Reformulations of Finnish questions for question answering. 12-21 - Chris Biemann, Uwe Quasthoff:
Dictionary acquisition using parallel text and co-occurrence statistics. 22-29 - Heidi Brøseth:
The influence of written task descriptions in Wizard of Oz experiments. 30-37 - Hercules Dalianis:
Improving search engine retrieval using a compound splitter for Swedish. 38-42 - Kristin Hagen, Lars Nygaard:
Improbable morphological forms in a computational lexicon. 43-46 - Johan Hall, Joakim Nivre:
A generic architecture for data-driven dependency parsing. 47-56 - Lars Hellan, Dorothee Beermann:
The 'Specifier' in an HPSG grammar implementation of Norwegian. 57-64 - Hans Hjelm, Christoph Schwarz:
LiSa-morphological analysis for information retrieval. 65-70 - Jon Holmlund, Magnus Sahlgren, Jussi Karlgren:
Creating bilingual lexica using reference wordlists for alignment of monolingual semantic vector spaces. 71-77 - Johan Hovold:
Naive Bayes spam filtering using word-position-based attributes and length-sensitive classification thresholds. 78-87 - Christer Johansson, Lars G. Johnsen:
An analytical relation between analogical modeling and memory based learning. 88-93 - Tuomo Kakkonen:
Dependency treebanks: methods, annotation schemes and tools. 94-104 - Viggo Kann, Magnus Rosell:
Free construction of a free Swedish dictionary of synonyms. 105-110 - Jussi Karlgren:
Compound terms and their constituent elements in information retrieval. 111-115 - Bodil Kyst, Peter Juel Henrichsen:
Synthetic regional Danish. 116-123 - Hanne Moa:
Compounds and other oddities in machine translation. 124-132 - Jyrki Niemi, Lauri Carlson:
Towards modeling the semantics of calendar expressions as extended regular expressions. 133-138 - Kristina Nilsson, Hans Hjelm, Henrik Oxhammar:
SUiS-cross-language ontology-driven information retrieval in a restricted domain. 139-145 - Kristina Nilsson, Aisha Malmgren:
Towards automatic recognition of product names: an exploratory study of brand names in economic texts. 146-155 - Anders Nøklestad, Christer Johansson:
Detecting reference chains in Norwegian. 156-162 - Henrik Oxhammar:
Mapping product descriptions to a large ontology. 163-172 - Magnus Rosell, Sumithra Velupillai:
The impact of phrases in document clustering for Swedish. 173-179 - Jonas Sjöbergh:
Chunking: an unsupervised method to find errors in text. 180-185 - Peter Rossen Skadhauge, Peter Juel Henrichsen:
DanPO-a transcription-based dictionary for Danish speech technology. 186-192 - Anders Søgaard, Petter Haugereid:
Functionality in grammar design. 193-202 - Heli Uibo:
Optimizing the finite-state description of Estonian morphology. 203-209 - Hans Friedrich Witschel, Chris Biemann:
Rigorous dimensionality reduction through linguistically motivated feature selection for text categorization. 210-217
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.