DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 26

1
Semi-Supervised and Unsupervised Sense Annotation via Translations ...
BASE
Show details
2
WiC = TSV = WSD: On the Equivalence of Three Semantic Tasks ...
Hauer, Bradley; Kondrak, Grzegorz. - : arXiv, 2021
BASE
Show details
3
One Sense Per Translation ...
Hauer, Bradley; Kondrak, Grzegorz. - : arXiv, 2021
BASE
Show details
4
Synonymy = Translational Equivalence ...
Hauer, Bradley; Kondrak, Grzegorz. - : arXiv, 2020
BASE
Show details
5
Using Translations to Distinguish Between Homonymy and Polysemy
Habibi, Amir Ahmad. - : University of Alberta. Department of Computing Science., 2020
BASE
Show details
6
Leveraging Translations for Word Sense Disambiguation
Luan, Yixing. - : University of Alberta. Department of Computing Science., 2020
BASE
Show details
7
Assessing the importance of several acoustic properties to the perception of spontaneous speech
BASE
Show details
8
Relation Extraction and its Application to Question Answering
Xu, Ying. - : University of Alberta. Department of Computing Science., 2017
BASE
Show details
9
Identifying Cognate Sets Across Dictionaries of Related Languages
St Arnaud, Adam, J.J.. - : University of Alberta. Department of Computing Science., 2017
BASE
Show details
10
Modelling phonetic reduction in a corpus of spoken English using Random Forests and Mixed-Effects Regression
Dilts, Philip C. - : University of Alberta. Department of Linguistics., 2013
BASE
Show details
11
Modelling phonetic reduction in a corpus of spoken English using Random Forests and Mixed-Effects Regression
Dilts, Philip C. - : University of Alberta. Department of Linguistics., 2013
BASE
Show details
12
Indexing and Querying Natural Language Text
Chubak, Pirooz. - : University of Alberta. Department of Computing Science., 2012
BASE
Show details
13
Indexing and Querying Natural Language Text
Chubak, Pirooz. - : University of Alberta. Department of Computing Science., 2012
Abstract: Degree: Doctor of Philosophy ; Abstract: Natural language text is a prominent source of representing and communicating information and knowledge. It is often desirable to search in granularities of text that are smaller than a document or to query the syntactic roles and relationships within syntactically annotated text sentences, often represented by parse trees. In this thesis, we study the problems of efficiently indexing and querying natural language text in the scenarios where (1) text is modelled as flat sequences of words and (2) text is modelled as collections of syntactically annotated trees. In the first scenario, we study some of the index structures that are capable of answering the class of queries referred to here as wild card queries and perform an analysis of their performance. Our experimental results on a large class of queries from different sources (including query logs and parse trees) and with various datasets reveal some of the performance barriers of these indexes. We present Word Permuterm Index (WPI) and show that it supports a wide range of wild card queries, is quick to construct and is highly scalable. Our experimental results comparing WPI to alternative methods on a wide range of wild card queries show a few orders of magnitude performance improvement for WPI while the memory usage is kept the same for all compared systems. In the second scenario, we study index structures and access methods that improve the performance of querying over syntactically parsed sentences. We propose a novel indexing scheme over unique subtrees as index keys. We also introduce the root-split coding scheme that concisely stores structural subtree information, making it possible to perform exact axes matching over subtrees. We theoretically study the properties of our coding and the limitations it imposes over query processing. Our extensive set of experiments show that root-split coding reduces the index size of a baseline index which stores the interval codes of all nodes by a factor of up to 5 (i.e. 80% reduction) and speeds up querying runtime by more than 6 times on average, when subtrees of sizes 1, . . . , 5 are indexed.
Keyword: Index Structures; Indexing; Natural Language Text; Querying; Subtree Index; Tree Pattern Matching
URL: https://era.library.ualberta.ca/files/h415p984x
http://hdl.handle.net/10402/era.25328
BASE
Hide details
14
Totozoquean
In: International journal of American linguistics. - Chicago : Univ. of Chicago Press 77 (2011) 3, 323-372
BLLDB
OLC Linguistik
Show details
15
3 Totozoquean
In: International journal of American linguistics. - Chicago : Univ. of Chicago Press 77 (2011) 4, 323-372
OLC Linguistik
Show details
16
Totozoquean
Beck, David; Brown, Cecil H.; Kondrak, Grzegorz. - : The University of Chicago Press, 2011
BASE
Show details
17
The Application of Chordal Graphs to Inferring Phylogenetic Trees of Languages
BASE
Show details
18
Leveraging supplementary transcriptions and transliterations via re-ranking
Bhargava, Aditya. - : University of Alberta. Department of Computing Science., 2011
BASE
Show details
19
Leveraging supplementary transcriptions and transliterations via re-ranking
Bhargava, Aditya. - : University of Alberta. Department of Computing Science., 2011
BASE
Show details
20
Letter-phoneme alignment: an exploration
In: Association for Computational Linguistics. Proceedings of the conference. - Stroudsburg, Penn. : ACL 48 (2010) 1, 780-788
BLLDB
Show details

Page: 1 2

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