DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 26

1
Трансформации при переводе научной аннотации на английский язык ; Using Transformations for Translating Scientific Abstracts into English
Чернышев, А. В.. - : ООО «Издательство УМЦ УПИ», 2019
BASE
Show details
2
Mahonian STAT on words
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01418254 ; Information Processing Letters, Elsevier, 2016, 116 (2), pp.157 - 162. ⟨10.1016/j.ipl.2015.09.006⟩ ; http://www.sciencedirect.com/science/article/pii/S0020019015001611 (2016)
BASE
Show details
3
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://hal.archives-ouvertes.fr/hal-00913309 ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013, Kiel, Germany. pp.598--609, ⟨10.4230/LIPIcs.STACS.2013.598⟩ (2013)
BASE
Show details
4
On the combinatorics of suffix arrays
In: ISSN: 0020-0190 ; Information Processing Letters ; https://hal.archives-ouvertes.fr/hal-00864634 ; Information Processing Letters, Elsevier, 2013, 113 (22-24), pp.915-920. ⟨10.1016/j.ipl.2013.09.009⟩ (2013)
BASE
Show details
5
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
Nguyen Thi, Thu Hien. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013
BASE
Show details
6
Compressed Representations of Permutations, and Applications
Barbay, Jeremy; Navarro, Gonzalo. - : LIPIcs - Leibniz International Proceedings in Informatics. 26th International Symposium on Theoretical Aspects of Computer Science, 2009
BASE
Show details
7
Idioms in example-based machine translation
BASE
Show details
8
ADAPTIVE REORDERING OF OBSERVATION SPACE TO IMPROVE PATTERN RECOGNITION
In: http://www.task.gda.pl/files/quart/TQ2007/01-02/tq111m-e.pdf (2007)
BASE
Show details
9
Words Reordering Based On Statistical Language Model ...
BASE
Show details
10
Words Reordering Based On Statistical Language Model ...
BASE
Show details
11
N-Grams: A Tool For Repairing Word Order Errors In Ill-Formed Texts ...
BASE
Show details
12
N-Grams: A Tool For Repairing Word Order Errors In Ill-Formed Texts ...
BASE
Show details
13
A Preliminary Statistical Investigation into the Impace of an N-Gram Analysis Approach Based on World Syntactic Categories Toward Text Author Classification
In: DTIC (2000)
BASE
Show details
14
Uses of the Diagnostic Rhyme Test (English Version) for Predicting the Effects of Communicators' Linguistic Backgrounds on Voice Communications in English: An Exploratory Study
In: DTIC (2000)
BASE
Show details
15
Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis
In: http://boa.sads.informatik.uni-frankfurt.de:8000/jens/rank.ps (1997)
BASE
Show details
16
Labelled Formal Languages and Their Uses.
In: DTIC AND NTIS (1991)
BASE
Show details
17
(-l 1992 Gordon and Brcach Scicncc Publishers S.A. Printed in the United Kinedom ON RANDOM AND ADAPTIVE PARALLEL GENERATION OF COMBINATORIAL OBJECTS
In: http://www.site.uottawa.ca/~ivan/F22-random-parallel.PDF (1990)
BASE
Show details
18
A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language.
In: DTIC AND NTIS (1987)
Abstract: Free-word order languages have long posed significant problems for standard parsing algorithms. This report presents an implemented parser, based on Government-Binding theory, for a particular free-word order language, Warlpiri, an aboriginal language of central Australia. The words in a sentence of a free-word order language may swap about relatively freely with little effect on meaning. It is assumed that this similarity in meaning is directly reflected in the syntax. The parser presented here properly processes free word order because it assigns the same syntactic structure of the permutations of a single sentence. The parser also handles fixed word order, as well as other phenomena. This parser differs from the more traditional rule-based parsing systems, e.g., context-free parsers, in that parsing is carried out via the construction of two different structures, one encoding precedence information and one encoding hierarchial information. This bipartite representation is the key to handling both free- and fixed-order phenomena.
Keyword: *PARSERS; *SYNTAX; Aborginal languages; ALGORITHMS; AUSTRALIA; CODING; Cybernetics; FOREIGN LANGUAGES; Free word order languages; Government binding theory; HANDLING; HIERARCHIES; Linguistics; PERMUTATIONS; SEQUENCES; THEORY; THESES; Word order; WORDS(LANGUAGE)
URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA189381
http://www.dtic.mil/docs/citations/ADA189381
BASE
Hide details
19
Stack permutations and an order relation for binary trees
In: Department of Computing Science Working Paper Series (1982)
BASE
Show details
20
A Decision Problem of Finite State Probabilistic Automata.
In: DTIC AND NTIS (1971)
BASE
Show details

Page: 1 2

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
26
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern