Gcon: A graph-based technique for resolving ambiguity in query translation candidates

Hdl Handle:
http://hdl.handle.net/10149/94091
Title:
Gcon: A graph-based technique for resolving ambiguity in query translation candidates
Book Title:
Proceedings of the 2008 ACM symposium on applied computing
Authors:
Zhou, D. (Dong); Truran, M. (Mark); Brailsford, T. (Tim); Ashman, H. (Helen); Goulding, J. (James)
Editors:
Wainwright, R. L. (Roger); Haddad, H. M. (Hisham)
Affiliation:
University of Teesside. School of Computing.
Citation:
Zhou, D. et al. (2008) 'Gcon: A graph-based technique for resolving ambiguity in query translation candidates', 23rd annual ACM symposium on applied computing, Fortaleza, Ceara, Brazil, March 16-20, in Wainwright, R. L. and Haddad, H. M. (eds) Proceedings of the 2008 ACM symposium on applied computing. New York: ACM, pp.1566-1573.
Publisher:
ACM
Conference:
23rd annual ACM symposium on applied computing, SAC'08; Fortaleza, Ceara, Brazil, March 16-20 2008
Issue Date:
2008
URI:
http://hdl.handle.net/10149/94091
DOI:
10.1145/1363686.1364054
Abstract:
In the field of cross-language information retrieval (CLIR). the resolution of lexical ambiguity is a key challenge. Common mechanisms for the translation of query terms from one language to another typically produce a set of possible translation candidates, rather than some authoritative result. Correctly reducing a list of possible candidates down to a single translation is an enduring problem. Thus far, solutions have concentrated upon the use of the use of term co-occurrence information to guide the process of resolving translation-based ambiguity. In this paper we introduce a new disambiguation strategy which employs a graph-based analysis of generated co-occurrence data to determine the most appropriate translation for a given term.
Type:
Meetings and Proceedings; Book Chapter
Language:
en
Keywords:
co-occurrence measure; cross language information retrieval; disambiguation; graph analysis; ambiguity; translation
ISBN:
9781595937537
Rights:
ACM allows authors' version of their own ACM-copyrighted work on their personal servers or on servers belonging to their employers. For full details see http://www.acm.org/publications/policies/RightsResponsiblities [Accessed 11/03/2010]
Citation Count:
0 [Scopus, 11/03/2010]

Full metadata record

DC FieldValue Language
dc.contributor.authorZhou, D. (Dong)en
dc.contributor.authorTruran, M. (Mark)en
dc.contributor.authorBrailsford, T. (Tim)en
dc.contributor.authorAshman, H. (Helen)en
dc.contributor.authorGoulding, J. (James)en
dc.contributor.editorWainwright, R. L. (Roger)en
dc.contributor.editorHaddad, H. M. (Hisham)en
dc.date.accessioned2010-03-11T12:21:49Z-
dc.date.available2010-03-11T12:21:49Z-
dc.date.issued2008-
dc.identifier.isbn9781595937537-
dc.identifier.doi10.1145/1363686.1364054-
dc.identifier.urihttp://hdl.handle.net/10149/94091-
dc.description.abstractIn the field of cross-language information retrieval (CLIR). the resolution of lexical ambiguity is a key challenge. Common mechanisms for the translation of query terms from one language to another typically produce a set of possible translation candidates, rather than some authoritative result. Correctly reducing a list of possible candidates down to a single translation is an enduring problem. Thus far, solutions have concentrated upon the use of the use of term co-occurrence information to guide the process of resolving translation-based ambiguity. In this paper we introduce a new disambiguation strategy which employs a graph-based analysis of generated co-occurrence data to determine the most appropriate translation for a given term.en
dc.language.isoenen
dc.publisherACMen
dc.rightsACM allows authors' version of their own ACM-copyrighted work on their personal servers or on servers belonging to their employers. For full details see http://www.acm.org/publications/policies/RightsResponsiblities [Accessed 11/03/2010]en
dc.subjectco-occurrence measureen
dc.subjectcross language information retrievalen
dc.subjectdisambiguationen
dc.subjectgraph analysisen
dc.subjectambiguityen
dc.subjecttranslationen
dc.titleGcon: A graph-based technique for resolving ambiguity in query translation candidatesen
dc.typeMeetings and Proceedingsen
dc.typeBook Chapteren
dc.contributor.departmentUniversity of Teesside. School of Computing.en
dc.title.bookProceedings of the 2008 ACM symposium on applied computingen
dc.identifier.conference23rd annual ACM symposium on applied computing, SAC'08; Fortaleza, Ceara, Brazil, March 16-20 2008en
ref.citationcount0 [Scopus, 11/03/2010]en
or.citation.harvardZhou, D. et al. (2008) 'Gcon: A graph-based technique for resolving ambiguity in query translation candidates', 23rd annual ACM symposium on applied computing, Fortaleza, Ceara, Brazil, March 16-20, in Wainwright, R. L. and Haddad, H. M. (eds) Proceedings of the 2008 ACM symposium on applied computing. New York: ACM, pp.1566-1573.-
prism.startingPage1566-
prism.endingPage1573-
All Items in TeesRep are protected by copyright, with all rights reserved, unless otherwise indicated.