![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
The Prague Bulletin of Mathematical Linguistics, Volume 83
Volume 83, 2005
- Ondrej Bojar, Jirí Semecký, Václava Benesová:
VALEVAL: Testing Vallex Consistency and Experimenting with Word-Frame Disambiguation. Prague Bull. Math. Linguistics 83: 5-18 (2005) - Jirí Semecký:
Automatic Assignment of Frame Semantics Using Syntax-Semantics Interface in LFG. Prague Bull. Math. Linguistics 83: 19-46 (2005) - Nadine Rayon:
Analyse morpho-graphémique pour la catégorisation automatique des séquences de kanji dans des textes japonais. Prague Bull. Math. Linguistics 83: 47-58 (2005) - Radim Sova:
Genesis of Two Algebraic Theories of Language. Prague Bull. Math. Linguistics 83: 59-76 (2005)
- Eva Hajicová:
Review: Syntactic and Focus-structural Aspects of Triadic Constructions, by Edward Göbbel. Prague Bull. Math. Linguistics 83: 77-80 (2005) - Jun Qian:
Review: My War: Memoir of a Young Jewish Poet, by Edward Stankiewicz. Prague Bull. Math. Linguistics 83: 81-82 (2005) - Martin Holub:
: Review: Natural Language Processing for Online Applications: Text Retrieval, Extraction and Categorization, by Peter Jackson and Isabelle Moulinier. Prague Bull. Math. Linguistics 83: 83-84 (2005) - Pavel Stranák:
Review: Toward a Cognitive Semantics, Volume I, Concept Structuring Systems, by Leonard Talmy. Prague Bull. Math. Linguistics 83: 85-86 (2005)
![](https://dblp1.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.