rian.ie - Results

Institutions | About Us | Help | Gaeilge

0 1000

Home
Browse
Advanced Search
Search History
Marked List
Statistics

A A A

Show search options

Hide search options

Search using:

in
in
in

From To

Optionally, filter by:

(Leave unchecked to search all fields)

Item Type

Book
Book chapter
Conference item
Contribution to newspaper/magazine
Doctoral thesis
Journal article
Master thesis (research)
Master thesis (taught)
Multimedia
Patent
Report
Review
Working paper
Other

Peer Review Status

Peer reviewed
Non peer reviewed
Unknown

Institution

Dublin City University
Dublin Institute of Technology
NUI Galway
NUI Maynooth
Trinity College Dublin
University College Cork
University College Dublin
University of Limerick

Funder

Enterprise Ireland (EI)
Environmental Protection Agency (EPA)
Health Research Board (HRB)
Higher Education Authority (HEA)
Irish Aid
Irish Research Council for Humanities and Social Sciences (IRCHSS)
Irish Research Council for Science Engineering and Technology (IRCSET)
Marine Institute
Science Foundation Ireland (SFI)
Teagasc

Language

Irish
English
Danish
French
German
Interlingue; Occidental
Italian
Japanese
Spanish; Castilian

Current Search:	All of 'Machine' and 'translating' in all fields;

259 items found

Sort by

Order

per page

Displaying Results 251 - 259 of 259 on page 11 of 11

Marked Mark

TTS – A Treebank Tool Suite (2002)

Cahill, Aoife; van Genabith, Josef

TTS – A Treebank Tool Suite (2002)

Cahill, Aoife; van Genabith, Josef

Abstract:

Treebanks are important resources in descriptive, theoretical and computational linguistic research, development and teaching. This paper presents a treebank tool suite (TTS) for and derived from the Penn-II treebank resource (Marcus et al, 1993). The tools include treebank inspection and viewing options which support search for CF-PSG rule tokens extracted from the treebank, graphical display of complete trees containing the rule instance, display of subtrees rooted by the rule instance and display of the yield of the subtree (with or without context). The search can be further restricted by constraining the yield to contain particular strings. Rules can be ordered by frequency and the user can set frequency thresholds. To process new text, the tool suite provides a PCFG chart parser (based on the CYK algorithm) operating on CFG grammars extracted from the treebank following the method of (Charniak, 1996) as well as a HMM bi-/trigram tagger trained on the tagged version of the tree...

http://doras.dcu.ie/16175/

Marked Mark

Total Recall? A case study of consistency in translation memory (2009)

Moorkens, Joss

Total Recall? A case study of consistency in translation memory (2009)

Moorkens, Joss

http://doras.dcu.ie/16422/

Marked Mark

Facilitating translation using source language paraphrase lattices (2010)

Du, Jinhua; Jiang, Jie; Way, Andy

Facilitating translation using source language paraphrase lattices (2010)

Du, Jinhua; Jiang, Jie; Way, Andy

Abstract:

For resource-limited language pairs, coverage of the test set by the parallel corpus is an important factor that affects translation quality in two respects: 1) out of vocabulary words; 2) the same information in an input sentence can be expressed in different ways, while current phrase-based SMT systems cannot automatically select an alternative way to transfer the same information. Therefore, given limited data, in order to facilitate translation from the input side, this paper proposes a novel method to reduce the translation difficulty using source-side lattice-based paraphrases. We utilise the original phrases from the input sentence and the corresponding paraphrases to build a lattice with estimated weights for each edge to improve translation quality. Compared to the baseline system, our method achieves relative improvements of 7.07%, 6.78% and 3.63% in terms of BLEU score on small, medium and largescale English-to-Chinese translation tasks respectively. The results show that...

http://doras.dcu.ie/16010/

Marked Mark

Exploiting visual salience for the generation of referring expressions (2004)

Kelleher, John ; van Genabith, Josef

Exploiting visual salience for the generation of referring expressions (2004)

Kelleher, John ; van Genabith, Josef

Abstract:

In this paper we present a novel approach to generating referring expressions (GRE) that is tailored to a model of the visual context the user is attending to. The approach integrates a new computational model of visual salience in simulated 3-D environments with Dale and Reiter’s (1995) Incremental Algorithm. The advantage of our GRE framework are: (1) the context set used by the GRE algorithm is dynamically computed by the visual saliency algorithm as a user navigates through a simulation; (2) the integration of visual salience into the generation process means that in some instances underspecified but sufficiently detailed descriptions of the target object are generated that are shorter than those generated by GRE algorithms which focus purely on adjectival and type attributes; (3) the integration of visual saliency into the generation process means that our GRE algorithm will in some instances succeed in generating a description of the target object in situations where GRE algor...

http://doras.dcu.ie/16166/

Marked Mark

Decreasing lexical data sparsity in statistical syntactic parsing - experiments with named entities (2011)

Hogan, Deirdre ; Foster, Jennifer ; Van Genabith, Josef

Decreasing lexical data sparsity in statistical syntactic parsing - experiments with named entities (2011)

Hogan, Deirdre ; Foster, Jennifer ; Van Genabith, Josef

Abstract:

In this paper we present preliminary experiments that aim to reduce lexical data sparsity in statistical parsing by exploiting information about named entities. Words in the WSJ corpus are mapped to named entity clusters and a latent variable constituency parser is trained and tested on the transformed corpus. We explore two different methods for mapping words to entities, and look at the effect of mapping various subsets of named entity types. Thus far, results show no improvement in parsing accuracy over the best baseline score; we identify possible problems and outline suggestions for future directions.

http://doras.dcu.ie/16465/

Marked Mark

Web 2.0, language resources and standards to automatically build a multilingual named entity lexicon (2011)

Toral, Antonio; Ferrández, Sergio ; Monachini, Monica ; Muñoz, Rafael

Web 2.0, language resources and standards to automatically build a multilingual named entity lexicon (2011)

Toral, Antonio; Ferrández, Sergio ; Monachini, Monica ; Muñoz, Rafael

Abstract:

This paper proposes to advance in the current state-of-the-art of automatic Language Resource (LR) building by taking into consideration three elements: (i) the knowledge available in existing LRs, (ii) the vast amount of information available from the collaborative paradigm that has emerged from the Web 2.0 and (iii) the use of standards to improve interoperability. We present a case study in which a set of LRs for diﬀerent languages (WordNet for English and Spanish and Parole-Simple-Clips for Italian) are extended with Named Entities (NE) by exploiting Wikipedia and the aforementioned LRs. The practical result is a multilingual NE lexicon connected to these LRs and to two ontologies: SUMO and SIMPLE. Furthermore, the paper addresses an important problem which aﬀects the Computational Linguistics area in the present, interoperability, by making use of the ISO LMF standard to encode this lexicon. The diﬀerent steps of the procedure (mapping, disambiguation, extraction, NE identiﬁcat...

http://doras.dcu.ie/16466/

Marked Mark

Improving dependency label accuracy using statistical post-editing: A cross-framework study (2011)

Cetinoglu, Ozlem; Bryl, Anton; Foster, Jennifer; van Genabith, Josef

Improving dependency label accuracy using statistical post-editing: A cross-framework study (2011)

Cetinoglu, Ozlem; Bryl, Anton; Foster, Jennifer; van Genabith, Josef

Abstract:

We present a statistical post-editing method for modifying the dependency labels in a dependency analysis. We test the method using two English datasets, three parsing systems and three labelled dependency schemes. We demonstrate how it can be used both to improve dependency label accuracy in parser output and highlight problems with and differences between constituency-to-dependency conversions.

http://doras.dcu.ie/16430/

Marked Mark

Toward higher effectiveness for recall-oriented information retrieval: A patent retrieval case study (2012)

Magdy, Walid

Toward higher effectiveness for recall-oriented information retrieval: A patent retrieval case study (2012)

Magdy, Walid

Abstract:

Research in information retrieval (IR) has largely been directed towards tasks requiring high precision. Recently, other IR applications which can be described as recall-oriented IR tasks have received increased attention in the IR research domain. Prominent among these IR applications are patent search and legal search, where users are typically ready to check hundreds or possibly thousands of documents in order to find any possible relevant document. The main concerns in this kind of application are very different from those in standard precision-oriented IR tasks, where users tend to be focused on finding an answer to their information need that can typically be addressed by one or two relevant documents. For precision-oriented tasks, mean average precision continues to be used as the primary evaluation metric for almost all IR applications. For recall-oriented IR applications the nature of the search task, including objectives, users, queries, and document collections, is differ...

http://doras.dcu.ie/16814/

Marked Mark

Grammatical feature data-oriented parsing (2007)

Finn, Regina

Grammatical feature data-oriented parsing (2007)

Finn, Regina

Abstract:

LFG-DOP is a powerful, hybrid model of language processing where the tree representations of Data-Oriented Parsing (DOP) are augmented with the functional representations of Lexical Functional Grammar (LFG). The result is a robust parsing model which generates linguistically informed output. However, difficulties arise in the accurate implementation of fragmentation and sampling in this model. Due to these unresolved issues, there is currently no satisfactory implementation of the LFG-DOP model. In this thesis, we propose a backing-off to Grammatical Feature-DOP (GF-DOP). The GF-DOP model differs from Tree-DOP and LFG-DOP in that the trees are annotated with selected features extracted from the f-structure, rather than explicitly linked to corresponding f-structure units. In this way, we rnake use of the irlformation available to us in the f-structure, while avoiding the problems inherent in the implementation of LFG-DOP. We aim to improve the quality of the parses generated by mod...

http://doras.dcu.ie/17009/